该博客介绍了一种在竞赛编程中处理最短路径问题的方法，通过并查集和最近公共祖先（LCA）算法来解决给定的图论问题。博客提供了输入输出示例，并详细解释了思路，包括如何处理可能存在的环以及如何计算不同路径的最短距离。
传送门：http://codeforces.com/gym/101808/problem/K
Shortest path problems have always been a part of competitive programming, appearing in many contests all around the world. In order to keep that tradition, we created another one:
You are given an undirected connected weighted graph with N nodes and N edges, and you have to answer Q queries. Each query consists of two nodes X and Y, and you have to find the length of the shortest path between nodes X and Y.
Input
The first line contains a single integer T, the number of test cases.
Each test case starts with a line containing two integers N and Q, the number of nodes (and edges) and the number of queries. (3 ≤ N ≤ 105) (1 ≤ Q ≤ 105)
Each of the following N lines contain the description of the edg
最低0.47元/天 解锁文章
扫一扫
568
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
