HDU 1829 & POJ 2492 A Bug's Life (并查集)
来源:互联网 发布:常用服务器端口有哪些 编辑:程序博客网 时间:2024/06/05 01:51
A Bug's Life
Time Limit: 10000MSMemory Limit: 65536KTotal Submissions: 23483Accepted: 7638
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!
/* 并查集 对于输入的两个值s,e,首先判断他们是否是同个集合,如果是, 则说明出现了与假设矛盾的结果,用bool标记一下。 否则,将s的相反性别的与e合并,e的相反性别与s合并。 390MS260K */#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#define SIZE 2005using namespace std;struct node{ int fa,opp;}fat[SIZE];int Case,n,m;int find(int x){ if(x != fat[x].fa) fat[x].fa = find(fat[x].fa); return fat[x].fa;}void combine(int x,int y){ int tx = find(x); int ty = find(y); if(tx != ty) fat[tx].fa = ty;}int main(){ scanf("%d",&Case); for(int ca=1; ca<=Case; ca++) { scanf("%d%d",&n,&m); for(int i=1; i<=n; i++) { fat[i].fa = i; fat[i].opp = 0; } bool flag = false; int s,e; for(int i=1; i<=m; i++) { scanf("%d%d",&s,&e); if(flag)continue; if(find(s) == find(e)) flag = true; if(fat[s].opp) combine(fat[s].opp,e); if(fat[e].opp) combine(fat[e].opp,s); fat[s].opp = e; fat[e].opp = s; } printf("Scenario #%d:\n",ca); if(flag) printf("Suspicious bugs found!\n\n"); else printf("No suspicious bugs found!\n\n"); } return 0;}
- HDU 1829 & POJ 2492 A Bug's Life (并查集)
- [并查集]HDU 1829/POJ 2492/HOJ 2319 A Bug's Life
- POJ 2492 || HDU 1829:A Bug's Life(并查集)
- HDU 1829 && POJ 2492 A Bug's Life(种类并查集)
- POJ 2492/hdu 1829 A Bug's Life【带权并查集】
- poj 2492 A Bug's Life(并查集)
- POJ 2492 A Bug's Life(并查集)
- poj 2492 并查集 A Bug's Life
- POJ-2492 a bug's life 并查集
- poj 2492 并查集 a bug's life
- POJ 2492 A Bug's Life (并查集)
- poj 2492 A Bug's Life(种类并查集)
- poj 2492 -- A Bug's Life(并查集)
- POJ 2492 A Bug's Life (并查集)
- poj 2492 - A Bug's Life(并查集)
- 【种类并查集】-POJ-2492-A bug's life
- POJ 2492 A Bug's Life(并查集)
- POJ-2492 A Bug's Life 并查集
- table 表
- osg用qt做界面的经验总结。
- HDU 1016 素数环 深度优先搜索(DFS)
- Delphi 用WinInet 单元实现 POST提交数据
- C语言写参数可变的函数
- HDU 1829 & POJ 2492 A Bug's Life (并查集)
- 加载.pc文件 PKG_CONFIG_PATH
- Java编码浅析2
- 关于android 中EditText 特殊字符过滤和字符长度限制的最优方法
- Mac OS X 中安装 brew
- zz国考130+经验分享
- 图的连通性—关节点和重连通分量
- 手动创建数据库步骤
- xss-html-filter