POJ 1703 种类并查集

题意：一个城市里面有两个黑帮 有两种操作 A(ask) 询问 x,y的关系 D x,y是一伙的

很明显是种类并查集 于是就YY一下 relationsi 表示与父节点的关系 fatheri 记录父节点 在合并和查询root的时候 relations 更新注意一下就可以了

#include <iostream>
#include <cstdio>

using namespace std;
const int maxn = 100010;
int father[maxn];
int relations[maxn];
int t,n,k;
void Init()
{
    for(int i = 1;i <= n;i ++)
    {
        father[i] = i;
        relations[i] = 0;
    }
}
int FindSet(int x)
{
    int tmp = father[x];
    if(tmp!=x)
    {
        father[x] = FindSet(tmp);
        relations[x] = (relations[x]+relations[tmp])%2;
    }
    return father[x];
}
void UnionSet(int x,int y)
{
    int rootx = FindSet(x);
    int rooty = FindSet(y);
    if(rootx==rooty)
        return ;
    father[rootx] = rooty;
    relations[rootx] = (relations[x]-relations[y]+1)%2;
}
int main()
{
    int x,y;
    char str[2];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k);
        Init();
        while(k--)
        {
            scanf("%s%d%d",str,&x,&y);
            if(str[0] == 'D')
               UnionSet(x,y);
            if(str[0] == 'A')
            {
                if(n==2)
                {
                    cout<<"In different gangs."<<endl;
                    continue ;
                }
                else
                {
                    if(FindSet(x)==FindSet(y)&&relations[x]==relations[y])
                        cout<<"In the same gang."<<endl;
                    else if(FindSet(x)==FindSet(y)&&relations[x]==(relations[y]+1)%2)
                        cout<<"In different gangs."<<endl;
                    else if(FindSet(x)!=FindSet(y))
                        cout<<"Not sure yet."<<endl;
                }
            }
        }
    }
    return 0;
}

相同类型的题目

POJ 1182 食物链 分三种类

#include <cstdio>
#include <iostream>
using namespace std;
const int N = 50005;
int n, m, f[N], rank[N];
void init()
{
    for(int i=0; i<=n; ++i)
        f[i]=i,rank[i]=0;
}
int find(int x)
{
    if(x==f[x])return x;
    int fa=f[x];
    f[x]=find(f[x]);
    rank[x] = (rank[x]+rank[fa])%3;
    return f[x];
}
bool Union(int x,int y,int D)
{
    int a=find(x), b=find(y);
    if(a==b)
    {
        if(D==1&&rank[x]!=rank[y]) return false;
        if(D==2)
        {
            if(rank[x]==2&&rank[y]!=1)return false;
            if(rank[x]==1&&rank[y]!=0)return false;
            if(rank[x]==0&&rank[y]!=2)return false;
        }
        return true;
    }
    f[a] = b;
    if(D==2)
    {
        rank[a] = (rank[y]-rank[x]+3+1)%3;
    }
    else
    {
        rank[a] = (rank[y]-rank[x]+3)%3;
    }
    return true;
}
int main()
{
    int x,y,d;
    scanf("%d%d",&n,&m);
    init();
    int cnt=0;
    for(int i=0; i<m; ++i)
    {
        scanf("%d%d%d",&d,&x,&y);
        if(x>n || y>n || d==2&&x==y)
        {
            ++cnt;
            continue;
        }
        if(!Union(x,y,d))
        {
            ++cnt;
        }
    }
    printf("%d\n", cnt);
    return 0;
}

POJ 2492 两种类

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2005;
int father[maxn];
int relation[maxn];
int t,n,k;
void Init()
{
    memset(relation,0,sizeof(relation));
    for(int i = 1; i <= n; i ++)
        father[i] = i;
}
int find_set(int x)
{
    int tmp = father[x];
    if(x!=father[x])
    {
         father[x] = find_set(tmp);
         relation[x] = (relation[x]+relation[tmp])%2;
    }
    return father[x];
}
void union_set(int x,int y)
{
    int rootx = find_set(x);
    int rooty = find_set(y);
    if(rootx == rooty)
        return ;
    father[rootx] = rooty;
    relation[rootx] = (relation[x]-relation[y]+1)%2;
    return ;
}
int main()
{
    int a,b,flag,cas = 1;
    scanf("%d",&t);
    while(t--)
    {
        flag = 1;
        scanf("%d%d",&n,&k);
        Init();
        while(k--)
        {
            scanf("%d%d",&a,&b);
            if(find_set(a)==find_set(b))
            {
                if(relation[a]!=(relation[b]+1)%2)
                {
                    flag = 0;
                }
            }
            else
                union_set(a,b);
        }
        if(flag)
            printf("Scenario #%d:\nNo suspicious bugs found!\n\n",cas ++);
        else
            printf("Scenario #%d:\nSuspicious bugs found!\n\n",cas ++);
    }

    return 0;
}

做完上述的种类UFS的题目 不难发现规律 这类的题目以后应该能轻松AC了吧 - -||