4195: [Noi2015]程序自动分析

一道大水题

看到题目一开始的描述容易想到查分约束...

但是再看两眼发现并没有必要。。。

显然并查集就可以维护。

对于相同的点合并成一个点即可，

把不同的点并在一个集合，每次判断就好了...

另外，考虑数据范围过大，必须使用离散化...

c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y;++ i)
#define repd(i,x,y) for(register int i = x; i >= y;-- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    x = 0;char c;int sign = 1;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}
 
const int N = 1e6 + 500;
int n,t,a[N],b[N],c[N],e[N],f[N],p[N],cnt;
 
int get_fa(int x) { return f[x] == x ? x : f[x] = get_fa(f[x]); }
int get_p(int x) { return p[x] == x ? x : p[x] = get_p(p[x]); }
 
inline void solve()
{
    cnt = 0;
    read(n);
    rep(i,1,n)
    {
        read(a[i]); read(b[i]); read(e[i]);
        c[++cnt] = a[i]; c[++cnt] = b[i];
    }
    sort(c + 1,c + 1 + cnt);
    rep(i,1,n)
        a[i] = lower_bound(c+1,c+1+cnt,a[i]) - c,
        b[i] = lower_bound(c+1,c+1+cnt,b[i]) - c;
    rep(i,1,cnt) f[i] = i,p[i] = i;
     
    bool k = 1;
    rep(i,1,n)
    {
        if(e[i])
        {
            int x = get_fa(a[i]),y = get_fa(b[i]);
            if(x == y) continue;
            x = get_p(x); y = get_p(y);
            if(x == y)
            {
                k = 0;
                break;
            }
            x = get_fa(a[i]); y = get_fa(b[i]);
            if(x != y) f[x] = y;
            x = get_p(x); y = get_p(y);
            p[x] = y;
        }else
        {
            if(a[i] == b[i]) { k = 0;break; }
            int x = get_fa(a[i]),y = get_fa(b[i]);
            if(x == y)
            {
                k = 0;
                break;
            }
            x = get_p(x); y = get_p(y);
            if(x != y) p[x] = y;
        }
    }
     
    puts(k?"YES":"NO");
}
 
int main()
{
    read(t);
    while(t--)
        solve();
    return 0;
}