题目地址:http://121.249.217.157:8080/contest/view.action?cid=54#problem/B
源代码:
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int flag[100005];
int f[100005];
int find(int x)
{
if(f[x]!=x) f[x]=find(f[x]);
return f[x];
}
int make(int x,int y)
{
int a=find(x);
int b=find(y);
if(b!=y) return 1;
if(a==b) return 1;
else f[b]=a;
return 0;
}
int main()
{
int m,n;
int k=0;
int i,j;
memset(flag,0,sizeof(flag));
int t=0;
int mid=-2;
for(i=1;i<=100005;i++)
f[i]=i;
int case1=0;
while(cin>>m>>n&&(m>-1&&n>-1))
{
mid=max(m,mid);
mid=max(n,mid);
if(m==0&&n==0)
{
case1++;
for(i=1;i<=mid;i++)
{
if(flag[i]==1&&f[i]==i)
t++;
//if(flag[i]==1) cout<<f[i]<<" f[i] "<<i<<endl;
if(t>1) break;
}
if(k>0||t>1)
{
cout<<"Case "<<case1;
cout<<" is not a tree."<<endl;
}
else
{
cout<<"Case "<<case1;
cout<<" is a tree."<<endl;
}
for(i=1;i<=100005;i++)
flag[i]=0;
for(i=1;i<=100005;i++)
f[i]=i;
t=0;
k=0;
mid=-2;
continue;
}
flag[m]=1;
flag[n]=1;
k+=make(m,n);
//f[n]=m;
}
}