zoukankan      html  css  js  c++  java
  • 【51.64%】【POJ 1330】Nearest Common Ancestors

    Time Limit: 1000MS Memory Limit: 10000K
    Total Submissions: 26416 Accepted: 13641
    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

    Taejon 2002

    【题解】

    裸的LCA。这道题用的是树上倍增;
    即先让两个点到同一深度。然后再一起网上走到汇合点。(每次走2^j步);
    记住这个递推公式
    p[i][j] = p[p[i][j-1]][j-1];

    #include <cstdio>
    #include <vector>
    #include <iostream>
    #include <algorithm>
    
    using namespace std;
    
    const int MAXN = 20000;
    const int MAX = 14;
    
    vector <int> son[MAXN];
    int n,fa[MAXN],p[MAXN][MAX+5],dep[MAXN],pre[MAX+5];
    
    void input(int &r)
    {
        char t = getchar();
        while (!isdigit(t)) t = getchar();
        r = 0;
        while (isdigit(t)) r = r * 10 + t - '0', t = getchar();
    }
    
    void dfs(int x,int f)
    {
        dep[x] = dep[f] + 1;
        p[x][0] = f;
        for (int i = 1; i <= MAX; i++)
            p[x][i] = p[p[x][i - 1]][i - 1];
        int len = son[x].size();
        for (int i = 0; i <= len - 1; i++)
        {
            int y = son[x][i];
            dfs(y, x);
        }
    }
    
    int main()
    {
        //freopen("F:\rush.txt", "r", stdin);
        pre[0] = 1;
        for (int i = 1; i <= MAX; i++)
            pre[i] = pre[i - 1] << 1;
        int T;
        input(T);
        while (T--)
        {
            input(n);
            for (int i = 1; i <= n; i++)
                son[i].clear(),fa[i] = 0;
            for (int i = 1; i <= n - 1; i++)
            {
                int x, y;
                input(x); input(y);
                son[x].push_back(y);
                fa[y]++;
            }
            int root;
            for (int i = 1; i <= n; i++)
                if (fa[i] == 0)
                {
                    root = i;
                    break;
                }
            dfs(root,0);
            int t0, t1;
            input(t0); input(t1);
            if (dep[t0] > dep[t1])
                swap(t0, t1);
            for (int i = MAX; i >= 0; i--)
                if (dep[t0] <= dep[t1] - pre[i])
                    t1 = p[t1][i];
            if (t1 == t0)
            {
                printf("%d
    ", t1);
                continue;
            }
            for (int i = MAX; i >= 0; i--)
            {
                if (p[t0][i] == p[t1][i])
                    continue;
                t0 = p[t0][i], t1 = p[t1][i];
            }
            printf("%d
    ", p[t0][0]);
        }
        return 0;
    }
  • 相关阅读:
    C语言I博客作业03
    C语言I博客作业02
    macwingIDE python3.5 配置
    JAVA必会算法插入排序
    java匿名内部类的另一个用途
    JAVA必会算法选择排序
    Mac elasticsearch 5.2.2 单机双节点配置
    JAVA必会算法二分查找法
    AOP 事物连接,记忆连接数据库,连接池
    线程的意义与一些常见面试问题
  • 原文地址:https://www.cnblogs.com/AWCXV/p/7632179.html
Copyright © 2011-2022 走看看