杭电 1829 A Bug's Life 经典并查集

原创 2012年03月31日 16:32:14

    卧槽,写这道题写了两天啊,,,两天啊,,,容易吗。。。搞基的bug伤不起啊。。。。并查集扩展,题目:

A Bug's Life

Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3921    Accepted Submission(s): 1266


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.
 

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.
ac代码:

#include <iostream>
#include <string.h>
#include <cstdio>
using namespace std;
const int N=12010;
int p[N],relation[N];
int find(int x){
	int px=p[x];
	if(x==p[x])return x;
	p[x]=find(p[x]);
	relation[x]=(relation[x]+relation[px])%2;
	return p[x];
}
int main(){
	//freopen("in.txt","r",stdin);
	int numcase,k=0;
	scanf("%d",&numcase);
	while(numcase--){
	  int n,m;
	  scanf("%d%d",&n,&m);
	  int a,b,flag=0;
	  for(int i=1;i<=n;++i){
	    p[i]=i;
		relation[i]=0;
	  }
	  while(m--){
	    scanf("%d%d",&a,&b);
		if(flag==1)
			continue;
		int roota=find(a);
		int rootb=find(b);
		if(roota==rootb){
			if(relation[a]==relation[b]){
			  flag=1;
			}
		}
		else{
		  p[rootb]=roota;
		  relation[rootb]=((relation[a]+1)%2+relation[b])%2;
		}
	  }
	  printf("Scenario #%d:\n",++k);
	  if(flag)puts("Suspicious bugs found!");
	  else puts("No suspicious bugs found!");
	  puts("");
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

杭电1829 A Bug's Life 并查集

假设有 1,2 2,3 即1--2--3, 明显相邻的两个不能是同性别的,如果相邻两个是同性的,那么说明就可能是有同性恋存在。 上面假设1是男性,用false来代替,那么按顺序分别是false...

HDU-1829 A Bug's Life (带权并查集)

终于自己做出来第一个带权并查集了!!! 虽然这题和真正的难题有一定差距,毕竟第一次尝试嘛,还算顺利。 这题就是给出的两个数,不是同一个性别,比如给出1 3,1和3就不是同一种性别,如果有说明和上面...

HDU 1829 A Bug's Life 并查集

A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...

HDU 1829 A Bug's Life 并查集

A Bug's Life Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) T...

hdu 1829 A Bug's Life ( 并查集 )

A Bug's Life Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDU 1829 A Bug's Life【种类并查集】

A Bug's Life Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

HDU_1829 A Bug's Life(并查集)

Problem Description Background  Professor Hopper is researching the sexual behavior of a rare speci...

HDU1829 A Bug's Life 并查集

并查集模板:http://blog.csdn.net/mishifangxiangdefeng/article/details/7165351/* HDU1829A Bug's Life 并查集的应用...

POJ 2492 || HDU 1829:A Bug's Life(并查集)

传送门: POJ:点击打开链接 HDU:点击打开链接 A Bug's Life Time Limit: 10000MS   Memory Lim...

hdu1829 A Bug's Life 并查集

题目内容非常不社会主义核心价值观,提取成数学意义即 给定若干点及其边,判断是否是二分图哦哟原来图题还可以跳过矩阵、邻接表,强强强维护一个数组oppsite[](opp)读到一个边(a,b),如果op...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)