最短路
CrossDolphin
青春看起来如此完美,没空闲去浪费时间。
展开
-
最短路-邻接表(优先队列)写
题目链接:http://codevs.cn/problem/2038/ 题目描述 Description 农夫John发现做出全威斯康辛州最甜的黄油的方法:糖。把糖放在一片牧场上,他知道N(1 农夫John很狡猾。他知道他可以训练这些奶牛,让它们在听到铃声时去一个特定的牧场。他打算将糖放在那里然后下午发出铃声,以至他可以在晚上挤奶。 农夫John知道每只奶牛都在各自原创 2015-03-15 16:39:30 · 805 阅读 · 0 评论 -
BestCoder 74
链接:戳这里 A:LCP Array 题意:给定一个字符串s=s1s2s3s4...s5,si代表字符(小写字母),知道任意两个相邻的后缀的最长公共前缀长度为一个整数ai,这个意思就是相邻字符相等的个数为ai。问满足该字符串s的种数。 思路:样例 4 3 2 1 aaaa aaa aa a 显然这样的字符串必须是 aaaa (26字符任意一个) 才能满足原创 2016-03-07 16:57:51 · 287 阅读 · 0 评论 -
Codeforces Round #349 (Div. 2) A B C[dp] D[spfa] +vector
链接:戳这里 A + B 就不写了吧 C. Reberland Linguistics time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Fi原创 2016-05-02 17:40:28 · 704 阅读 · 0 评论 -
2016 浙江省赛 The 13th Zhejiang Provincial Collegiate Programming Contest K题 SPFA
链接:戳这里 Highway Project Time Limit: 2 Seconds Memory Limit: 65536 KB Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other citi原创 2016-04-23 23:18:36 · 478 阅读 · 0 评论 -
Codeforces Round #355 (Div. 2) A B C D vector + map spfa
链接:戳这里 A. Vanya and Fence time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Vanya and his friends are walking along the fence of he原创 2016-06-03 00:14:45 · 881 阅读 · 0 评论 -
Codeforces Round #303 (Div. 2) E 最短路迪杰斯特拉(小根堆实现)
链接:戳这里 E. Paths and Trees time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Little girl Susie accidentally found her elder brother原创 2016-07-22 17:29:26 · 765 阅读 · 0 评论 -
Codeforces Round #302 (Div. 2) D bfs最短路
链接:戳这里 D. Destroying Roads time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output In some country there are exactly n cities and m bidi原创 2016-07-25 13:41:48 · 327 阅读 · 0 评论 -
Codeforces Round #287 (Div. 2) E bfs+记录最短路径(邻接表的使用
链接:戳这里 E. Breaking Good time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Breaking Good is a new video game which a lot of gamers wa原创 2016-08-03 12:25:05 · 483 阅读 · 0 评论 -
hdu 5876 暴力
链接:戳这里 Sparse Graph Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description In graph theory, the complement of a graph G is a graph原创 2016-09-13 20:27:39 · 423 阅读 · 0 评论