(DS 《算法竞赛入门经典》)LA 3027 Corporative Network(查询某一个节点到根节点之间的距离)
来源:互联网 发布:淘宝宝贝怎么下架 编辑:程序博客网 时间:2024/05/27 00:44
题目大意:
查询某一个节点到根节点之间的距离
解题思路:
加权并查集问题。之前做的题目是“查看两个或多个节点是否在同一个集合下”,现在的题目是“查询某个节点到
根节点之间的距离”。之前只需要使用到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;The test case finishes with a line containing the word O. The I commands are less than N.
I I J � informing that the serving center I is linked to the enterprise J.
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
14E 3I 3 1E 3I 1 2E 3I 2 4E 3O
Sample Output
0235
代码如下:
/* * 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\n", dist[u]);}}}return 0;}
- (DS 《算法竞赛入门经典》)LA 3027 Corporative Network(查询某一个节点到根节点之间的距离)
- BNU Corporative Network(并查集求点到根节点的距离)@
- LA - 3027 - Corporative Network
- LA--3027--Corporative Network
- LA 3027 Corporative Network
- LA 3027 - Corporative Network
- LA 3027 Corporative Network
- LA 3027 - Corporative Network
- LA 3027 Corporative Network
- LA 3027 Corporative Network
- LA 3027 - Corporative Network
- Corporative Network(LA 3027)
- LA 3027Corporative Network
- LA 3027 Corporative Network
- LA 3027 Corporative Network 并查集记录点到根的距离
- (DS 《算法竞赛入门经典》)LA 3644 X-Plosives(并查集)
- LA 3027(p192)----Corporative Network
- LA 3027 - Corporative Network(经典的并查集和 路径压缩)
- Stringstr=new String("abc") 这行代码究竟创建了几个对象?
- 线上线下难打通
- 2014再见 2015 你好
- Centos 6.4 python 2.6 升级到 2.7
- exit()与exit(n)区别
- (DS 《算法竞赛入门经典》)LA 3027 Corporative Network(查询某一个节点到根节点之间的距离)
- Excel公式中的符号作用
- 使用intptr_t和uintptr_t
- Ajax调用后台action返回JSONArray(JSONObject)类型实现jsp中下拉列表的动态显示
- 过滤敏感字符
- 赵晓东-课程设计 201311671432
- 简单的整理下部分处理数字的函数名
- Web_PHP_php的iconv()函数用于理中文乱码;
- 用mciSendCommand实现的音乐播放类