POJ 题目1470 Closest Common Ancestors(LCA)
来源:互联网 发布:阿里云子账号登录 编辑:程序博客网 时间:2024/06/11 15:08
Closest Common Ancestors
Time Limit: 2000MS Memory Limit: 10000KTotal Submissions: 16671 Accepted: 5319
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.
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:
For example, for the following tree:
Sample Input
55:(3) 1 4 21:(0)4:(0)2:(1) 33:(0)6(1 5) (1 4) (4 2) (2 3)(1 3) (4 3)
Sample Output
2:15:5
Hint
Huge input, scanf is recommended.
Source
Southeastern Europe 2000
ac代码
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<vector>#include<iostream>using namespace std;int n,m;int head[1010],vis[1010],pre[1010],dig[1010],cnt,flag,a,b,cot[1010],ans[1010];vector<int>vt[1010];struct s{int u,v,next;}edge[1010];int cmp(const void *a,const void *b){return *(int *)a-*(int *)b;}void init(){memset(vis,0,sizeof(vis));memset(head,-1,sizeof(head));memset(dig,0,sizeof(dig));cnt=0;memset(cot,0,sizeof(cot));for(int i=0;i<=n;i++)vt[i].clear();}void add(int u,int v){edge[cnt].u=u;edge[cnt].v=v;edge[cnt].next=head[u];head[u]=cnt++;}int find(int x){if(x==pre[x])return x;return find(pre[x]);}void tarjan(int u){pre[u]=u;vis[u]=1;int i;for(i=0;i<vt[u].size();i++){int v=vt[u][i];if(vis[v])cot[find(v)]++;}for(i=head[u];i!=-1;i=edge[i].next){int v=edge[i].v;if(!vis[v]){tarjan(v);pre[v]=u;}}}int main(){while(scanf("%d",&n)!=EOF){int i,j;init();for(i=0;i<n;i++){int u,num;scanf("%d:",&u);scanf("(%d)",&num);while(num--){int v;scanf("%d",&v);add(u,v);dig[v]++;}}int root;scanf("%d",&m);while(m--){while(getchar()!='(');scanf("%d %d",&a,&b);while(getchar()!=')');vt[a].push_back(b);vt[b].push_back(a);}for(i=1;i<=n;i++){if(dig[i]==0){tarjan(i);break;}}for(i=1;i<=n;i++){if(cot[i]){printf("%d:%d\n",i,cot[i]);}}}}
0 0
- POJ 题目1470 Closest Common Ancestors(LCA)
- POJ 1470Closest Common Ancestors(LCA)
- POJ-1470 Closest Common Ancestors【LCA】
- POJ-1470 Closest Common Ancestors【LCA】
- POJ 1470 Closest Common Ancestors [LCA+RMQ]
- poj 1470 Closest Common Ancestors(LCA)
- poj--1470--Closest Common Ancestors--LCA
- POJ 1470 Closest Common Ancestors LCA题解
- Closest Common Ancestors - POJ 1470 LCA
- poj 1470 Closest Common Ancestors(LCA)
- 【LCA】 POJ 1470 Closest Common Ancestors
- poj 1470 Closest Common Ancestors(LCA)
- POJ - 1470 Closest Common Ancestors(LCA离线)
- POJ 1470 Closest Common Ancestors【LCA Tarjan】
- [POJ 1470]Closest Common Ancestors[离线LCA]
- poj 1470 Closest Common Ancestors LCA离线
- POJ 1470 Closest Common Ancestors (LCA)
- 【LCA基础】poj 1470 Closest Common Ancestors
- linux进程控制-wait()
- POJ1129 Channel Allocation DFS
- 基于C++ STL图的邻接表表示及深度、广度搜索实现
- Mac上启动server报Caused by: java.net.UnknownHostException:*.local:*.local解决办法
- Berkeley DB 的内容
- POJ 题目1470 Closest Common Ancestors(LCA)
- 内部类
- Two Sum
- 国企如何发展自己的信息化队伍
- SD-如何在SAP标准IDOC中增加自定义字段传输
- Android应用在不同版本间兼容性处理
- 关于自定义View思考与实践1
- JavaWeb文件上传图片到非工程目录,然后前端访问
- 判断鼠标从什么方向进入元素