POJ 2492 A Bug‘s Life（带权并查集）

POJ 2492 A Bug’s Life（带权并查集）

vj链接

Solution

和POJ 1733 非常像，可以说是 1733 的青春版。。。

代码

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
//#define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<double, int> pdi;
typedef double dd;
typedef long long ll;
const int MAXN = 2010;
const int MAXM = 10010;
const dd eps = 1e-6;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;

int n, m, fa[MAXN], dis[MAXN];
int mod(int x){
	return (x % 2 + 2) % 2;
}
int fd(int x)
{
	if(x == fa[x])
		return x;
	int f = fd(fa[x]);
	dis[x] = mod(dis[x] + dis[fa[x]]);
	return (fa[x] = f);
}
bool un(int x, int y)
{
	int fx = fd(x), fy = fd(y);
	if(fx == fy)
	{
		if(mod(dis[y] - dis[x]) == 0)
			return 0;
		return 1;
	}
	fa[fy] = fx;
	dis[fy] = mod(1 - dis[y] + dis[x]);
	return 1;
}

int main()
{
	int t;
	scanf("%d", &t);
	for (int _ = 1; _ <= t;_++)
	{
		memset(dis, 0, sizeof(dis));
		printf("Scenario #%d:\n", _);
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n;i++)
			fa[i] = i;
		bool ok = 1;
		while(m--)
		{
			int x, y;
			scanf("%d%d", &x, &y);
			if (!un(x, y))
				ok = 0;
		}
		if(ok)
			printf("No suspicious bugs found!\n");
		else
			printf("Suspicious bugs found!\n");
		if(_!=t)
			printf("\n");
	}
}