种类并查集 poj1182

种类并查集的核心思想就是拆点。比如本题食物链，我们把一个点拆为同类（self），捕食（eat），天敌（enemy）。

我代码中的变量描述的很清楚，直接上代码：

#include <cstdio>
#define N 50010
int n, k, fa[3*N];
int getfa(int x) {return (fa[x] == x)?x:(fa[x] = getfa(fa[x]));}
int main() {
	scanf("%d%d", &n, &k);
	for(int i = 1; i <= 3 * n; ++i) fa[i] = i;
	int ans = 0;
	for(int i = 1; i <= k; ++i) {
		int d, x, y; scanf("%d%d%d", &d, &x, &y);
		int selfx = (x - 1) * 3 + 1, eatx = (x - 1) * 3 + 2, enemyx = x * 3;
		int selfy = (y - 1) * 3 + 1, eaty = (y - 1) * 3 + 2, enemyy = y * 3;
		int fx1 = getfa(selfx), fx2 = getfa(eatx), fx3 = getfa(enemyx);
		int fy1 = getfa(selfy), fy2 = getfa(eaty), fy3 = getfa(enemyy);
		if(d == 1) {
			if(fx1 == fy2 || fx2 == fy1 || x > n || y > n) ++ans;
			else {fa[fx1] = fy1; fa[fx2] = fy2; fa[fx3] = fy3;}
		}else {
			if(fx1 == fy1 || fx1 == fy2 || x == y || x > n || y > n) ++ans;
			else {fa[fx2] = fy1; fa[fx1] = fy3; fa[fx3] = fy2;}
		}
	}
	printf("%d", ans);
	return 0;
}