0x41 [NOI2010] 程序自动分析 （并查集）

NOI大水题， 直接并查集维护是否相等就行了

注意要先处理等于再处理不等

数组稍微开大一些

哦对还有离散化

#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 200010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }

int fa[N], rk[N], b[N << 3] ;
int n, tot ;

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

bool cmp(node a, node b) {
	return a.w > b.w ;
}

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

void merge(int x, int y) {
	if (rk[x] > rk[y]) swap(x, y) ;
	fa[x] = y ;
	if (rk[x] == rk[y]) rk[y]++ ;
}

void work() {
	tot = 0 ;
    scanf("%d", &n) ;
    rep(i, 1, n) {
    	scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].w) ;
    	b[tot++] = a[i].x ; b[tot++] = a[i].y ;
	}
	sort(b, b + tot) ;
	int t = unique(b, b + tot) - b ;
	rep(i, 1, n) {
		a[i].x = lower_bound(b, b + t, a[i].x) - b ;
		a[i].y = lower_bound(b, b + t, a[i].y) - b ;
	}
	rep(i, 0, t) rk[i] = 0, fa[i] = i ;
	sort(a + 1, a + n + 1, cmp) ;
	rep(i, 1, n) {
		int X = find(a[i].x), Y = find(a[i].y) ;
		if (a[i].w == 1) merge(X, Y) ;
		else if (X == Y) {
			puts("NO") ;
			return ;
		}
	}
	puts("YES") ;
}

signed main() {
	int T ;
	scanf("%d", &T) ;
	while (T--) work() ;
}

/*
写代码时请注意：
	1.ll？数组大小，边界？数据范围？
	2.精度？
	3.特判？
	4.至少做一些
思考提醒：
	1.最大值最小->二分？
	2.可以贪心么？不行dp可以么
	3.可以优化么
	4.维护区间用什么数据结构？
	5.统计方案是用dp？模了么？
	6.逆向思维？
*/