POJ-2492(并查集问题)
来源:互联网 发布:魔方社区网络 编辑:程序博客网 时间:2024/05/16 14:00
A Bug's Life
Time Limit: 10000MS Memory Limit: 65536KB64bit IO Format: %I64d & %I64u
Submit
Status
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!
Hint
Huge input,scanf is recommended.
Source
Time Limit: 10000MS Memory Limit: 65536KB64bit IO Format: %I64d & %I64u
Submit
Status
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!
Hint
Huge input,scanf is recommended.
Source
TUD Programming Contest 2005, Darmstadt, Germany
单纯的并查集问题,只要分好类就OK了。
#include <cstdio>#include <iostream>#include <cmath>#include <algorithm>using namespace std;int x[1003000];int y[1003000];int find(int p){ if (p==x[p]) { return p; } else return x[p]=find(x[p]);}void unit(int p,int q){ p=find(p); q=find(q); if (p==q) return ; else { x[p]=q; }}int main(){ int Count; int sum=1; scanf("%d",&Count); int m,n; for (int num=0;num<Count;num++) { scanf("%d",&m); scanf("%d",&n); for (int number1=0;number1<2*m;number1++) { x[number1]=number1; } int p,q; int flag=0; for (int number1=0;number1<n;number1++) { scanf("%d %d",&p,&q); p=p-1; q=q-1; if (p>=m&&p<0||q>=m&&q<0) { flag=1; } if (find(p)==find(q)) { flag=1; } else { unit(p,q+m); unit(p+m,q); } } if (flag==1) { printf("Scenario #%d:\nSuspicious bugs found!\n",sum); } else { printf("Scenario #%d:\nNo suspicious bugs found!\n",sum); } if (num<Count-1) { printf("\n"); } sum++; } return 0;}
0 0
- POJ-2492(并查集问题)
- POJ 2492 并查集
- POJ - 2492 并查集
- POJ 2492 (并查集)
- poj 2492(并查集)
- POJ 2492 并查集
- poj 2492(并查集)
- 【并查集】poj 2492
- poj 1182 并查集经典问题
- poj并查集问题-2524
- POJ 2524 宗教问题 并查集
- 并查集问题扩展 poj 1703
- Poj 并查集
- poj并查集
- POJ 并查集
- POJ 2492 A Bug's Life (并查集)
- POJ 2492 A Bug's Life (并查集)
- POJ 2492 A Bug's Life(并查集)
- SAS 时区管理 -1
- codeforces 628e
- SQL复习总结——DQL,聚合函数与分组
- You must specifiy a layout in the include tag: <include layout="@layout/layoutID" />
- 精炼的Java线程Sleep,yield,wait,notify,Synchronized
- POJ-2492(并查集问题)
- Experimental Educational Round: VolBIT Formulas Blitz(数学、组合数学)
- mac上Unix时间戳的使用
- 在用floor(XXX+0.5)做四舍五入时候发生的问题
- 解决double的精度问题-BigDecimal
- java中 本地方法 Native Method
- Xcode 7 error: “Missing iOS Distribution signing identity for …”
- animate实现与slideToggle()相似效果的左右方向折叠
- Java操作Hbase进行建表、删表以及对数据进行增删改查,条件查询