这道题纯属是当初想少了,今天报仇的时候是当成新题来做的,考虑到它给的点的编号不一定是哪儿的,所以我们需要遍历十万个点,同事还得记录下来他给你了几个点,非常狗血……不过用并查集还是比较好弄得。其实还有一种更加节省时间复杂度的写法,只不过实在是懒得改了,上别的地方报仇了该
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 100100;
struct edge{
int x, y;
};
int p[maxn], tag[maxn];
vector<edge> v;
int find(int x){
return p[x] != x ? p[x] = find(p[x]) : x;
}
int main(){
edge t;
while (~scanf("%d%d", &t.x, &t.y)){
if (t.x == -1 && t.y == -1) break;
if (!t.x && !t.y){
if (v.empty()){
printf("Yes\n"); continue;
}
else{
for (int i = 0; i < maxn; i++) p[i] = i;
int n = v.size(); bool f = 1;
for (int i = 0; i < n; i++){
int r1 = find(v[i].x), r2 = find(v[i].y);
if (r1 != r2) p[r2] = r1;
else{
f = 0; break;
}
}
int cnt = 0;
for (int i = 0; i < maxn; i++)
if (tag[i] && p[i] == i) cnt += 1;
if (cnt > 1) f = 0;
if (f) printf("Yes\n");
else printf("No\n");
v.clear();
memset(tag, 0, sizeof(tag));
}
}
else{
v.push_back(t);
tag[t.x] = tag[t.y] = 1;
}
}
return 0;
}