记录改bug的第n天

虫子的生活
虫子的生活

#include<iostream>

using namespace std;

const int N = 2010;

int pre[N], r[N];//pre存储i的父节点 r存储i和父节点的关系，0表示i和父节点是同性，1表示是异性 
void init(int n)
{
	for (int i = 0; i <= n; i++){
		pre[i] = i;//自己为自己的父节点 
		r[i] = 0;//自己与自己是同性 
	}
}

int find(int x)
{
	if (x != pre[x]){
		int rt = pre[x];
		pre[x] = find(rt);
		r[x] ^= r[rt];
	}
	return pre[x];
}

bool join(int x, int y)
{
	int fx = find(x);
	int fy = find(y);
	if (fx != fy){//fx和fy是两颗树，合并 
		pre[fy] = fx;
		r[fy] = 1 ^ r[x] ^ r[y];//求fy和其父节点fx的关系：y和fy的关系是r[y],y和x的关系是1，x和fx的关系是r[x], 
	}
	else{
		if (r[x] == r[y])
			return false;
	}
	return true;
}

int main()
{
	int n, m, T, a, b, x;
	char c;
	scanf("%d", &T);
	for (int t = 1; t <= T; t++){
		scanf("%d%d", &n, &m);
		init(n);
		bool flag = true;
		while (m--){
			scanf("%d%d", &a, &b);
			if (!join(a, b))
				flag = false;
		}
		printf("Scenario #%d:\n", t);
		if (!flag)
			printf("Suspicious bugs found!\n\n");
		else
			printf("No suspicious bugs found!\n\n");
	}
	return 0;
}

#include<iostream>
using namespace std;
const int N = 2010;
int p[N], d[N];
int find(int x)
{
	if (p[x] != x)
	{
		int t = find(p[x]);
		d[x] += d[p[x]];
		p[x] = t;
	}
	return p[x];
}
int main(){
	int cases;
	int m, n;
	int worm1, worm2;
	scanf("%d", &cases); int j = 1;
	while (cases--){
		bool falg = true;
		scanf("%d%d", &m, &n);
		for (int i = 1; i <= m; i++){
			p[i] = i;d[i] = 0;//每组实验都要初始化
		}
		while (n--){
			scanf("%d%d", &worm1, &worm2);
			int px = find(worm1), py = find(worm2);
			if (px == py && ((d[worm1] - d[worm2]) % 2) == 0) falg = false;//在一个集合里面了
			else if (px != py)
			{
				p[px] = py;
				d[px] = d[worm2] + 1 - d[worm1];
			}
		}
		cout << "Scenario #" << j << ":" << endl;
		if (!falg){
			cout << "Suspicious bugs found!" << endl; printf("\n");
		}
		else{
			cout << "No suspicious bugs found!" << endl; printf("\n");
		}
		j++;
	}
	return 0;
}