POJ 1470 Closest Common Ancestors LCA Tarjan算法

这道题最终的计算结果和询问次序无关，绝对是练习lca的tarjan算法的不二之选~

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define N 1010
#define M 2010
using namespace std;

int n,m;
int u[M],v[M],fst[N],nxt[M],tot;
vector <int> que[N];
int cnt[N]; bool vis[N],book[N];
int f[N],root;

void init()
{
	memset(u,0,sizeof(u));
	memset(v,0,sizeof(v));
	memset(fst,0,sizeof(fst));
	memset(nxt,0,sizeof(nxt));
	tot=0;
	for (int i=1;i<=n;i++)
	{
		que[i].clear();
	}
	memset(cnt,0,sizeof(cnt));
	memset(vis,0,sizeof(vis));
	memset(book,0,sizeof(book));
	for (int i=1;i<=n;i++)
	{
		f[i]=i;
	}
}

void add_edge(int a,int b)
{
	tot++;
	u[tot]=a; v[tot]=b;
	nxt[tot]=fst[a]; fst[a]=tot;
	tot++;
	u[tot]=b; v[tot]=a;
	nxt[tot]=fst[b]; fst[b]=tot;
}

int find(int x)
{
	if (f[x]==x) return x;
	else return f[x]=find(f[x]);
}

void tarjan(int p,int fa)
{
	//printf("%d\n",p);
	for (int i=fst[p];i!=0;i=nxt[i])
	{
		if (v[i]!=fa) tarjan(v[i],p);
	}
	vis[p]=true;
	for (int i=0;i<que[p].size();i++)
	{
		//printf("  %d ",que[p][i]);
		if (vis[que[p][i]])
		{
			//printf("%d",find(que[p][i]));
			cnt[find(que[p][i])]++;
		}
		//printf("\n");
	}
	f[p]=fa;
}

int main()
{
	while (scanf("%d",&n)!=-1)
	{
		init();
		int k,x,y;
		for (int i=1;i<=n;i++)
		{
			scanf("%d:(%d)",&x,&k);
			//printf("%d %d\n",x,k);
			for (int j=1;j<=k;j++)
			{
				scanf("%d",&y);
				//printf("%d\n",y);
				add_edge(x,y);
				book[y]=true;
			}
		}
		for (int i=1;i<=n;i++)
		{
			if (!book[i])
			{
				root=i;
				break;
			}
		}
		scanf("%d",&m);
		for (int i=1;i<=m;i++)
		{
			char c=0;
			while (c!='(') c=getchar();
			scanf("%d%d",&x,&y);
			getchar();
			que[x].push_back(y);
			que[y].push_back(x);
		}
		tarjan(root,-1);
		for (int i=1;i<=n;i++)
		{
			if (cnt[i])
			{
				printf("%d:%d\n",i,cnt[i]);
			}
		}
	}
	return 0;
}