Connections between cities（LCA+并查集）

最新推荐文章于 2022-11-26 11:07:01 发布

sdau_blue

最新推荐文章于 2022-11-26 11:07:01 发布

阅读量412

点赞数

分类专栏：数据结构——LCA

本文链接：https://blog.csdn.net/xianpingping/article/details/81668601

版权

该博客讨论了一道编程竞赛题目，要求在受损城市间重建道路并找出任意两城市间的最短路径。题目描述了输入格式和输出要求，并给出样例输入和输出。解决方案涉及利用LCA（最近公共祖先）算法和并查集来判断城市是否在同一连通分量中，以及计算最短路径。作者提到在实现过程中遇到的问题，即需要将最大城市数量的限制扩大两倍才能正确运行代码。

摘要由CSDN通过智能技术生成

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=2874

Connections between cities

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15139 Accepted Submission(s): 3449

Problem Description

After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produced in certain places. So we need to transport these materials from city to city. For most of roads had been totally destroyed during the war, there might be no path between two cities, no circle exists as well.
Now, your task comes. After giving you the condition of the roads, we want to know if there exists a path between any two cities. If the answer is yes, output the shortest path between them.

Input

Input consists of multiple problem instances.For each instance, first line contains three integers n, m and c, 2<=n<=10000, 0<=m<10000, 1<=c<=1000000. n represents the number of cities numbered from 1 to n. Following m lines, each line has three integers i, j and k, represent a road between city i and city j, with length k. Last c lines, two integers i, j each line, indicates a query of city i and city j.

Output

For each problem instance, one line for each query. If no path between two cities, output “Not connected”, otherwise output the length of the shortest path between them.

Sample Input

5 3 2

1 3 2

2 4 3

5 2 3

1 4

4 5

Sample Output

Not conne