[kuangbin带你飞]专题四最短路练习 [Cloned]

Begin: 1552962600000

[kuangbin带你飞]专题四最短路练习 [Cloned]

End: 1558146600000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 2387	Til the Cows Come Home
B	POJ 2253	Frogger
C	POJ 1797	Heavy Transportation
D	POJ 3268	Silver Cow Party
E	POJ 1860	Currency Exchange
F	POJ 3259	Wormholes
G	POJ 1502	MPI Maelstrom
H	POJ 3660	Cow Contest
I	POJ 2240	Arbitrage
J	POJ 1511	Invitation Cards
K	POJ 3159	Candies
L	POJ 2502	Subway
M	POJ 1062	昂贵的聘礼
N	POJ 1847	Tram
O	LightOJ 1074	Extended Traffic
P	HDU 4725	The Shortest Path in Nya Graph
Q	HDU 3416	Marriage Match IV
R	HDU 4370	0 or 1
S	POJ 3169	Layout

Status

My Status

Translate

PDF

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":289568,"title":"[kuangbin带你飞]专题四 最短路练习 [Cloned]","type":1,"openness":0,"authStatus":1,"begin":1552962600000,"end":1558146600000,"createTime":1552961822000,"started":true,"ended":true,"managerId":166466,"managerName":"1706915041","groupShortName":"dyrichangxunlian","groupName":"TC工作室18级日常训练","fav":false,"description":{"format":"MD","content":"任意两点最短路**Floyd**算法：http://wiki.jikexueyuan.com/project/easy-learn-algorithm/floyd.html\n单源最短路算法**Dijkstrar**：http://wiki.jikexueyuan.com/project/easy-learn-algorithm/dijkstra.html\n判断有向图中**是否存在负环**Bellman-Ford算法：https://blog.csdn.net/guixunlong/article/details/8474263\n基于Bellman-Ford算法的优化*SPFA*算法：http://www.voidcn.com/article/p-xfbvspoz-bcu.html"},"announcement":"任意两点最短路**Floyd**算法：http://wiki.jikexueyuan.com/project/easy-learn-algorithm/floyd.html\n单源最短路算法(要求边权必须为正的)**Dijkstrar**：http://wiki.jikexueyuan.com/project/easy-learn-algorithm/dijkstra.html\n边权可以为负的且可以判断图中**是否有负环**Bellman-Ford算法：https://blog.csdn.net/guixunlong/article/details/8474263\n基于Bellman-Ford算法的优化*SPFA*算法：http://www.voidcn.com/article/p-xfbvspoz-bcu.html\n在邻接矩阵存图下 他们的时间复杂度分别是 n^3 ,n^2,n\\*m，n\\*m\n在邻接表存图下复杂度可大大优化。\n在邻接表下 No respond，m，n\\*m, log n \\*m这个不太准确....\n**邻接表**存图：http://wiki.jikexueyuan.com/project/easy-learn-algorithm/clever-adjacency-list.html\n\n尽可能在两周左右做完。","problems":[{"pid":18265,"title":"Til the Cows Come Home","oj":"POJ","probNum":"2387","num":"A","publicDescId":3154049575328009,"publicDescVersion":1714394889000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2004+November\"\u003eUSACO 2004 November\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":11759,"title":"Frogger","oj":"POJ","probNum":"2253","num":"B","publicDescId":2818121966802649,"publicDescVersion":1534422980000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUlm+Local+1997\"\u003eUlm Local 1997\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":11758,"title":"Heavy Transportation","oj":"POJ","probNum":"1797","num":"C","publicDescId":3161668786992974,"publicDescVersion":1714570767000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"30000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dTUD+Programming+Contest+2004\"\u003eTUD Programming Contest 2004\u003c/a\u003e, Darmstadt, Germany\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":11757,"title":"Silver Cow Party","oj":"POJ","probNum":"3268","num":"D","publicDescId":3161674235451651,"publicDescVersion":1714628754000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2007+February+Silver\"\u003eUSACO 2007 February Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":25713,"title":"Currency Exchange","oj":"POJ","probNum":"1860","num":"E","publicDescId":3362727542423205,"publicDescVersion":1487852666000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"30000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dNortheastern+Europe+2001\"\u003eNortheastern Europe 2001\u003c/a\u003e, Northern Subregion\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10533,"title":"Wormholes","oj":"POJ","probNum":"3259","num":"F","publicDescId":3311260924797344,"publicDescVersion":1498647068000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2006+December+Gold\"\u003eUSACO 2006 December Gold\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":11756,"title":"MPI Maelstrom","oj":"POJ","probNum":"1502","num":"G","publicDescId":3161680019251444,"publicDescVersion":1714268049000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dEast+Central+North+America+1996\"\u003eEast Central North America 1996\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":12425,"title":"Cow Contest","oj":"POJ","probNum":"3660","num":"H","publicDescId":3160967441628031,"publicDescVersion":1714533743000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2008+January+Silver\"\u003eUSACO 2008 January Silver\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10042,"title":"Arbitrage","oj":"POJ","probNum":"2240","num":"I","publicDescId":3158952412614152,"publicDescVersion":1714138198000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUlm+Local+1996\"\u003eUlm Local 1996\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":18637,"title":"Invitation Cards","oj":"POJ","probNum":"1511","num":"J","publicDescId":2930834041736996,"publicDescVersion":1552808112000,"properties":[{"title":"Time limit","content":"8000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dCentral+Europe+1998\"\u003eCentral Europe 1998\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17126,"title":"Candies","oj":"POJ","probNum":"3159","num":"K","publicDescId":2838158187510257,"publicDescVersion":1548557730000,"properties":[{"title":"Time limit","content":"1500 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPOJ+Monthly--2006.12.31\"\u003ePOJ Monthly--2006.12.31\u003c/a\u003e, Sempr\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":27369,"title":"Subway","oj":"POJ","probNum":"2502","num":"L","publicDescId":2815920545702695,"publicDescVersion":1533835849000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dWaterloo+local+2001.09.22\"\u003eWaterloo local 2001.09.22\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10777,"title":"昂贵的聘礼","oj":"POJ","probNum":"1062","num":"M","publicDescId":3158635549248872,"publicDescVersion":1714479459000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003d%E6%B5%99%E6%B1%9F\"\u003e浙江\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10757,"title":"Tram","oj":"POJ","probNum":"1847","num":"N","publicDescId":3158003806143486,"publicDescVersion":1714326555000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"30000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dCroatia+OI+2002+Regional+-+Juniors\"\u003eCroatia OI 2002 Regional - Juniors\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":26791,"title":"Extended Traffic","oj":"LightOJ","probNum":"1074","num":"O","publicDescId":3125611837955607,"publicDescVersion":1714551558000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":46505,"title":"The Shortest Path in Nya Graph","oj":"HDU","probNum":"4725","num":"P","publicDescId":3174383666411620,"publicDescVersion":1714289164000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2013+ACM%2FICPC+Asia+Regional+Online+%A1%AA%A1%AA+Warmup2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup2 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":11534,"title":"Marriage Match IV","oj":"HDU","probNum":"3416","num":"Q","publicDescId":3161328723563053,"publicDescVersion":1714272966000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDOJ+Monthly+Contest+%A8C+2010.06.05\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.06.05 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003estarvae@HDU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":31350,"title":"0 or 1","oj":"HDU","probNum":"4370","num":"R","publicDescId":3210713448238144,"publicDescVersion":1714276233000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2012+Multi-University+Training+Contest+8\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 Multi-University Training Contest 8 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eSnow_storm\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17082,"title":"Layout","oj":"POJ","probNum":"3169","num":"S","publicDescId":2816106469638780,"publicDescVersion":1533903449000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dUSACO+2005+December+Gold\"\u003eUSACO 2005 December Gold\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"b913b876895739edf8ade8b164f58426","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

[kuangbin带你飞]专题四 最短路练习 [Cloned]

[kuangbin带你飞]专题四最短路练习 [Cloned]