POJ 1470 Closest Common Ancestors B 求最近公共祖先个数

点击打开链接

Closest Common Ancestors

Time Limit: 2000MS		Memory Limit: 10000K
Total Submissions: 13598		Accepted: 4407

Description

Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ancestor of u and v in the tree. The closest common ancestor of two nodes u and v is the node w that is an ancestor of both u and v and has the greatest depth in the tree. A node can be its own ancestor (for example in Figure 1 the ancestors of node 2 are 2 and 5)

Input

The data set, which is read from a the std input, starts with the tree description, in the form: 

nr_of_vertices 
vertex:(nr_of_successors) successor1 successor2 ... successorn 
...
where vertices are represented as integers from 1 to n ( n <= 900 ). The tree description is followed by a list of pairs of vertices, in the form: 
nr_of_pairs 
(u v) (x y) ... 

The input file contents several data sets (at least one). 
Note that white-spaces (tabs, spaces and line breaks) can be used freely in the input.

Output

For each common ancestor the program prints the ancestor and the number of pair for which it is an ancestor. The results are printed on the standard output on separate lines, in to the ascending order of the vertices, in the format: ancestor:times 
For example, for the following tree: 

Sample Input

5
5:(3) 1 4 2
1:(0)
4:(0)
2:(1) 3
3:(0)
6
(1 5) (1 4) (4 2)
      (2 3)
(1 3) (4 3)

Sample Output

2:1
5:5

Hint

Huge input, scanf is recommended.

Source

Southeastern Europe 2000

给你一棵树，然后几对点，让你求它们的最近公共祖先，输出所有的点是公共祖先的个数，如果是0，就不用输出。

离线算法求最近公共祖先。

//离线算法
#include<stdio.h>
#include<string.h>
#include<vector>
#define M 1007
using namespace std;
int g[M][M],in[M],pre[M],cnt[M];//in记录入度，pre记录它的父亲节点，cnt记录 祖先的个数
bool vis[M];
vector<int>v[M];
int n,m;

void init()
{
	memset(g,0,sizeof(g));
	memset(in,0,sizeof(in));
	memset(cnt,0,sizeof(cnt));
	memset(vis,false,sizeof(vis));
	for(int i=1;i<=n;i++)
		v[i].clear();
}

int find(int x)
{
	while(x!=pre[x])
		x=pre[x];
	return x;
}

void dfs(int x)
{
	pre[x]=x;
	for(int i=0;i<v[x].size();i++)
	{
		dfs(v[x][i]);
		pre[v[x][i]]=x;
	}
	vis[x]=true;
	for(int i=1;i<=n;i++)
	{
		if(vis[i]&&g[x][i])
		{
			cnt[find(i)]+=g[x][i];
		}

	}
}

int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		init();
		int a,b,c,root;
		for(int i=1;i<=n;i++)
		{
			scanf("%d:(%d)",&a,&b);
			while(b--)
			{
				scanf(" %d",&c);
				v[a].push_back(c);
				in[c]++;
			}
		}
		scanf(" %d",&m);
		while(m--)
		{
			scanf(" (%d %d)",&a,&b);
			g[a][b]++;
			g[b][a]++;
		}
		for(int i=1;i<=n;i++)
			if(!in[i])
			{
				root=i;
				break;
			}
		dfs(root);
		for(int i=1;i<=n;i++)
		{
			if(cnt[i])
				printf("%d:%d\n",i,cnt[i]);
		}
	}
	return 0;
}