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

Rank of Tetris

解题思路：因为题目中存在两个点分数相等的情况，所以可以使用并查集将它们合并起来。构图的时候使用每个点的祖先节点构图。对构造完成的图进行拓扑排序，使用队列每次只能让入度为0的点出队，判断是否有环。如果队列中存在两个及两个以上的点，这说明信心不完全，导致这些不可以比较，如果有环的话，则就说明有矛盾。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef pair<int,int>P;
const int inf = 0x7f7f7f7f;
const int N = 1e5+10;
const ll mod = 20000311;
const double PI = 3.14;

int read(){
    char ch=getchar();int x=0,f=1;
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int random(int n){return(ll)rand()*rand()%n;}


int fa[N],n,m,d[N],v[N];
vector<int>G[N];
map<P,int>vis;
int x[N],y[N],flag[N];


int Find(int x){
    if(fa[x] == x) return x;
    fa[x] = Find(fa[x]);
    return fa[x];
}
void Union(int x,int y){
    x = Find(x);y = Find(y);
    if(x != y){
        fa[x] = y;
    }
}


void solve(){
    queue<int>que;
    int sum = 0;
    memset(flag,0,sizeof flag);
    for(int i = 1;i <= n;i++){
        int u = Find(i);
        if(d[u] == 0 && flag[u] == 0){
            que.push(u);
            flag[u] = 1;
        }
        if(v[u] == 0){
            ++sum;
            v[u] = 1;
        }
    }
    int cnt = 0;
    memset(v,0,sizeof v);
    int pp = 0;
    while(que.size()){
        if(que.size() >= 2) pp = 1;
        int x = que.front();que.pop();
        if(v[x]) continue;
        v[x] = 1;
        ++cnt;
        for(int i = 0;i < G[x].size();i++){
            int y = G[x][i];
            if(d[y]){
                d[y]--;
                if(d[y] == 0) que.push(y);
            }
        }
    }
    if(sum != cnt){
        puts("CONFLICT");return;
    }
    if(pp){
        puts("UNCERTAIN");return;
    }
    puts("OK");
}
void init(){
    vis.clear();
    for(int i = 1;i <= n;i++){
        fa[i] = i;G[i].clear();
        flag[i] = 0;
        v[i] = 0;d[i] = 0;
    }
}
int main(){
    srand((unsigned)time(0));
    //freopen("out.txt","w",stdout);
    //freopen("in.txt","r",stdin);
    while(~scanf("%d%d",&n,&m)){
        init();
        for(int i = 1;i <= m;i++){
            char ch;
            cin >> x[i] >> ch >> y[i];
            x[i]++;y[i]++;
            if(ch == '<') swap(x[i],y[i]);
            if(ch == '=') {
                Union(x[i],y[i]);
                flag[i] = 1;
            }
        }
        for(int i = 1;i <= m;i++){
            int u = Find(x[i]),v = Find(y[i]);
            if(flag[i]||vis[P(u,v)]) continue;
            vis[P(u,v)] = 1;
            G[u].push_back(v);
            d[v]++;
        }
        solve();
    }
    return 0;
}