小希的迷宮
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 56504 Accepted Submission(s): 17735
整個文件以兩個-1結尾。
#include <iostream>
#include <set>
#include <cstring>
#include <cstdio>
using namespace std;
const int MAXN = 100000 + 5;
int parent[MAXN];
int tables[MAXN];
bool ok = true;
bool first = true;
int maxnum = 0;
int minnum = 100000 + 5;
set<int> nodes;
void initSet(){
nodes.clear();
ok = true;
first = true;
maxnum = 0;
minnum = 100000 + 5;
memset(tables,0,sizeof(tables));
for(int i = 0; i < MAXN; i ++){
parent[i] = i;
}
}
int find(int x){
if(x != parent[x]){
int t = find(parent[x]);
parent[x] = t;
return t;
}else
return x;
}
bool unionSet(int a,int b){
if(a == b) return true;
int x = find(a);
int y = find(b);
if(x == y) return false;
parent[x] = y;
return true;
}
int main(){
int u,v;
initSet();
while(scanf("%d %d",&u,&v) && u != -1){
if(u == 0){
if(first){
cout << "Yes" <<endl;
}else{
int ans = 0;
for(int i = minnum; i <= maxnum; i ++)
tables[find(i)] = 1;
for(int i = minnum; i <= maxnum; i ++)
if(tables[i] && nodes.count(i)){
ans ++;
//cout << "root :"<<i<<endl;
}
if(ok && ans == 1)
cout <<"Yes"<<endl;
else
cout << "No"<<endl;
}
initSet();
}else{
maxnum = max(maxnum,u);
maxnum = max(maxnum,v);
minnum = min(minnum,u);
minnum = min(minnum,v);
nodes.insert(u);
nodes.insert(v);
if(first)
first = false;
if(ok)
ok = unionSet(u,v);
}
}
return 0;
}