POJ 1703 Find them ,Catch them
需要理清楚每个节点与父节点及根节点之间的关系,由于题目只涉及两种关系,对于点x,用r[x]=0代表与根节点关系相同,用
r[x]=1代表与根节点关系不同。
附上代码:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 100005;
int f[maxn],r[maxn];
void init(int n)
{
int i;
for(i = 1; i <= n; i++)
{
f[i] = i;
r[i] = 0;
}
}
int find(int x)
{
if(x == f[x])
return x;
int t = find(f[x]);
r[x] = (r[f[x]] + r[x])%2;
return f[x] = t;
}
void unite(int x,int y)
{
int fx = find(x);
int fy = find(y);
f[fx] = fy;
if(r[y] == 0)
r[fx] = 1-r[x];
else
r[fx]=r[x];
}
int main()
{
int n,m,t,fx,fy;
int x,y;
char ch;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++)
{
f[i] = i;
r[i] = 0;
}
while(m--)
{
getchar();
scanf("%c%d%d",&ch,&x,&y);
if(ch == 'A')
{
fx = find(x);
fy = find(y);
if(fx != fy)
printf("Not sure yet.\n");
else if(r[x] == r[y])
printf("In the same gang.\n");
else
printf("In different gangs.\n");
}
else
unite(x,y);
}
}
return 0;
}
POJ 1182 食物链
与上一题类似,但是关系有三种,对于点x,rel[x]=0代表与根节点同类,rel[x]=1代表x吃根节点,rel[x]=2代表x被根节点吃,其中利用向量知识课列出关系式
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=50005;
int rel[maxn],fa[maxn];
void init(int n)
{
for(int i=0;i<n;i++)
{
fa[i]=i;
rel[i]=0;
}
}
int find(int x)
{
if(fa[x]==x)return x;
int t=find(fa[x]);
rel[x]=(rel[fa[x]]+rel[x])%3; //更新每个节点与根节点之间的关系
return fa[x]=t;
}
void unite(int x,int y,int d)
{
int fx=find(x);
int fy=find(y);
fa[fx]=fy;
rel[fx]=(3-rel[x]+d+rel[y])%3; //3-rel[x]可代表fx与x之间的关系(即反转性),d代表x与y之间的关系,再加上rel[y],利用向量知识即可
}
int main()
{
int n,m,sum=0;
int x,y,fx,fy,d;
scanf("%d%d",&n,&m);
init(n);
for(int i=0;i<m;i++)
{
scanf("%d%d%d",&d,&x,&y);
if(x>n||y>n||(d==2&&x==y))
sum++;
else
{
fx=find(x);
fy=find(y);
if(fx==fy)
{
if((rel[x]-rel[y]+3)%3!=d-1) //x与y之间的关系
sum++;
}
else
unite(x,y,d-1);
}
}
printf("%d\n",sum);
}