Is It A Tree?【北京大学】

题目链接

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5;
int hsh[maxn]; 
int in[maxn];
vector<int> G[maxn];
void dfs(int i){
	hsh[i]=0;
	for(int j=0;j<G[i].size();j++){
		int v = G[i][j];
		if(hsh[v]==0) continue;
		dfs(v);
	}
}
int main(){
	int u,v,flag=0; 
	for(int k=1;;k++){
		memset(in,0,sizeof(in));
		memset(hsh,0,sizeof(hsh));
		int label=0,t=0;
		while(cin>>u>>v){
			if(u==0&&v==0) break;
			if(u==-1&&v==-1) {
				flag=1;
				break;
			}
			in[v]++;
			t++;
			hsh[u]=1;
			hsh[v]=1;
			if(u==v) label=1;
			G[u].push_back(v);	
		}
		if(flag) break;
		int cnt=0;
		int tag=0;
		for(int i=1;i<maxn;i++){
			if(hsh[i]&&in[i]==0){
				cnt++;
				dfs(i);
			}
			if(in[i]>1) tag++;
		}
		if(cnt==1&&tag==0&&label==0||t==0){
			printf("Case %d is a tree.\n",k);
		}else{
			printf("Case %d is not a tree.\n",k);
		}
		
	}
	
	
	return 0;
}