HDU 1811 Rank of Tetris(并查集+拓扑排序)

题目链接；
HDU 1811 Rank of Tetris
题意：
$n$个人，编号$0-n-1$。$m$组关系可以是:$A>B,A=B,A<B$。
问最终的关系是否确定或者出现冲突？
数据范围：$0\leq N\leq 10000,0\leq M\leq 20000$
分析：
能想到并查集把$A=B$的情况合并就好做了。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#include <queue>
#include <vector>
#include <set>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
const int MAX_N = 10010;
const int MAX_M = 20010;

int degree[MAX_N], father[MAX_N];
vector<int> vec[MAX_N];
queue<int> que;
set<int> sss;
pair<int, int> data[MAX_M];

void init(int n)
{
    for(int i = 0; i <= n; ++i) {
        vec[i].clear();
        father[i] = i;
        degree[i] = 0;
    }
    while(!que.empty()) que.pop();
    sss.clear();
}

inline int find(int x)
{
    return father[x] == x ? x : father[x] = find(father[x]);
}

int TopoSort(int n)
{
    int flag = 1;  // assume ok
    for(int i = 0; i < n; ++i) {
        //printf("find(%d) = %d\n", i, find(i));
        int fi = find(i);
        if(degree[fi] == 0) sss.insert(fi);
    }
    for(set<int>:: iterator it = sss.begin(); it != sss.end(); ++it) {
        que.push(*it);
    }
    while(!que.empty()) {
        if(flag && que.size() > 1) flag = 0; //maybe uncertain
        int cur = que.front();
        que.pop();
        for(int i = 0; i < vec[cur].size(); ++i) {
            int to = vec[cur][i];
            degree[to]--;
            if(degree[to] == 0) {
                que.push(to);
            }
        }
    }
    for(int i = 0; i < n; ++i) {
        if(degree[find(i)] > 0) {  //conflict
            flag = -1;
            break;
        }
    }
    return flag;
}

int main()
{
    int n, m;
    while(~scanf("%d%d", &n, &m)) {
        init(n);
        int total = 0;
        for(int i = 0; i < m; ++i) {
            int a, b;
            char s[20];
            scanf("%d%s%d", &a, s, &b);
            if(s[0] == '=') {
                if(a > b) swap(a, b);
                int fa = find(a), fb = find(b);
                father[fb] = fa;
            } else {
                if(s[0] == '<') swap(a, b);
                data[total].first = a, data[total].second = b;
                total++;
            }
        }
        //printf("total = %d\n", total);
        m = total;
        for(int i = 0; i < m; ++i) {
            int u = data[i].first, v = data[i].second;
            int fu = find(u), fv = find(v);
            vec[fu].push_back(fv);
            degree[fv]++;
        }
        int ans = TopoSort(n);
        if(ans == 1) printf("OK\n");
        else if(ans == -1) printf("CONFLICT\n");
        else if(ans == 0) printf("UNCERTAIN\n");
    }
    return 0;
}