poj2492 A Bug's Life 并查集
来源:互联网 发布:编程电脑配置要求2017 编辑:程序博客网 时间:2024/05/16 06:23
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.
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
2
3 3
1 2
2 3
1 3
4 2
1 2
3 4
Sample Output
Scenario #1:
Suspicious bugs found!
Scenario #2:
No suspicious bugs found!
题目大意:给出N条虫子,然后a和b交配,给出M对a和b后问
有没有同性恋的虫子。。。
#include <iostream>#include <algorithm>#include <cstdio>using namespace std;int f[1000001];int y[1000001];int find(int x)///查找父亲;{ return f[x]==x?x:find(f[x]);}void hb(int x,int y)///合并~{ int m=find(x); int n=find(y); if(m!=n) f[m]=n;}int main(){ int n,m,T; cin>>T; for(int k=1; k<=T; k++) { int flag=0; cin>>n>>m; for(int i=1; i<=n; i++) { f[i]=i; y[i]=0; } int a,b; for(int i=0; i<m; i++) { cin>>a>>b; if(y[a]==0&&y[b]==0)///判断~ { y[a]=b; y[b]=a; } else if(y[a]!=0&&y[b]==0) { y[b]=a; hb(b,y[a]); } else if(y[a]==0&&y[b]!=0) { y[a]=b; hb(a,y[b]); } else { hb(y[b],a); hb(y[a],b); } if(find(a)==find(b)) { flag=1; } } printf("Scenario #%d:\n",k); if(flag==1) printf("Suspicious bugs found!\n"); if(flag==0) printf("No suspicious bugs found!\n"); printf("\n"); } return 0;}
- POJ2492--A Bug's Life--并查集
- poj2492 A Bug's Life 种类并查集
- POJ2492 A Bug's Life (并查集)
- poj2492--A Bug's Life(并查集变形)
- POJ2492 A Bug's Life 【并查集】
- poj2492 A Bug's Life(并查集)
- poj2492 A Bug's Life 并查集
- poj2492 A Bug's Life(并查集)
- poj2492 A Bug's Life (并查集拓展)
- POJ2492 A Bug's Life 并查集
- POJ2492 A Bug's Life 种群并查集
- poj2492 A Bug's Life(并查集)
- POJ2492 a bug's life并查集扩展
- POJ2492 -A Bug's Life(种类并查集)
- poj2492——A Bug's Life(并查集扩展)
- poj2492 A bug's life{种类并查集}
- POJ2492(A Bug's Life) && POJ1703(Find them, Catch them)带权(种类)并查集
- 【带偏移量的并查集】:poj2492,A Bug's Life
- ContentProvider
- Java反射机制之集合泛型的本质
- 支持向量机
- Java字符串切割
- HDU 1257.最少拦截系统【8月9】
- poj2492 A Bug's Life 并查集
- DP - hdu5291 Candy Distribution
- python爬虫抓取LeetCode题目
- 101. Symmetric Tree
- 装wampserver时显示计算机丢失MSVCR110.dll
- hdu 1142(最短路dijkstra)
- 【Qt OpenGL教程】21:线、反走样、正投影和简单的声音
- C++:复制构造函数___浅拷贝
- UVA - 1442 Cav