POJ 1308 Is It A Tree?

#include<cstdio>
#include<map>
#include<vector>
#include<cstring>
#include<cstdlib>
using namespace std;
const int M=110;
map<int,int>mp;
vector<int>a[M];
bool s[M];
int vis[M];
bool dfs(int x,int pre){
	vis[x]=1;
	int i,len=a[x].size();
	for(i=0;i<len;i++)
		if(vis[a[x][i]]==0){
			if(dfs(a[x][i],x)==0)
				return 0;
		}
		else if(a[x][i]!=pre)return 0;
	return 1;
}
void solve(int kase){
	int i,q,p,x,y,l=0;
	bool bl=0,ok=1;
	mp.clear();
	memset(s,0,sizeof(s));
	memset(vis,0,sizeof(vis));
	while(1){
		scanf("%d%d",&x,&y);
		if(x==0&&y==0)break;
		if(x==-1&&y==-1)exit(0);
		if(mp[x]==0)
			mp[x]=++l;
		if(mp[y]==0)
			mp[y]=++l;
		q=mp[x];
		p=mp[y];
		a[q].push_back(p);
		a[p].push_back(q);
		if(s[p]==0)s[p]=1;
		else ok=0;
	}
	for(i=1;i<=l;i++)
		if(s[i]==0){
			if(bl==1){
				ok=0;
				break;
			}
			if(bl==0)bl=1;
		}
	if(ok)ok=dfs(1,-1);
	if(ok)printf("Case %d is a tree.\n",kase);
	else printf("Case %d is not a tree.\n",kase);
	for(i=1;i<=l;i++)
		a[i].clear();
}
int main(){
	int kase=0;
	while(1)solve(++kase);
	return 0;
}