【两个月刷题计划】专题五并查集

Begin: 1581125400000

【两个月刷题计划】专题五并查集

End: 1586309400000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 2236	Wireless Network
B	POJ 1611	The Suspects
C	HDU 1213	How Many Tables
D	HDU 3038	How Many Answers Are Wrong
E	POJ 1182	食物链
F	POJ 1417	True Liars
G	POJ 1456	Supermarket
H	POJ 1733	Parity game
I	POJ 1984	Navigation Nightmare
J	POJ 2492	A Bug's Life
K	POJ 2912	Rochambeau
L	ZOJ 3261	Connections in Galaxy War
M	HDU 1272	小希的迷宫
N	POJ 1308	Is It A Tree?

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":356000,"title":"【两个月刷题计划】专题五 并查集","type":0,"openness":0,"authStatus":1,"begin":1581125400000,"end":1586309400000,"createTime":1581125262000,"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":11125,"title":"Wireless Network","oj":"POJ","probNum":"2236","num":"A","publicDescId":3158569934768058,"publicDescVersion":1714194363000,"properties":[{"title":"Time limit","content":"10000 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\u003dPOJ+Monthly\"\u003ePOJ Monthly\u003c/a\u003e,HQM\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":10536,"title":"The Suspects","oj":"POJ","probNum":"1611","num":"B","publicDescId":3158152641717759,"publicDescVersion":1714421855000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"20000 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\u003dAsia+Kaohsiung+2003\"\u003eAsia Kaohsiung 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":19354,"title":"How Many Tables","oj":"HDU","probNum":"1213","num":"C","publicDescId":3107206738359983,"publicDescVersion":1714235673000,"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%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 杭电ACM省赛集训队选拔赛之热身赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L\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":22656,"title":"How Many Answers Are Wrong","oj":"HDU","probNum":"3038","num":"D","publicDescId":3098086615889246,"publicDescVersion":1714723809000,"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+Multi-University+Training+Contest+13+-+Host+by+HIT\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 13 - Host by HIT \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":14789,"title":"食物链","oj":"POJ","probNum":"1182","num":"E","publicDescId":3166324600228015,"publicDescVersion":1714501659000,"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\u003dNoi+01\"\u003eNoi 01\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":12603,"title":"True Liars","oj":"POJ","probNum":"1417","num":"F","publicDescId":3160734151807737,"publicDescVersion":1714549688000,"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\u003dJapan+2002+Kanazawa\"\u003eJapan 2002 Kanazawa\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":11386,"title":"Supermarket","oj":"POJ","probNum":"1456","num":"G","publicDescId":3161188458879819,"publicDescVersion":1714719688000,"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\u003dSoutheastern+Europe+2003\"\u003eSoutheastern Europe 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":17340,"title":"Parity game","oj":"POJ","probNum":"1733","num":"H","publicDescId":3151377816791774,"publicDescVersion":1714689736000,"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\u003dCEOI+1999\"\u003eCEOI 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":16598,"title":"Navigation Nightmare","oj":"POJ","probNum":"1984","num":"I","publicDescId":3149011366887866,"publicDescVersion":1714113007000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Case 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\u003dUSACO+2004+February\"\u003eUSACO 2004 February\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":13387,"title":"A Bug\u0027s Life","oj":"POJ","probNum":"2492","num":"J","publicDescId":3163902526592875,"publicDescVersion":1714505804000,"properties":[{"title":"Time limit","content":"10000 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\u003dTUD+Programming+Contest+2005\"\u003eTUD Programming Contest 2005\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":17576,"title":"Rochambeau","oj":"POJ","probNum":"2912","num":"K","publicDescId":3154814604781311,"publicDescVersion":1714334106000,"properties":[{"title":"Time limit","content":"5000 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\u003dBaidu+Star+2006+Preliminary\"\u003eBaidu Star 2006 Preliminary\u003c/a\u003e\r\u003cbr\u003eChen, Shixi (xreborner) living in http://fairyair.yeah.net/\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":11130,"title":"Connections in Galaxy War","oj":"ZOJ","probNum":"3261","num":"L","publicDescId":3158556730797806,"publicDescVersion":1714096293000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"MO, Luyi","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":11138,"title":"小希的迷宫","oj":"HDU","probNum":"1272","num":"M","publicDescId":3158604492301003,"publicDescVersion":1714241237000,"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\u003dHDU+2006-4+Programming+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2006-4 Programming Contest  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eGardon\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":17713,"title":"Is It A Tree?","oj":"POJ","probNum":"1308","num":"N","publicDescId":3154722120782043,"publicDescVersion":1714282416000,"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\u003dNorth+Central+North+America+1997\"\u003eNorth Central North America 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]}],"problemsHash":"2d5bc7dcca3c8f20b96c1d267ad4dd9a","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

【两个月刷题计划】专题五 并查集

【两个月刷题计划】专题五并查集