[kuangbin]图论练习-图的割点、桥与双连通分支 [Cloned]

Begin: 1516809600000

[kuangbin]图论练习-图的割点、桥与双连通分支 [Cloned]

End: 1519401600000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 3177	Redundant Paths
B	POJ 3352	Road Construction
C	POJ 1236	Network of Schools
D	POJ 2186	Popular Cows
E	POJ 2553	The Bottom of a Graph
F	POJ 2942	Knights of the Round Table
G	POJ 3694	Network

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":209187,"title":"[kuangbin]图论练习-图的割点、桥与双连通分支 [Cloned]","type":1,"openness":0,"authStatus":1,"begin":1516809600000,"end":1519401600000,"createTime":1516809021000,"started":true,"ended":true,"managerId":81367,"managerName":"2015030405002","groupShortName":"alpha","groupName":"菜鸡15搞事情","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/25941\u0027 target\u003d\u0027_blank\u0027\u003e[kuangbin]图论练习-图的割点、桥与双连通分支\u003c/a\u003e]"},"announcement":"","problems":[{"pid":11216,"title":"Redundant Paths","oj":"POJ","probNum":"3177","num":"A","publicDescId":3113495458377813,"publicDescVersion":1312735294000,"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+2006+January+Gold\"\u003eUSACO 2006 January 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":11219,"title":"Road Construction","oj":"POJ","probNum":"3352","num":"B","publicDescId":3161409178607261,"publicDescVersion":1715625807000,"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\u003dCCC+2007\"\u003eCCC 2007\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":17001,"title":"Network of Schools","oj":"POJ","probNum":"1236","num":"C","publicDescId":3152525514010882,"publicDescVersion":1715925717000,"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\u003dIOI+1996\"\u003eIOI 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":16578,"title":"Popular Cows","oj":"POJ","probNum":"2186","num":"D","publicDescId":3149486823679339,"publicDescVersion":1715563795000,"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+2003+Fall\"\u003eUSACO 2003 Fall\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":11217,"title":"The Bottom of a Graph","oj":"POJ","probNum":"2553","num":"E","publicDescId":3161405768622158,"publicDescVersion":1715479540000,"properties":[{"title":"Time limit","content":"3000 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\u003dUlm+Local+2003\"\u003eUlm Local 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":12602,"title":"Knights of the Round Table","oj":"POJ","probNum":"2942","num":"F","publicDescId":3160731279094954,"publicDescVersion":1715951115000,"properties":[{"title":"Time limit","content":"7000 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\u003dCentral+Europe+2005\"\u003eCentral Europe 2005\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":11132,"title":"Network","oj":"POJ","probNum":"3694","num":"G","publicDescId":3158579925450056,"publicDescVersion":1716101503000,"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\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\"\u003e2008 Asia Hefei Regional Contest Online by USTC\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":"51aa57ffcb6af8234af0aecdc894216d","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}