![](https://img-blog.csdnimg.cn/2019092715111047.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
单源最短路
文章平均质量分 93
单源最短路
_sky123_
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #703 (Div. 2) E. Paired Payment
题目链接There are nnn cities and mmm bidirectional roads in the country. The roads in the country form an undirected weighted graph. The graph is not guaranteed to be connected. Each road has it’s own parameter www. You can travel through the roads, but the g原创 2021-02-19 19:58:33 · 242 阅读 · 0 评论 -
Codeforces Round #575 (Div. 3) F. K-th Path
题目链接You are given a connected undirected weighted graph consisting of nnn vertices and mm edges.You need to print the kkk-th smallest shortest path in this graph (paths from the vertex to itself are not counted, paths from iii to jjj and from jjj to iii原创 2020-11-13 00:35:27 · 136 阅读 · 0 评论 -
Codeforces Round #681 (Div. 1) C. Graph Transpositions
题目链接You are given a directed graph of nnn vertices and mmm edges. Vertices are numbered from 111 to nnn. There is a token in vertex 111.The following actions are allowed:Token movement. To move the token from vertex uuu to vertex vvv if there is an edg原创 2020-11-06 23:01:37 · 205 阅读 · 0 评论 -
关键结点
一个含有nnn个结点mmm条边的无向有权图,判断每个结点是否在从111到nnn的最短路径上输入描述第一行输入一个整数TTT,代表有TTT组测试数据 对于每一组测试数据,第一行有222个整数n,mn,mn,m,接下来mmm行每行有333个整数xi,yi,wix_i,y_i,w_ixi,yi,wix ,表示xxx和yyy之间有一条权值为wiw_iwi 的边输出描述对于每组测试数据,在一行中输出nnn个整数,第iii个整数代表iii号结点的关键性000代表该结点不可能出现在从111到nnn的最短原创 2020-06-07 18:29:04 · 1339 阅读 · 2 评论