poj----(1470)Closest Common Ancestors(LCA)

Closest Common Ancestors

Time Limit: 2000MS

Memory Limit: 10000K

Total Submissions: 15446

Accepted: 4944

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

给你一棵树,要你找出一些节点的最近公共祖先

代码:

  1 /*poj 1470*/
  2 #include<iostream>
  3 #include<vector>
  4 #include<cstdio>
  5 #include<cstring>
  6 #include<cstdlib>
  7 using namespace std;
  8 const int maxn=902;
  9 vector<int> tree[maxn],qus[maxn];
 10 int rank[maxn],father[maxn];
 11 bool vis[maxn];
 12 int rudu[maxn];
 13 int lroot[maxn];
 14 int ans[maxn];
 15 
 16 void init(int n){
 17      memset(vis,0,sizeof(char)*(n+1));
 18      memset(rudu,0,sizeof(int)*(n+1));
 19      memset(lroot,0,sizeof(int)*(n+1));
 20      memset(ans,0,sizeof(int)*(n+1));
 21     for(int i=1;i<=n;i++){
 22         father[i]=i;
 23         rank[i]=1;
 24         tree[i].clear();
 25         qus[i].clear();
 26     }
 27 }
 28 
 29 int find(int a){
 30    while(a!=father[a])
 31          a=father[a];
 32     return a;
 33 }
 34 
 35 void Union(int a,int b)
 36 {
 37     int x=find(a);
 38     int y=find(b);
 39     if(x==y) return ;
 40     if(rank[x]<rank[y]){
 41       rank[y]+=rank[x];
 42       father[x]=y;
 43     }
 44     else {
 45      rank[x]+=rank[y];
 46      father[y]=x;
 47     }
 48 }
 49 
 50 void LCA(int u)
 51 {
 52   lroot[u]=u;
 53   //vis[u]=1; 不能放在这里
 54   int len=tree[u].size();
 55   for(int i=0;i<len;i++){
 56       LCA(tree[u][i]);
 57       Union(u,tree[u][i]);
 58       lroot[find(u)]=u;
 59   }
 60   vis[u]=1;
 61   int ss=qus[u].size();
 62   for(int i=0;i<ss;i++){
 63         if(vis[qus[u][i]]){
 64             ans[lroot[find(qus[u][i])]]++;
 65             //return ;
 66         }
 67   }
 68 }
 69 
 70 int main()
 71 {
 72     int n,m,t,u1,u2;
 73     freopen("test.in","r",stdin);
 74     while(scanf("%d",&n)!=EOF){
 75           init(n);
 76       for(int i=0;i<n;i++){
 77             getchar();
 78         scanf("%d:(%d))",&u1,&m);
 79          for(int j=0;j<m;j++){
 80              scanf("%d",&u2);
 81              tree[u1].push_back(u2);
 82              rudu[u2]++;
 83          }
 84         }
 85       scanf("%d",&t);
 86       for(int i=0;i<t;i++)
 87       {
 88           scanf("%*1s%d%d%*1s",&u1,&u2);
 89           qus[u1].push_back(u2);
 90           qus[u2].push_back(u1);
 91       }
 92       for(int i=1;i<=n;i++)
 93       {
 94           if(rudu[i]==0)
 95         {
 96             LCA(i);
 97             break;
 98         }
 99       }
100       for(int i=1;i<=n;i++){
101           if(0!=ans[i])
102             printf("%d:%d\n",i,ans[i]);
103       }
104     }
105 return 0;
106 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏杨熹的专栏

Kaggle winner 方案简介 | Understanding the Amazon from Space: 1st place

Below is a brief introduction of the 1st place winner solution to the competitio...

3878
来自专栏ml

poj-----Ultra-QuickSort(离散化+树状数组)

Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submission...

3496
来自专栏ml

HDUOJ----1301 Jungle Roads

Jungle Roads Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768...

3097
来自专栏ml

hdu---------(1026)Ignatius and the Princess I(bfs+dfs)

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Lim...

3018
来自专栏ml

hdu 1695 GCD(莫比乌斯反演)

GCD Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...

3676
来自专栏ml

HDUOJ----2487Ugly Windows

Ugly Windows Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768...

2949
来自专栏ml

HDUOJ ---1423 Greatest Common Increasing Subsequence(LCS)

Greatest Common Increasing Subsequence Time Limit: 2000/1000 MS (Java/Others)   ...

2845
来自专栏ml

hdu 2818 Building Block

Building Block Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/327...

3577
来自专栏ml

HDUOJ-----2175取(m堆)石子游戏

取(m堆)石子游戏 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

2769
来自专栏Aloys的开发之路

Peer Code Reviews Made Easy with Eclipse Plug-In

Origin Article: Peer Code Reviews Made Easy with Eclipse Plug-In Origin Author: ...

1746

扫码关注云+社区