思路
并查集的模板+离散化处理
代码
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef pair<int, int> PII;
const int N =100010;
int fa[N << 1],da[N << 1];//存放 x y 两个数据 所以要两倍
int x[N], y[N], op[N];//x y e
PII un[N];//存放不相等的两个值
int sum, n ,num;//变量
int find(int x){//查找
if(x == fa[x]) return x;
return fa[x] = find(fa[x]);
}
void merge(int x, int y){//合并
x = find(x);
y = find(y);
if(x != y)
fa[x] = y;
}
void discrete(int sum){//离散化
sort(da + 1, da + sum + 1);
int m = unique(da + 1, da + sum + 1) - da - 1;
for(int i = 1; i <= n; i++){
x[i] = lower_bound(da + 1, da + m + 1, x[i]) - da;
y[i] = lower_bound(da + 1, da + m + 1, y[i]) - da;
}
}
int main(){
int t; cin >> t;
while(t--){
cin >> n;
sum = 0, num = 0;
for(int i = 1;i <= (n <<1); i++) fa[i] = i;
for(int i = 1;i <= n ;i++){
cin >> x[i] >> y[i] >> op[i];
da[++sum] =x[i], da[++sum] = y[i];//存储x y
}
discrete(sum);//离散化处理
for(int i =1; i <= n; i++){
if(op[i] == 1){
merge(x[i],y[i]);
}
else{
un[++num] = make_pair(x[i],y[i]);
}
}
for(int i = 1; i <= num; i++){
if(find(un[i].first) == find(un[i].second)){
puts("NO");
goto end;
}
}
puts("YES");
end:;
}
return 0;
}
附上离散化讲解视频:(来源B站)
数据离散化