P1955 [NOI2015] 程序自动分析https://www.luogu.com.cn/problem/P1955这道题很容易想到并查集,但是一看数据范围非常大,不可能维护一个这么大的数组,所以我们就需要用到离散化了,很自然的要离线求结果,将数据离散化后进行并查集操作,这里有一个小细节,可以将所有等于号操作放在不等于号操作前面进行,因为当产生矛盾时,等于操作与不等于操作的顺序可以颠倒,算是一种小优化吧,要不然就要把数组开两倍,通过扩域实现等于和不等于2个种类。
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
struct node {
int x, y, c;
bool operator <(const node &b)const {
return c > b.c;
}
} a[MAXN];
int s[MAXN];
int pre[MAXN];
inline void init(int num) {
for (int i = 1; i <= num; i++) {
pre[i] = i;
}
}
int find(int x) {
if (pre[x] == x) {
return x;
}
return pre[x] = find(pre[x]);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
int cnt = 0;
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &a[i].x, &a[i].y, &a[i].c);
s[++cnt] = a[i].x;
s[++cnt] = a[i].y;
}
sort(s + 1, s + cnt + 1);
int tmp = unique(s + 1, s + cnt + 1) - s - 1;
init(tmp);
for (int i = 1; i <= n; i++) {
a[i].x = lower_bound(s + 1, s + tmp + 1, a[i].x) - s;
a[i].y = lower_bound(s + 1, s + tmp + 1, a[i].y) - s;
}
sort(a + 1, a + n + 1);
bool flag = true;
for (int i = 1; i <= n; i++) {
int x = find(a[i].x);
int y = find(a[i].y);
if (a[i].c) {
pre[x] = y;
} else if (x == y) {
printf("NO\n");
flag = false;
break;
}
}
if (flag) {
printf("YES\n");
}
}
return 0;
}