hdu 1272 小希的迷宫

链接

#include<bits/stdc++.h>
using namespace std;
#define MXN 100010
int n,m,fa[MXN], flag;
int find(int r){
	if(r != fa[r]) fa[r] = find(fa[r]);
	return fa[r];
}
void merge(int x, int y){
	int t1 = find(x);
	int t2 = find(y);
	if(t1!=t2) fa[t1] = t2;
	else flag = 1;
}
int main(){
	int a, b;
	flag = 0;
	memset(fa, -1, sizeof fa);
	while(scanf("%d %d", &a, &b)){
		if(a == -1 && b == -1) break;
		if(a == 0 && b == 0){
			if(flag == 1) printf("No\n");//该集合不能出现回路 
			else{
				fa[0] = 0;
				for(int i = 1; i < MXN; i++) if(fa[i] == i) fa[0]++;//要保证只有一个集合 
				printf("%s\n", fa[0] > 1 ? "No" : "Yes");
			}
			flag = 0;
			memset(fa, -1, sizeof fa);
			continue;
		}
		if(flag == 1) continue;
		if(fa[a] == -1) fa[a] = a;
		if(fa[b] == -1) fa[b] = b;
		merge(a, b);
	}
	return 0;
}