最新公告
  • 欢迎您光临波比源码,本站秉承服务宗旨 履行“站长”责任,销售只是起点 服务永无止境!立即加入我们
  • (DS 《算法竞赛入门经典》)LA 3027 Corporative Network(查询某一个节点到根节点之间的距离)

    题目大意:

                 查询某1个节点到根节点之间的距离


    解题思路:

                加权并查集问题。之前做的题目是“查看两个或多个节点是不是在同1个集合下”,现在的题目是“查询某个节点到

    根节点之间的距离”。之前只需要使用到father[x]这个数组,用来表示x的父亲节点是谁。现在引入dist[x]数组,用来记录

    x节点到根节点的距离

                1)在并查集中,根节点不懂,其他节点都可以动。



    A very big corporation is developing its corporative network. In the beginning each of the N enterprises of the corporation, numerated from 1 to N, organized its own computing and telecommunication center. Soon, for amelioration of the services, the corporation started to collect some enterprises in clusters, each of them served by a single computing and telecommunication center as follow. The corporation chose one of the existing centers I (serving the cluster A) and one of the enterprises J in some cluster B (not necessarily the center) and link them with telecommunication line. The length of the line between the enterprises I and J is |I ? J|(mod 1000). In such a way the two old clusters are joined in a new cluster, served by the center of the old cluster B. Unfortunately after each join the sum of the lengths of the lines linking an enterprise to its serving center could be changed and the end users would like to know what is the new length. Write a program to keep trace of the changes in the organization of the network that is able in each moment to answer the questions of the users.

    Input 

    Your program has to be ready to solve more than one test case. The first line of the input file will contains only the number T of the test cases. Each test will start with the number N of enterprises (5≤N≤20000). Then some number of lines (no more than 200000) will follow with one of the commands:

    E I ? asking the length of the path from the enterprise I to its serving center in the moment;
    I I J ? informing that the serving center I is linked to the enterprise J.

    The test case finishes with a line containing the word O. The I commands are less than N.

    Output 

    The output should contain as many lines as the number of E commands in all test cases with a single number each ? the asked sum of length of lines connecting the corresponding enterprise with its serving center.

    Sample Input 

    1
    4
    E 3
    I 3 1
    E 3
    I 1 2
    E 3
    I 2 4
    E 3
    O
    

    Sample Output 

    0
    2
    3
    5

    代码以下:

    /*
    * LA3027.cpp
    *
    * Created on: 2015年1月3日
    * Author: Administrator
    */

    #include <iostream>
    #include <cstdio>
    #include <algorithm>

    using namespace std;

    const int maxn = 20005;
    int father[maxn];
    int dist[maxn];

    int find(int x) {
    if (x != father[x]) {
    int fx = find(father[x]);
    dist[x] += dist[father[x]];
    father[x] = fx;
    }

    return father[x];
    }

    int main() {
    int t;
    scanf("%d", &t);
    while (t–) {
    char cmd[9];

    int n;
    scanf("%d", &n);

    int i;
    for (i = 1; i <= n; ++i) {
    father[i] = i;
    dist[i] = 0;
    }

    while (scanf("%s", cmd) == 1, cmd[0] != ‘O’) {
    if (cmd[0] == ‘I’) {
    int u, v;
    scanf("%d%d", &u, &v);
    father[u] = v;
    dist[u] = abs(u – v) % 1000;
    } else if (cmd[0] == ‘E’) {
    int u;
    scanf("%d", &u);
    find(u);

    printf("%d
    ", dist[u]);
    }
    }

    }

    return 0;
    }



    波比源码 – 精品源码模版分享 | www.bobi11.com
    1. 本站所有资源来源于用户上传和网络,如有侵权请邮件联系站长!
    2. 分享目的仅供大家学习和交流,您必须在下载后24小时内删除!
    3. 不得使用于非法商业用途,不得违反国家法律。否则后果自负!
    4. 本站提供的源码、模板、插件等等其他资源,都不包含技术服务请大家谅解!
    5. 如有链接无法下载、失效或广告,请联系管理员处理!
    6. 本站资源售价只是赞助,收取费用仅维持本站的日常运营所需!
    7. 如遇到加密压缩包,请使用WINRAR解压,如遇到无法解压的请联系管理员!

    波比源码 » (DS 《算法竞赛入门经典》)LA 3027 Corporative Network(查询某一个节点到根节点之间的距离)

    常见问题FAQ

    免费下载或者VIP会员专享资源能否直接商用?
    本站所有资源版权均属于原作者所有,这里所提供资源均只能用于参考学习用,请勿直接商用。若由于商用引起版权纠纷,一切责任均由使用者承担。更多说明请参考 VIP介绍。
    提示下载完但解压或打开不了?
    最常见的情况是下载不完整: 可对比下载完压缩包的与网盘上的容量,若小于网盘提示的容量则是这个原因。这是浏览器下载的bug,建议用百度网盘软件或迅雷下载。若排除这种情况,可在对应资源底部留言,或 联络我们.。
    找不到素材资源介绍文章里的示例图片?
    对于PPT,KEY,Mockups,APP,网页模版等类型的素材,文章内用于介绍的图片通常并不包含在对应可供下载素材包内。这些相关商业图片需另外购买,且本站不负责(也没有办法)找到出处。 同样地一些字体文件也是这种情况,但部分素材会在素材包内有一份字体下载链接清单。
    波比源码
    一个高级程序员模板开发平台
    升级波友尊享更多特权立即升级