hdoj 1811 拓扑排序+并查集

用并查集把有相等的合并为一个点，再用拓扑排序

#include<cstdio>
#include<iostream>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;
const int N = 10010;
vector<int>map[N];
int pre[N];
int indegree[N];
int find(int k)
{
    if(pre[k]==k)
        return k;
    return find(pre[k]);;
}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)==2)
    {
        int i,j,k;
        int a[2*N],b[2*N];
        char c[2*N];
        int sum=0;
        for(i=0;i<n;i++)
        {
            pre[i]=i;
            map[i].clear();
        }
        for(i=0;i<m;i++)
        {

            scanf("%d %c %d",&a[i],&c[i],&b[i]);
            if(c[i]=='=')
            {
                int x=find(a[i]);
                int y=find(b[i]);
                pre[y]=x;
            }
        }
        memset(indegree,0,sizeof(indegree));
        for(i=0;i<m;i++)
        {
            if(c[i]=='=') continue;
            int x=find(a[i]);
            int y=find(b[i]);
            if(c[i]=='>')
                {
                map[x].push_back(y);
                indegree[y]++;

            }
            else
                {
                map[y].push_back(x);
                indegree[x]++;
                }
        }
        queue<int>q;
        for(i=0,k=0;i<n;i++)
        {
            if(i==find(i))
                k++;
            if(!indegree[i]&&i==find(i))
                q.push(i);
        }
        int flag=0;
        while(!q.empty())
        {
            if(q.size()>1) flag=1;
            int u=q.front();
            q.pop();
            sum++;
            for(i=0;i<map[u].size();i++)
            {
                indegree[map[u][i]]--;
                if(indegree[map[u][i]]==0)
                    q.push(map[u][i]);
            }

        }
       if(sum<k)
            cout<<"CONFLICT"<<endl;
        else if(flag)
            cout<<"UNCERTAIN"<<endl;
        else
            cout<<"OK"<<endl;
    }
    return 0;
}