题面:
思路:并查集,我最初想法是种类并查集的,我想的是两个种类判断,但是这样子显然不可以
2 != 3
1 != 3
1 != 3
好像用我最初的写法是NO,但是正确答案是YES
后来才发现是我想多了,这就是一个普通的并查集,我们只需要先把相等的合并掉,然后后头找下来看看有没有不满足的即可
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
vector<int> ve;
int s[200005];
int a[100005], b[100005], c[100005];
int find(int x){
return lower_bound(ve.begin(), ve.end(), x) - ve.begin();
}
int findx(int x){
if(s[x] == x){
return x;
}
return s[x] = findx(s[x]);
}
void merge(int x, int y){
int fx = findx(x);
int fy = findx(y);
if(fx != fy){
s[fy] = fx;
}
}
int main(){
ios::sync_with_stdio(false);
int t;
cin >> t;
while(t--){
ve.clear();
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i] >> c[i];
ve.push_back(a[i]);
ve.push_back(b[i]);
}
sort(ve.begin(), ve.end());
ve.erase(unique(ve.begin(), ve.end()), ve.end());
for(int i = 0; i < ve.size(); i++){
s[i] = i;
}
bool f = 0;
for(int i = 0; i < n; i++){
if(c[i]){
merge(find(a[i]), find(b[i]));
}
}
for(int i = 0; i < n; i++){
if(!c[i]){
if(findx(find(a[i])) == findx(find(b[i]))){
f = 1;
break;
}
}
}
if(f){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
}
return 0;
}