hdoj-1289-A Bug's Life【种类并查集】
来源:互联网 发布:苏州大学网络网上缴费 编辑:程序博客网 时间:2024/05/22 08:13
A Bug's Life
Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11386 Accepted Submission(s): 3709
Problem 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!HintHuge input,scanf is recommended.
Source
TUD Programming Contest 2005, Darmstadt, Germany
Recommend
linle | We have carefully selected several similar problems for you:1558 1811 1325 2473 3172
#include<stdio.h>int root[2010];int rank[2010];int find_set(int x){if(root[x]==x) return x;int t=root[x];root[x]=find_set(t);rank[x]=(rank[x]+rank[t])%2;return root[x];}void unio(int a,int b){int t,k;t=root[a];k=root[b];root[t]=k;rank[t]=(rank[b]+1-rank[a]);return ;}int main(){int t,cas=0;;scanf("%d",&t);while(t--){printf("Scenario #%d:\n",++cas);int n,m,i,ok=0,a,b;scanf("%d%d",&n,&m);for(i=0;i<=n;++i){root[i]=i;rank[i]=0;}for(i=0;i<m;++i){scanf("%d%d",&a,&b); if(!ok){int pa,pb;pa=find_set(a) ;pb=find_set(b);if(pa==pb&&(rank[a]==rank[b])){ok=1;}elseunio(a,b);}}if(ok)printf("Suspicious bugs found!\n\n");elseprintf("No suspicious bugs found!\n\n");}return 0;}
0 0
- hdoj-1289-A Bug's Life【种类并查集】
- HDOJ 1829 A Bug's Life (种类并查集)
- poj 2492 A Bug's Life(种类并查集)
- A Bug's Life(hdu1829种类并查集)
- 【种类并查集】-POJ-2492-A bug's life
- HDU 1829 A Bug's Life(种类并查集)
- A Bug's Life 种类并查集
- poj2492 A Bug's Life 种类并查集
- A Bug's Life --- 种类并查集
- HDU 1829 A Bug's Life【种类并查集】
- HDU1829:A Bug's Life(种类并查集)
- HDU1829 A Bug's Life(种类并查集)
- 【种类并查集】 hdu1829 A bug's Life
- A Bug's Life(种类并查集)
- POJ2492 -A Bug's Life(种类并查集)
- HDOJ 1829 A Bug's Life (并查集)
- (并查集)A Bug's Life -- HDOJ
- HDOJ 1829 A Bug's Life (并查集)
- Android 绘图 cache setDrawingCacheEnabled(boolean flag)
- ACboy needs your help again!(简单栈)
- 开始刷leetcode day78:Lowest Common Ancestor of a Binary Tree
- 为什么无法定义1px左右高度的容器
- undefined reference to `libiconv_open'
- hdoj-1289-A Bug's Life【种类并查集】
- laravel陌生知识点快速学习(一)
- Java设计模式——六大原则
- 远程连接mysql 授权方法详解
- 归并排序算法笔记
- eclipse快捷键大全
- as插件Parcelable介绍
- 公司提成
- Unity中添加AES加密