POJ 2492 (并查集)
来源:互联网 发布:维生素vb对皮肤的作用 编辑:程序博客网 时间:2024/04/30 13:35
A Bug's Life
Time Limit: 10000MS Memory Limit: 65536KTotal Submissions: 20235 Accepted: 6578
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.
和那道1703几乎是一模一样。。。。改了两下就交了。。。第一次给PE是因为没注意输出数据之间有空格,第二次AC
#include<stdio.h>#include<string.h>#define clear(a,b) memset(a,b,sizeof(a))#define maxn 200000int t,k,fa[maxn],enemy[maxn];int getfa(int a){ if (fa[a] == a) return a; else fa[a] = getfa(fa[a]); return fa[a];}int judge(int a,int b){ return getfa(a) == getfa(b);}void unite(int a,int b){ fa[getfa(b)] = getfa(a);}void work(){ int m,n,i,b,a; char ch; clear(enemy,0); scanf("%d%d",&n,&m); for(i = 1;i <= n;i++) fa[i] = i; for(i = 1;i <= m;i++) { scanf("%d%d",&a,&b); if (judge(a,b)) { int temp = m - i; while (temp--) scanf("%d%d",&a,&b); printf("Scenario #%d:\nSuspicious bugs found!\n",k); return ; } if (enemy[a]) unite(enemy[a],b); if (enemy[b]) unite(enemy[b],a); enemy[a] = b; enemy[b] = a; } printf("Scenario #%d:\nNo suspicious bugs found!\n",k); return ;}int main(){ scanf("%d",&t); for(k = 1;k <= t;k++) {work();if(k < t)printf("\n");} return 0;}
- POJ 2492 并查集
- POJ - 2492 并查集
- POJ 2492 (并查集)
- poj 2492(并查集)
- POJ 2492 并查集
- poj 2492(并查集)
- 【并查集】poj 2492
- Poj 并查集
- poj并查集
- POJ 并查集
- poj--1703/2492 (经典并查集)
- POJ 2492 并查集 注释版
- POJ 2492[带权并查集]
- hdu-1829 & poj-2492 并查集
- POJ-2492(并查集问题)
- 并查集的扩展 poj 2492
- POJ 1703 POJ 2492 并查集 和 食物链差不多
- poj 2524 并查集
- poj 1790 Base Numbers(dp)
- 通过ksoap2访问.NET Webservice 的数据库
- milestone等系列android手机无法adb下使用sqlite3问题
- 在Android中查看和管理sqlite数据库
- 百度快照-更新原理-更新方法-更新技术-更新技巧
- POJ 2492 (并查集)
- 一闪一闪的小星星 - 玻璃瓶里的电子萤火虫
- 我的.Net武器库
- Nokia是否还有未来 - 小议诺基亚和微软的战略布局
- 边缘特征提取方法
- 新装Fedora16,一点记录
- 5种方法解除开机密码
- 207. He is lifeless that is faultless.只有死人才不犯错误
- 2012.4.5 通知