福利局
来源:互联网 发布:淘宝如何描述宝贝 编辑:程序博客网 时间:2024/04/27 08:31
Description
Background
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.
Input
The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.
Output
The output for every scenario is a line containing "Scenario #i:", where i is the number of the scenario starting at 1, followed by one line saying either "No suspicious bugs found!" if the experiment is consistent with his assumption about the bugs' sexual behavior, or "Suspicious bugs found!" if Professor Hopper's assumption is definitely wrong.
Sample Input
23 31 22 31 34 21 23 4
Sample Output
Scenario #1:Suspicious bugs found!Scenario #2:No suspicious bugs found!
Hint
Huge input,scanf is recommended.
#include <iostream>#include<algorithm>#include<cstdio>#include<cmath>#include<cstring>#include<cstdlib>#include<stack>#include<queue>using namespace std;stack <char> s;int par[4005];queue<int> p;void init(){ int i; for(i=0;i<4005;i++) par[i]=i;}int find(int x){ if (par[x] != x) return par[x] = find(par[x]); return par[x];}void unite(int a, int b){ a = find(a); b = find(b); par[b] = a;}int main(){ int n, k = 0; scanf("%d", &n); while (n--) { init(); k++; int m, x, ans = 0; scanf("%d%d", &m, &x); for (int i = 0; i < x; i++) { int l,d; scanf("%d%d", &l,&d); unite(l,d+m); unite(l+m,d); if (find(d) == find(l)||find(d+m)==find(l+m)) ans=1; } if(k!=1) printf("\n"); if (ans == 0) printf("Scenario #%d:\nNo suspicious bugs found!\n", k); else printf("Scenario #%d:\nSuspicious bugs found!\n", k); } return 0;}
0 0
- 福利局
- 福利
- 福利管理
- MobileVLCKit福利
- 程序员福利
- 程序员福利
- 给大家的福利
- 关心自己的福利!
- 待遇与福利基本词汇
- 个人开发者的福利
- 开发者福利:云测试
- XT公司福利很好!
- 不定期搬运二次元福利
- 应该知道的福利
- vmware workstation 11福利~
- CocoaPods福利时间
- ios开发者福利
- 【周末福利】源码分享
- iOS Block 的理解与学习
- 去除右键疑难问题
- 关于Date
- 关于缓存
- android基础创建定时提醒
- 福利局
- Mafile 常用函数调用函数
- 用FlySaucer遇到的中文字体和换行问题
- elasticsearch小记之——must和filter的主要区别
- 把字符串按指定格式拼接
- hdu 2830 Matrix Swapping II
- 企业网站优化:seo优化要做好的三件事
- oracle的加解密函数
- hdu5634 BestCoder Round #73 (div.1)