CQUPT 集训队专题训练（最短路）

Begin: 1487520000000

CQUPT 集训队专题训练（最短路）

End: 1487692800000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 2544	最短路
B	POJ 3259	Wormholes
C	POJ 1125	Stockbroker Grapevine
D	POJ 1062	昂贵的聘礼
E	HDU 3790	最短路径问题
F	HDU 2680	Choose the best route

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":151209,"title":"CQUPT 集训队专题训练（最短路）","type":0,"openness":0,"authStatus":1,"begin":1487520000000,"end":1487692800000,"createTime":1487499395000,"started":true,"ended":true,"managerId":44245,"managerName":"cqupt","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":10951,"title":"最短路","oj":"HDU","probNum":"2544","num":"A","publicDescId":3158381439212974,"publicDescVersion":1713251377000,"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\u003dUESTC+6th+Programming+Contest+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e UESTC 6th Programming Contest Online \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":10533,"title":"Wormholes","oj":"POJ","probNum":"3259","num":"B","publicDescId":3158125970389206,"publicDescVersion":1713319519000,"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":14577,"title":"Stockbroker Grapevine","oj":"POJ","probNum":"1125","num":"C","publicDescId":3165552126864146,"publicDescVersion":1713185796000,"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\u003dSouthern+African+2001\"\u003eSouthern African 2001\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":"D","publicDescId":3158635549248872,"publicDescVersion":1713238545000,"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":20910,"title":"最短路径问题","oj":"HDU","probNum":"3790","num":"E","publicDescId":3111511358032921,"publicDescVersion":1713549773000,"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\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2010%C4%EA\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙大计算机研究生复试上机考试-2010年 \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":17817,"title":"Choose the best route","oj":"HDU","probNum":"2680","num":"F","publicDescId":3155566284500361,"publicDescVersion":1713475565000,"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]}],"problemsHash":"6f6168655145a01dadbdf3718bcecabc","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}