A Bug‘s Life POJ - 2492【并查集】

A Bug’s Life POJ - 2492

题目

思路：维护带边权的并查集，性别与根结点相同距离对2取模就是0，不同就是1

具体代码如下

#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;

const int N = 2010;

int n, m;
int p[N], d[N];

int find(int x){
	if(p[x] != x){
		int t = find(p[x]);
		d[x] += d[p[x]] % 2;
		p[x] = t;
	}
	return p[x];
}

int main(){
	
	int T, kase = 0;
	scanf("%d", &T);
	
	while(T--){
		scanf("%d%d", &n, &m);
		for(int i=1; i<=n; ++i){
			p[i] = i;
			d[i] = 0;
		}
		int flag = 0;
		for(int i=0; i<m; ++i){
			int x, y;
			scanf("%d%d", &x, &y);
			int px = find(x), py = find(y);
			if(px == py && (d[x] + d[y]) % 2 != 1) flag = 1;
			else{
				p[px] = py;
				d[px] = d[x] + d[y] + 1;
			}
		}
		
		printf("Scenario #%d:\n", ++kase);
		if(!flag) puts("No suspicious bugs found!\n");
		else puts("Suspicious bugs found!\n");
	}
	
	return 0;
}