zoukankan      html  css  js  c++  java
  • POJ 1470 Closest Common Ancestors

    传送门

    Closest Common Ancestors
    Time Limit: 2000MS   Memory Limit: 10000K
    Total Submissions: 17306   Accepted: 5549

    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

    -----------------------------------------------------------------------

    LCA

    采用 Tarjan 离线 LCA 算法比较方便

    注意读入细节

    -------------------------------------------------------------------------

    #include <cstdio>
    #include <vector>
    #include <cstring>
    #define pb push_back
    
    using namespace std;
    const int N(905);
    vector<int> q[N], g[N];
    int par[N], ans[N], col[N];
    int find(int u){return par[u]==u?u:find(par[u]);}
    void dfs(int u, int f){
    	col[u]=-1;
    	for(int i=0; i<q[u].size(); i++){
    		int &v=q[u][i];
    		if(col[v]==-1) ans[v]++;
    		else if(col[v]==1) ans[find(v)]++;
    		else q[v].pb(u);
    	}
    	for(int i=0; i<g[u].size(); i++){
    		int &v=g[u][i];
    		dfs(v, u);
    	}
    	col[u]=1;
    	par[u]=f;
    }
    int main(){
    	//freopen("in", "r", stdin);
    	int n, m, u, v;
    	for(;~scanf("%d", &n);){
    		for(int i=1; i<=n; i++) g[i].clear(), q[i].clear();
    		memset(par, 0, sizeof(par));
    		for(int i=0; i<n; i++){
    			scanf("%d:(%d)", &u, &m);
    			while(m--){
    				scanf("%d", &v);
    				par[v]=u;
    				g[u].pb(v);
    			}
    		}
    		scanf("%d", &m);
    		while(m--){
    			scanf(" (%d%d)", &u, &v);
    			q[u].pb(v);
    		}
    		int rt;
    		for(rt=1; par[rt]; rt=par[rt]);
    		for(int i=1; i<=n; i++) par[i]=i;
    		memset(ans, 0, sizeof(ans));
    		memset(col, 0, sizeof(col));
    		dfs(rt, rt);
    		for(int i=1; i<=n; i++) if(ans[i]) printf("%d:%d
    ", i, ans[i]);
    	}
    }
    
  • 相关阅读:
    c#子类序列化与父类序列化(Serializable)的区别
    eclipse中启动项目报内存溢出问题通过修改配置解决
    java 代码的良好习惯
    s:iterator 标签使用错误记录
    html5 required属性的注意事项
    赋值文件夹名称为日期的doc命令
    cmd命令中截取日期字符
    s:if 标签 字符串比较 正确用法和错误用法
    Resource interpreted as Stylesheet but transferred with MIME type text/plain
    xmind指定32位jdk解决在64位系统上不能启动的问题
  • 原文地址:https://www.cnblogs.com/Patt/p/4728270.html
Copyright © 2011-2022 走看看