baka!快点滚过来练题啦!(最短路 && 最小生成树

Begin: 1585299600000

baka!快点滚过来练题啦!(最短路 && 最小生成树

End: 1585904400000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1599	find the mincost route
B	HDU 1704	Rank
C	POJ 1062	昂贵的聘礼
D	POJ 3037	Skiing
E	HDU 3631	Shortest Path
F	POJ 3615	Cow Hurdles
G	POJ 3159	Candies(差分约束)
H	HDU 1874	畅通工程续
I	HDU 1596	find the safest road
J	HDU 2433	Travel
K	HDU 2680	Choose the best route
L	HDU 4889	Scary Path Finding Algorithm
M	HDU 4568	Hunter(状压DP)
N	HDU 2544	最短路
O	POJ 3259	Wormholes
P	HDU 1385	Minimum Transport Cost
Q	POJ 1860	Currency Exchange
R	POJ 1511	Invitation Cards(链式前向星存图
S	HDU 1233	还是畅通工程(最小生成树
T	HDU 3938	Portal(离线
U	HDU 5627	Clarke and MST
V	HDU 4081	Qin Shi Huang's National Road System(次小生成树
W	HDU 4126	Qin Shi Huang's National Road System(次小生成树plus
X	HDU 4756	Install Air Conditioning(次小生成树plus
Y	HDU 4750	Count The Pairs(最小瓶颈生成树

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":364766,"title":"baka!快点滚过来练题啦!(最短路 \u0026#38;\u0026#38; 最小生成树","type":0,"openness":0,"authStatus":1,"begin":1585299600000,"end":1585904400000,"createTime":1585299452000,"started":true,"ended":true,"managerId":342393,"managerName":"541907190117","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":18884,"title":"find the mincost route","oj":"HDU","probNum":"1599","num":"A","publicDescId":3156445455450532,"publicDescVersion":1714266517000,"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":25189,"title":"Rank","oj":"HDU","probNum":"1704","num":"B","publicDescId":3102936554605997,"publicDescVersion":1714438442000,"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\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A81%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2007省赛集训队练习赛（1） \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":"C","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":27371,"title":"Skiing","oj":"POJ","probNum":"3037","num":"D","publicDescId":3128002499998297,"publicDescVersion":1714154860000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003dUSACO+2005+October+Gold\"\u003eUSACO 2005 October 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":11715,"title":"Shortest Path","oj":"HDU","probNum":"3631","num":"E","publicDescId":3162182014086299,"publicDescVersion":1714294123000,"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":16275,"title":"Cow Hurdles","oj":"POJ","probNum":"3615","num":"F","publicDescId":3150126742512631,"publicDescVersion":1714588092000,"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+2007+November+Silver\"\u003eUSACO 2007 November 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":17126,"title":"Candies(差分约束)","oj":"POJ","probNum":"3159","num":"G","publicDescId":3152923657356366,"publicDescVersion":1714691459000,"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":17632,"title":"畅通工程续","oj":"HDU","probNum":"1874","num":"H","publicDescId":3154974192342895,"publicDescVersion":1714256480000,"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\"\u003elinle\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":11749,"title":"find the safest road","oj":"HDU","probNum":"1596","num":"I","publicDescId":3161653348120527,"publicDescVersion":1714441334000,"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":17423,"title":"Travel","oj":"HDU","probNum":"2433","num":"J","publicDescId":3152179672588247,"publicDescVersion":1714288271000,"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\u003d2008+Asia+Chengdu+Regional+Contest+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008 Asia Chengdu Regional 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":17817,"title":"Choose the best route","oj":"HDU","probNum":"2680","num":"K","publicDescId":3155566284500361,"publicDescVersion":1714273215000,"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":52195,"title":"Scary Path Finding Algorithm","oj":"HDU","probNum":"4889","num":"L","publicDescId":3191721014561131,"publicDescVersion":1714581077000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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\u003d2014+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2014 Multi-University Training Contest 3 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eFudan University\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":44690,"title":"Hunter(状压DP)","oj":"HDU","probNum":"4568","num":"M","publicDescId":3168553351415400,"publicDescVersion":1714301167000,"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-ICPC%B3%A4%C9%B3%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM-ICPC长沙赛区全国邀请赛——题目重现 \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":10951,"title":"最短路","oj":"HDU","probNum":"2544","num":"N","publicDescId":3158381439212974,"publicDescVersion":1714242923000,"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":"O","publicDescId":3158125970389206,"publicDescVersion":1714555224000,"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":26310,"title":"Minimum Transport Cost","oj":"HDU","probNum":"1385","num":"P","publicDescId":3126834071064617,"publicDescVersion":1714269633000,"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\u003dAsia+1996%2C+Shanghai+%28Mainland+China%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Asia 1996, Shanghai (Mainland China) \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":"Q","publicDescId":3124374164384521,"publicDescVersion":1714708943000,"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":18637,"title":"Invitation Cards(链式前向星存图","oj":"POJ","probNum":"1511","num":"R","publicDescId":3157390935360516,"publicDescVersion":1714673898000,"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":20289,"title":"还是畅通工程(最小生成树","oj":"HDU","probNum":"1233","num":"S","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":22079,"title":"Portal(离线","oj":"HDU","probNum":"3938","num":"T","publicDescId":3112523940222628,"publicDescVersion":1714418699000,"properties":[{"title":"Time limit","content":"1000 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+10+-+Host+by+HRBEU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 10 - Host by HRBEU \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":618011,"title":"Clarke and MST","oj":"HDU","probNum":"5627","num":"U","publicDescId":3375603653808358,"publicDescVersion":1714366336000,"properties":[{"title":"Time limit","content":"1000 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\u003dBestCoder+Round+%2372+%28div.2%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #72 (div.2) \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":24956,"title":"Qin Shi Huang\u0026#39;s National Road System(次小生成树","oj":"HDU","probNum":"4081","num":"V","publicDescId":3104943918382257,"publicDescVersion":1714275813000,"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\u003d2011+Asia+Beijing+Regional+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Asia Beijing Regional 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":25793,"title":"Qin Shi Huang\u0026#39;s National Road System(次小生成树plus","oj":"HDU","probNum":"4126","num":"W","publicDescId":3122958776062745,"publicDescVersion":1714323440000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"327680 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+Asia+Fuzhou+Regional+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Asia Fuzhou Regional 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":46760,"title":"Install Air Conditioning(次小生成树plus","oj":"HDU","probNum":"4756","num":"X","publicDescId":3173536075678718,"publicDescVersion":1714367797000,"properties":[{"title":"Time limit","content":"2000 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\u003d2013+ACM%2FICPC+Asia+Regional+Nanjing+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM/ICPC Asia Regional Nanjing 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":46774,"title":"Count The Pairs(最小瓶颈生成树","oj":"HDU","probNum":"4750","num":"Y","publicDescId":3173597502532148,"publicDescVersion":1714242622000,"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\u003d2013+ACM%2FICPC+Asia+Regional+Nanjing+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM/ICPC Asia Regional Nanjing 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]}],"problemsHash":"e78ce425832e3e28e80dbeae691a3af8","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}