https://www.luogu.org/problem/show?pid=2024
方法一:拆点
一个点拆成3个分身
一个是原体,一个表示x吃y,一个表示x被y吃
然后模拟即可
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define ms(i,j) memset(i,j, sizeof i);
using namespace std;
int n,k;
int father[150005];
int find(int x)
{
if (father[x]==x) return x;
return father[x] = find(father[x]);
}
int merge(int x, int y)
{
int x1 = find(x);
int y1 = find(y);
if (x1!=y1) father[y1] = x1;
}
int ans = 0;
int main()
{
scanf("%d%d", &n, &k);
for (int i=1;i<=3*n;i++) father[i] = i;
for (int i=1;i<=k;i++)
{
int ty,x,y;
scanf("%d%d%d", &ty, &x, &y);
if (x<=0||x>n||y<=0||y>n) {ans++; continue;}
if (ty==1)
{
if (find(x)==find(y+n)||find(x)==find(y+2*n)) {ans++; continue;}
merge(x,y);
merge(x+n,y+n);
merge(x+2*n, y+2*n);
} else
{
if (find(x)==find(y)||find(x)==find(y+2*n)) {ans++; continue;}
merge(x,y+n);
merge(x+n,y+2*n);
merge(x+2*n,y);
}
}
printf("%d\n", ans);
return 0;
}
方法二:带权并查集
权值为0,表示x,y同类
1,表示x吃y
2,表示x被y吃
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define ms(i,j) memset(i,j, sizeof i);
using namespace std;
int n,k;
int father[150005];
int r[150005];//每个点指出的权值
int ans = 0;
int find(int x)
{
if (father[x]==x) return x;
int tmp = father[x];
father[x] = find(father[x]);//递归并且路径压缩
r[x] = (r[tmp]+r[x])%3;//用公式算出x指出的权值
return father[x];
}
int main()
{
scanf("%d%d", &n ,&k);
for (int i=1;i<=n;i++) father[i] = i;
for (int i=1;i<=k;i++)
{
int ty;
int a,b;
scanf("%d%d%d", &ty, &a, &b);
if (a<=0||b<=0||a>n||b>n)//不符合范围
{
ans++;
continue;
}
int x = find(a), y = find(b);//找根
if (x!=y)//不在一个并查集里
{
father[x] = y;//合并
r[x] = (r[b]-r[a]+ty-1+66666)%3; //用公式算出权值
}else
{
if ((r[b]-r[a]+ty-1)%3) ans++;//用公式验证是否关系正确
}
}
printf("%d\n", ans);
return 0;
}