【两个月刷题计划】专题六最小生成树

Begin: 1581125550000

【两个月刷题计划】专题六最小生成树

End: 1586309550000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 1251	Jungle Roads
B	POJ 1287	Networking
C	POJ 2031	Building a Space Station
D	POJ 2421	Constructing Roads
E	ZOJ 1586	QS Network
F	POJ 1789	Truck History
G	POJ 2349	Arctic Network
H	POJ 1751	Highways
I	POJ 1258	Agri-Net
J	POJ 3026	Borg Maze
K	POJ 1679	The Unique MST
L	HDU 1233	还是畅通工程
M	HDU 1301	Jungle Roads
N	HDU 1875	畅通工程再续

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":356001,"title":"【两个月刷题计划】专题六 最小生成树","type":0,"openness":0,"authStatus":1,"begin":1581125550000,"end":1586309550000,"createTime":1581125467000,"started":true,"ended":true,"managerId":270775,"managerName":"yangchaoyi","fav":false,"description":{"format":"MD","content":"学如逆水行舟，不进则退"},"announcement":"博客地址：https://blog.csdn.net/weixin_42429718\n\n欢迎一起来做题！","problems":[{"pid":14339,"title":"Jungle Roads","oj":"POJ","probNum":"1251","num":"A","publicDescId":3165851960714115,"publicDescVersion":1714706937000,"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\u003dMid-Central+USA+2002\"\u003eMid-Central USA 2002\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":27372,"title":"Networking","oj":"POJ","probNum":"1287","num":"B","publicDescId":3127997051267300,"publicDescVersion":1714350447000,"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\u003dSoutheastern+Europe+2002\"\u003eSoutheastern Europe 2002\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":19364,"title":"Building a Space Station","oj":"POJ","probNum":"2031","num":"C","publicDescId":3106688466237361,"publicDescVersion":1714458394000,"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\u003dJapan+2003+Domestic\"\u003eJapan 2003 Domestic\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":17711,"title":"Constructing Roads","oj":"POJ","probNum":"2421","num":"D","publicDescId":3154689732222017,"publicDescVersion":1714334507000,"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\u003dPKU+Monthly\"\u003ePKU Monthly\u003c/a\u003e,kicc\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":30201,"title":"QS Network","oj":"ZOJ","probNum":"1586","num":"E","publicDescId":3118994002383775,"publicDescVersion":1714515478000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"JIANG, Jiefeng","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":10534,"title":"Truck History","oj":"POJ","probNum":"1789","num":"F","publicDescId":3158155216884069,"publicDescVersion":1714399161000,"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\u003dCTU+Open+2003\"\u003eCTU Open 2003\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":17341,"title":"Arctic Network","oj":"POJ","probNum":"2349","num":"G","publicDescId":3151372637553517,"publicDescVersion":1714333489000,"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\u003dWaterloo+local+2002.09.28\"\u003eWaterloo local 2002.09.28\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":27373,"title":"Highways","oj":"POJ","probNum":"1751","num":"H","publicDescId":3127991871308083,"publicDescVersion":1714566842000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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+1999\"\u003eNortheastern Europe 1999\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":10756,"title":"Agri-Net","oj":"POJ","probNum":"1258","num":"I","publicDescId":3158008986101171,"publicDescVersion":1714382919000,"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\u003dUSACO+102\"\u003eUSACO 102\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":19887,"title":"Borg Maze","oj":"POJ","probNum":"3026","num":"J","publicDescId":3108706745750695,"publicDescVersion":1714509495000,"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\u003dSvenskt+M%C3%A4sterskap+i+Programmering%2FNorgesmesterskapet+2001\"\u003eSvenskt Mästerskap i Programmering/Norgesmesterskapet 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":17124,"title":"The Unique MST","oj":"POJ","probNum":"1679","num":"K","publicDescId":3152934219002356,"publicDescVersion":1714310485000,"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\u003dPOJ+Monthly--2004.06.27+srbga%40POJ\"\u003ePOJ Monthly--2004.06.27 srbga@POJ\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":20289,"title":"还是畅通工程","oj":"HDU","probNum":"1233","num":"L","publicDescId":3107543617587392,"publicDescVersion":1714352895000,"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\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-2006%C4%EA\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙大计算机研究生复试上机考试-2006年 \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":23260,"title":"Jungle Roads","oj":"HDU","probNum":"1301","num":"M","publicDescId":3099717098165179,"publicDescVersion":1714351530000,"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\u003dMid-Central+USA+2002\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Mid-Central USA 2002 \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":15740,"title":"畅通工程再续","oj":"HDU","probNum":"1875","num":"N","publicDescId":3165273160898847,"publicDescVersion":1714285349000,"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%D5%E3%B4%F3%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C8%C8%C9%ED%C8%FC%A3%A82%A3%A9%A1%AA%A1%AA%C8%AB%D5%E6%C4%A3%C4%E2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008浙大研究生复试热身赛（2）——全真模拟 \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]}],"problemsHash":"a3c6433d32410d25ecb8138ad1c3907f","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

【两个月刷题计划】专题六 最小生成树

【两个月刷题计划】专题六最小生成树