zoukankan      html  css  js  c++  java
  • Nearest Common Ancestors·POJ1330

    传送门:http://poj.org/problem?id=1330

    Nearest Common Ancestors
    Time Limit: 1000MS   Memory Limit: 10000K
         

    Description

    A rooted tree is a well-known data structure in computer science and engineering. An example is shown below:


    In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an ancestor of node 16. As a matter of fact, nodes 8, 4, 10, and 16 are the ancestors of node 16. Remember that a node is an ancestor of itself. Nodes 8, 4, 6, and 7 are the ancestors of node 7. A node x is called a common ancestor of two different nodes y and z if node x is an ancestor of node y and an ancestor of node z. Thus, nodes 8 and 4 are the common ancestors of nodes 16 and 7. A node x is called the nearest common ancestor of nodes y and z if x is a common ancestor of y and z and nearest to y and z among their common ancestors. Hence, the nearest common ancestor of nodes 16 and 7 is node 4. Node 4 is nearer to nodes 16 and 7 than node 8 is.

    For other examples, the nearest common ancestor of nodes 2 and 3 is node 10, the nearest common ancestor of nodes 6 and 13 is node 8, and the nearest common ancestor of nodes 4 and 12 is node 4. In the last example, if y is an ancestor of z, then the nearest common ancestor of y and z is y.

    Write a program that finds the nearest common ancestor of two distinct nodes in a tree.

    Input

    The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case starts with a line containing an integer N , the number of nodes in a tree, 2<=N<=10,000. The nodes are labeled with integers 1, 2,..., N. Each of the next N -1 lines contains a pair of integers that represent an edge --the first integer is the parent node of the second integer. Note that a tree with N nodes has exactly N - 1 edges. The last line of each test case contains two distinct integers whose nearest common ancestor is to be computed.

    Output

    Print exactly one line for each test case. The line should contain the integer that is the nearest common ancestor.

    Sample Input

    2
    16
    1 14
    8 5
    10 16
    5 9
    4 6
    8 4
    4 10
    1 13
    6 15
    10 11
    6 7
    10 2
    16 3
    8 1
    16 12
    16 7
    5
    2 3
    3 4
    3 1
    1 5
    3 5
    

    Sample Output

    4
    3
    
    

    Source

     
     
    没什么好说的。。注意多组数据
     
    Codes:
     1 #include<set>
     2 #include<queue>
     3 #include<vector>
     4 #include<cstdio>
     5 #include<cstring>
     6 #include<iostream>
     7 #include<algorithm>
     8 using namespace std;
     9 const int N = 10010;
    10 #define For(i,n) for(int i=1;i<=n;i++)
    11 #define Rep(i,l,r) for(int i=l;i<=r;i++)
    12 
    13 struct Edge{
    14     int t,next;
    15 }E[N];
    16 
    17 int in[N],head[N],Es;
    18 int n,T,x,y,ans,qx,qy,root,anc[N],fa[N];
    19 bool vis[N];
    20 
    21 void makelist(int s,int t){
    22     E[Es].t = t;E[Es].next = head[s];
    23     head[s] = Es++;
    24 }
    25 
    26 int find(int i){
    27     return (fa[i]==i)?(i):(find(fa[i]));
    28 }
    29 
    30 void LCA(int i){
    31     if(ans!=0) return;
    32     anc[i] = i;
    33     for(int p = head[i];p!=-1;p=E[p].next){
    34         LCA(E[p].t);
    35         fa[find(E[p].t)] = find(i);
    36         anc[find(i)] = i;
    37     }
    38     vis[i] = true;
    39     if(i==qx)
    40         if(vis[qy]) ans = anc[find(qy)];
    41     if(i==qy)
    42         if(vis[qx]) ans = anc[find(qx)];
    43 }
    44 
    45 int main(){
    46     scanf("%d",&T);
    47     For(i,T){
    48         memset(head,-1,sizeof(head));Es = 0;ans = 0;
    49         memset(in,0,sizeof(in));memset(anc,0,sizeof(anc));
    50         memset(vis,false,sizeof(vis));
    51         scanf("%d",&n);
    52         For(i,n-1){
    53             fa[i] = i;
    54             scanf("%d %d",&x,&y);
    55             makelist(x,y);
    56             in[y]++;
    57         }
    58         fa[n] = n;
    59         For(i,n)
    60             if(!in[i]) {root = i;break;}
    61         scanf("%d %d",&qx,&qy);
    62         LCA(root);
    63         printf("%d
    ",ans);
    64     }
    65     return 0;
    66 }
  • 相关阅读:
    html input type=file 选择图片,图片预览 纯html js实现图片预览
    asp.net mvc Controller控制器返回类型
    webrequest HttpWebRequest webclient/HttpClient
    js中__proto__和prototype constructor 的区别和关系
    JQuery的ajaxFileUpload的使用
    cuda中当数组数大于线程数的处理方法
    cuda中threadIdx、blockIdx、blockDim和gridDim的使用
    cuda和gcc版本不兼容
    【转】CentOS 6.6 升级GCC G++ (当前最新版本为v6.1.0) (完整)
    matlab练习程序(地图上画经纬度)
  • 原文地址:https://www.cnblogs.com/zjdx1998/p/3886728.html
Copyright © 2011-2022 走看看