ZOJ 1141 Closest Common Ancestors(LCA)

题目n的范围没说,格式坑人

再次膜拜tarjan 

#include <iostream>
#include <cstdio>
#include <memory.h>
#include <vector>
#include <map>
using namespace std;
const int maxn=900;
int res[maxn],id[maxn],size[maxn],anc[maxn],vis[maxn],ind[maxn],n,q;
vector<int>g[maxn];
vector<int>que[maxn];
int find(int p){
	return p==id[p]?p:id[p]=find(id[p]);
}
void uni(int p,int q){
	int pp=find(p),pq=find(q);
	if(pp==pq)return;
	if(size[pp]>size[pq]){
		id[pq]=pp;
		size[pp]+=size[pq];
	}else{
		id[pp]=pq;
		size[pq]+=size[pp];
	}
}

void tarjan_LCA(int u){
	anc[u]=u;
	for (int i=0;i<g[u].size();++i){
		tarjan_LCA(g[u][i]);
		uni(u,g[u][i]);
		anc[find(u)]=u;
	}
	vis[u]=1;
	for (int i=0;i<que[u].size();++i){
		if(vis[que[u][i]]){
			res[anc[find(que[u][i])]]++;
		}
	}
}
void init(){
	for (int i=1;i<=n;++i){
		id[i]=i;
		size[i]=1;
		g[i].clear();
		que[i].clear();
		res[i]=0;
		vis[i]=0;
		ind[i]=0;
	}
}
int main(){
	while (cin>>n){
		init();
		for (int i=0;i<n;++i){
			int u,m,v;
			char ch;
			scanf("%d:(%d)",&u,&m);
			while (m--){
				cin>>v;
				g[u].push_back(v);
				ind[v]=true;
			}
		}
		scanf("%d",&q);
		while (q--){
			int u,v;
			char ch;
			cin>>ch>>u>>ch>>v>>ch;
			que[u].push_back(v);
			que[v].push_back(u);
		}
		int root=0;
		for (int i=1;i<=n;++i){
			if(ind[i]==0){
				root=i;
				break;
			}
		}
		tarjan_LCA(root);
		for (int i=1;i<=n;++i){
			if(res[i])
				printf("%d:%d\n",i,res[i]);
		}
	}
	return 0;
}