HDU6165 FFF at Valentine(爆搜)
来源:互联网 发布:share.js用法 编辑:程序博客网 时间:2024/06/02 00:56
FFF at Valentine
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 212
Problem Description
At Valentine's eve, Shylock and Lucar were enjoying their time as any other couples. Suddenly, LSH, Boss of FFF Group caught both of them, and locked them into two separate cells of the jail randomly. But as the saying goes: There is always a way out , the lovers made a bet with LSH: if either of them can reach the cell of the other one, then LSH has to let them go.
The jail is formed of several cells and each cell has some special portals connect to a specific cell. One can be transported to the connected cell by the portal, but be transported back is impossible. There will not be a portal connecting a cell and itself, and since the cost of a portal is pretty expensive, LSH would not tolerate the fact that two portals connect exactly the same two cells.
As an enthusiastic person of the FFF group, YOU are quit curious about whether the lovers can survive or not. So you get a map of the jail and decide to figure it out.
Input
First line is two number n and m, the total number of cells and portals in the jail.(2≤n≤1000,m≤6000)
Then next m lines each contains two integer u and v, which indicates a portal from u to v.
Output
If the couple can survive, print “I love you my love and our love save us!”
Otherwise, print “Light my fire!”
Otherwise, print “Light my fire!”
Sample Input
35 51 22 32 43 54 53 31 22 33 15 51 22 33 13 44 5
Sample Output
Light my fire!I love you my love and our love save us!I love you my love and our love save us!
没想到爆搜都能A
#include<bits/stdc++.h>#define mem(a,b) memset(a,b,sizeof(a))using namespace std;const int N=1e3+10;const int M=6e3+10;int n,m;bool vis[N],e[N][N];vector<int>v[N];void dfs(int x,int fa){ vis[x]=true; e[fa][x]=true; for(int i=0;i<v[x].size();i++) { if(vis[v[x][i]])continue; dfs(v[x][i],fa); }}int main(){ int t,x,y; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { v[i].clear(); for(int j=1;j<=n;j++) e[i][j]=false; } for(int i=0; i<m; i++) { scanf("%d%d",&x,&y); v[x].push_back(y); } for(int i=1;i<=n;i++) { mem(vis,false); dfs(i,i); } bool flag=true; for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { if(e[i][j]==false&&e[j][i]==false) { flag=false; break; } } } if(flag) printf("I love you my love and our love save us!\n"); else printf("Light my fire!\n"); } return 0;}
阅读全文
0 0
- HDU6165 FFF at Valentine(爆搜)
- HDU6165-FFF at Valentine
- HDU6165-FFF at Valentine
- HDU6165 FFF at Valentine【BFS】
- hdu6165 FFF at Valentine【强联通缩点+拓扑排序】
- hdu6165 FFF at Valentine 强联通分量+拓扑排序
- hdu6165 FFF at Valentine 强联通缩点
- hdu6165-tarjan&&多校9&&模板修正|XJB暴力-FFF at Valentine
- HDU6165 FFF at Valentine(并查集+tarjan缩点+拓扑排序)
- hdu6165 FFF at Valentine 2017多校第九场1005 dfs
- HDU6165 FFF at Valentine(深搜dfs,2017 HDU多校联赛 第9场)
- HDU6165 FFF at Valentine(深搜dfs,2017 HDU多校联赛 第9场)
- HDU_6165_ FFF at Valentine
- FFF at Valentine HDU
- FFF at Valentine HDU
- HDU 6165 FFF at Valentine
- HDU-6165 FFF at Valentine
- HDU 6165 FFF at Valentine
- Android图片缓存策略
- IP问问:特殊类型IP地址介绍——VPN
- 中断的上下文切换和任务调度的上下文切换
- HDU
- tomcat启动timer定时器会执行两次问题解决方案
- HDU6165 FFF at Valentine(爆搜)
- HDU1702--ACboy needs your help again!(栈和队列)
- 大谈设计模式及单例模式代码
- IP问问:关于多区域IP地址定位在互联网在线广告投放领域中的应用分析
- 斗地主之初始评估与叫牌
- JS获取北京时间并制作时钟效果
- Glide框架学习小结
- 设计模式--单例模式探究
- 如何在自己的虚拟机上配置网络