弱者为何要战斗之最短路（一） [Cloned]

Begin: 1547987400000

弱者为何要战斗之最短路（一） [Cloned]

End: 1553171400000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1217	Arbitrage
B	HDU 1245	Saving James Bond
C	HDU 1317	XYZZY
D	HDU 1535	Invitation Cards
E	HDU 1546	Idiomatic Phrases Game
F	HDU 2680	Choose the best route
G	HDU 2923	Einbahnstrasse
H	HDU 3339	In Action
I	HDU 2224	The shortest path
J	HDU 2807	The Shortest Path
K	HDU 1595	find the longest of the shortest
L	HDU 3986	Harry Potter and the Final Battle
M	HDU 1599	find the mincost route
N	HDU 1839	Delay Constrained Maximum Capacity Path
O	HDU 3631	Shortest Path
P	HDU 3632	A Captivating Match

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":280347,"title":"弱者为何要战斗 之 最短路 （一） [Cloned]","type":0,"openness":1,"authStatus":1,"begin":1547987400000,"end":1553171400000,"createTime":1547987085000,"started":true,"ended":true,"managerId":197292,"managerName":"20170293","fav":false,"description":{"format":"PLAIN","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/252111\u0027 target\u003d\u0027_blank\u0027\u003e弱者为何要战斗 之 最短路 （一）\u003c/a\u003e]"},"announcement":"","problems":[{"pid":22312,"title":"Arbitrage","oj":"HDU","probNum":"1217","num":"A","publicDescId":3097781287886569,"publicDescVersion":1715617649000,"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\u003dUniversity+of+Ulm+Local+Contest+1996\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 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":23524,"title":"Saving James Bond","oj":"HDU","probNum":"1245","num":"B","publicDescId":3100322931099361,"publicDescVersion":1715032238000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eweigang Lee\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":30513,"title":"XYZZY","oj":"HDU","probNum":"1317","num":"C","publicDescId":3122266116599535,"publicDescVersion":1715514153000,"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\u003dUniversity+of+Waterloo+Local+Contest+2003.09.27\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Waterloo Local Contest 2003.09.27 \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":31149,"title":"Invitation Cards","oj":"HDU","probNum":"1535","num":"D","publicDescId":3212306445214669,"publicDescVersion":1715626906000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003dCentral+Europe+1998\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Central 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":31152,"title":"Idiomatic Phrases Game","oj":"HDU","probNum":"1546","num":"E","publicDescId":3212298757663986,"publicDescVersion":1715594512000,"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\u003dZhejiang+Provincial+Programming+Contest+2006\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Zhejiang Provincial Programming Contest 2006 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eZHOU, Ran\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":17817,"title":"Choose the best route","oj":"HDU","probNum":"2680","num":"F","publicDescId":3155566284500361,"publicDescVersion":1715604450000,"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\u003d2009%D5%E3%BD%AD%B4%F3%D1%A7%BC%C6%CB%E3%BB%FA%D1%D0%BF%BC%B8%B4%CA%D4%A3%A8%BB%FA%CA%D4%B2%BF%B7%D6%A3%A9%A1%AA%A1%AA%C8%AB%D5%E6%C4%A3%C4%E2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009浙江大学计算机研考复试（机试部分）——全真模拟 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003edandelion\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":23110,"title":"Einbahnstrasse","oj":"HDU","probNum":"2923","num":"G","publicDescId":3097035372890638,"publicDescVersion":1715212832000,"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\u003d2008+ANARC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008 ANARC \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":15626,"title":"In Action","oj":"HDU","probNum":"3339","num":"H","publicDescId":3164450086362418,"publicDescVersion":1715548400000,"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.03.06\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.03.06 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eLost@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":31160,"title":"The shortest path","oj":"HDU","probNum":"2224","num":"I","publicDescId":3212341275908378,"publicDescVersion":1715815121000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e8600\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":17927,"title":"The Shortest Path","oj":"HDU","probNum":"2807","num":"J","publicDescId":3155322097368140,"publicDescVersion":1715264983000,"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\u003dHDU+2009-4+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2009-4 Programming Contest \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":18881,"title":"find the longest of the shortest","oj":"HDU","probNum":"1595","num":"K","publicDescId":3156424232582768,"publicDescVersion":1715754977000,"properties":[{"title":"Time limit","content":"5000 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\u003dHDU+2007-Spring+Programming+Contest+-+Warm+Up+%A3%A81%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2007-Spring Programming Contest - Warm Up （1） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eailyanlu\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":22888,"title":"Harry Potter and the Final Battle","oj":"HDU","probNum":"3986","num":"L","publicDescId":3096485598893485,"publicDescVersion":1714577129000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003d2011+Multi-University+Training+Contest+15+-+Host+by+WHU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 15 - Host by WHU \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003etender@WHU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,true]},{"pid":18884,"title":"find the mincost route","oj":"HDU","probNum":"1599","num":"M","publicDescId":3156445455450532,"publicDescVersion":1715600128000,"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\u003dHDU+2007-Spring+Programming+Contest+-+Warm+Up+%A3%A81%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2007-Spring Programming Contest - Warm Up （1） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e8600\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":30078,"title":"Delay Constrained Maximum Capacity Path","oj":"HDU","probNum":"1839","num":"N","publicDescId":3119148257692153,"publicDescVersion":1715548488000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"65535 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\u003dPolitehnica+University+of+Bucharest+Local+Team+Contest+2007\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Politehnica University of Bucharest Local Team Contest 2007 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eMugurel Ionut Andreica\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":11715,"title":"Shortest Path","oj":"HDU","probNum":"3631","num":"O","publicDescId":3162182014086299,"publicDescVersion":1715566535000,"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\u003d2010+Asia+Regional+Tianjin+Site+%A1%AA%A1%AA+Online+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 Asia Regional Tianjin Site —— Online Contest \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":41270,"title":"A Captivating Match","oj":"HDU","probNum":"3632","num":"P","publicDescId":3227990258843400,"publicDescVersion":1714506161000,"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\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A819%A3%A9%A1%AA%A1%AAHost+by+HDU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（19）——Host by HDU \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eWestwind Blows@HDU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,true]}],"problemsHash":"f3dbe97d6be9aff00b14b9799021627b","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

弱者为何要战斗 之 最短路 （一） [Cloned]

弱者为何要战斗之最短路（一） [Cloned]