给定一个无向加权图，需找到从顶点1出发，经过所有边至少一次，然后返回顶点1的最短路径长度。可能存在自环和重边。若无法完成，则输出-1。题目要求通过Floyd算法求全源最短路径，并利用欧拉路径与奇偶度数理论解决奇数度数问题，最终采用动态规划优化复杂度。
D. Traveling Graph
time limit per test
0.5 second
memory limit per test
64 megabytes
input
standard input
output
standard output
You are given undirected weighted graph. Find the length of the shortest cycle which starts from the vertex 1 and passes throught all the edges at least once. Graph may contain multiply edges between a pair of vertices and loops (edges from the vertex to itself).
Input
The first line of the input contains two integers n and
最低0.47元/天 解锁文章
扫一扫
1314
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
