题目:http://poj.org/problem?id=1470
题意:输入一个n,代表树有n个点,从1到n。接下来n行,每行第一个数为树上的点,然后一个数,假设是m吧,其后跟m个数,代表之前的点指向这m个点。然后有大于等于1组的查询,查询它们的LCA,最后输出每个点作为LCA的次数,为0的不输出。
思路:LCA模板题啦,求LCA时直接统计一下就好了,输入有点小恶心
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1010;
struct edge
{
int to, next;
} G1[N*1000], G2[N*1000]; /*刚开始开1010 * 100居然RE了,题目也没说数据范围,郁闷*/
int head1[N], head2[N], par[N], rnk[N], anc[N], res[N];
int cnt1, cnt2;
bool vis[N], deg[N];
int n;
void init()
{
for(int i = 1; i <= n; i++)
par[i] = i, rnk[i] = 0;
memset(head1, -1, sizeof head1);
memset(head2, -1, sizeof head2);
memset(res, 0, sizeof res);
memset(vis, 0, sizeof vis);
memset(deg, 0, sizeof deg);
cnt1 = cnt2 = 0;
}
void add_edge1(int v, int u)
{
G1[cnt1].to = u;
G1[cnt1].next = head1[v];
head1[v] = cnt1++;
}
void add_edge2(int v, int u)
{
G2[cnt2].to = u;
G2[cnt2].next = head2[v];
head2[v] = cnt2++;
}
int ser(int x)
{
int r = x, i = x, j;
while(r != par[r]) r = par[r];
while(i != r) j = par[i], par[i] = r, i = j;
return r;
}
void tarjan_lca(int v)
{
int u;
for(int i = head1[v]; i != -1; i = G1[i].next)
{
u = G1[i].to;
tarjan_lca(u);
par[u] = v;
}
vis[v] = true;
for(int i = head2[v]; i != -1; i = G2[i].next)
if(vis[u= G2[i].to])
res[ser(u)]++; /*统计某点作为LCA的次数*/
}
int main()
{
int m, a, b, c;
while(~ scanf("%d", &n))
{
init();
for(int i = 0; i < n; i++)
{
scanf("%d:(%d)", &a, &b);
for(int j = 0; j < b; j++)
{
scanf("%d", &c);
add_edge1(a, c);
deg[c] = true;
}
}
scanf("%d", &m);
for(int i = 0; i < m; i++)
{
scanf(" (%d %d)", &a, &b);
add_edge2(a, b);
add_edge2(b, a);
}
for(int i = 1; i <= n; i++)
if(! deg[i])
{
tarjan_lca(i);
break;
}
for(int i = 1; i <= n; i++)
if(res[i])
printf("%d:%d\n", i, res[i]);
}
return 0;
}