程序自动分析 ——并查集，离散化

 

/*
特征：无向图
1.离散化
2.将所有相等条件合并：合并
3.依次判断每一个不等条件：询问是否在同一个集合之中；查询
4.
*/
// 离散化+并查集
#include <iostream>
#include <cstring>
#include <algorithm>
#include <unordered_map>
using namespace std;
constexpr int N = 1e6+10;
int n;
int m;
int p[N];
unordered_map<int, int> S;

struct node
{
    int x, y, e;
} node[N];

// 离散化，将大的小标，映射成小的下标;
int get(int x)
{
    if (S.count(x) == 0)
        S[x] = ++n;
    return S[x];
}

int find(int x)
{
    if (p[x] != x)
        p[x] = find(p[x]);
    return p[x];
}

int main()
{
    int T = 1;
    cin >> T;
    while (T--)
    {
        n = 0;
        S.clear();
        cin >> m;
        for (int i = 0; i < m; i++)
        {
            int a, b, e;
            cin >> a >> b >> e;
            node[i] = {get(a), get(b), e};
        }
        // 初始化
        for (int i = 1; i <= 1e6; i++)
        {
            p[i] = i;
        }
        // 合并相等约束条件
        for (int i = 0; i < m; i++)
        {
            if (node[i].e == 1)
            {
                int pa = find(node[i].x), pb = find(node[i].y);
                p[pa] = pb;
            }
        }
        // 检查不等条件
        bool has_confict = false;
        for (int i = 0; i < m; i++)
        {
            if (node[i].e == 0)
            {
                int pa = find(node[i].x), pb = find(node[i].y);
                if (pa == pb)
                {
                    has_confict = true;
                    break;
                }
            }
        }
        if (has_confict == true)
        {
            cout << "NO" << endl;
        }
        else
        {
            cout << "YES" << endl;
        }
    }

    return 0;
}