题目来源:http://poj.org/problem?id=1182
并查集经典题目。思路来自:https://blog.csdn.net/niushuai666/article/details/6981689
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn=5e4+10;
int n,k,d,x,y;
struct data {
int relation, fa;
} p[maxn];
int find(int x) {
if (x == p[x].fa)return x;
int t = p[x].fa;
p[x].fa = find(t);
p[x].relation = (p[x].relation + p[t].relation) % 3;
return p[x].fa;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
p[i].fa = i;
p[i].relation = 0;
}
int tot = 0;
while (k--) {
scanf("%d%d%d", &d, &x, &y);
if (x > n || y > n) {
tot++;
continue;
}
if (d == 2 && x == y) {
tot++;
continue;
}
int u = find(x), v = find(y);
if (u == v) {
if (d - 1 != (3 + p[x].relation - p[y].relation) % 3)
tot++;
} else {
p[u].fa = v;
p[u].relation = (d - 1 + p[y].relation - p[x].relation + 3) % 3;
}
}
printf("%d\n", tot);
return 0;
}