连通性，度数，拓扑问题

Begin: 1472377200000

连通性，度数，拓扑问题

End: 1472377201000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 1236	问添加多少边可成为完全连通图
B	POJ 1659	根据度序列构造图
C	POJ 2553	The Bottom of a Graph
D	POJ 2186	强连通分量缩点图出度为0的点
E	POJ 3249	Test for Job
F	POJ 3592	Instantaneous Transference
G	POJ 2762	单向连通图判定
H	POJ 3177	Redundant Paths
I	POJ 3352	添加多少条边可成为双向连通图
J	POJ 3687	Labeling Balls
K	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":130560,"title":"连通性，度数，拓扑问题","type":0,"openness":0,"authStatus":1,"begin":1472377200000,"end":1472377201000,"createTime":0,"started":true,"ended":true,"managerId":87200,"managerName":"xzxxzx401","fav":false,"description":{"content":""},"announcement":"","problems":[{"pid":17001,"title":"问添加多少边可成为完全连通图","oj":"POJ","probNum":"1236","num":"A","publicDescId":3152525514010882,"publicDescVersion":1718594360000,"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":16481,"title":"根据度序列构造图","oj":"POJ","probNum":"1659","num":"B","publicDescId":3150812172087918,"publicDescVersion":1718847333000,"properties":[{"title":"Time limit","content":"5000 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\u003dPOJ+Monthly--2004.05.15+Alcyone%40pku\"\u003ePOJ Monthly--2004.05.15 Alcyone@pku\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":"C","publicDescId":3161405768622158,"publicDescVersion":1718665775000,"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":16578,"title":"强连通分量缩点图出度为0的点","oj":"POJ","probNum":"2186","num":"D","publicDescId":3149486823679339,"publicDescVersion":1718636863000,"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":20606,"title":"Test for Job","oj":"POJ","probNum":"3249","num":"E","publicDescId":3107849478137785,"publicDescVersion":1718411665000,"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\u003dPOJ+Monthly--2007.07.08\"\u003ePOJ Monthly--2007.07.08\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":14370,"title":"Instantaneous Transference","oj":"POJ","probNum":"3592","num":"F","publicDescId":3165907671015253,"publicDescVersion":1718692380000,"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\u003dSouth+Central+China+2008+hosted+by+NUDT\"\u003eSouth Central China 2008 hosted by NUDT\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":12633,"title":"单向连通图判定","oj":"POJ","probNum":"2762","num":"G","publicDescId":3160758152944864,"publicDescVersion":1718425999000,"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\u003dPOJ+Monthly--2006.02.26\"\u003ePOJ Monthly--2006.02.26\u003c/a\u003e,zgl \u0026amp; twb\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":11216,"title":"Redundant Paths","oj":"POJ","probNum":"3177","num":"H","publicDescId":3161411149974019,"publicDescVersion":1718483752000,"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":"添加多少条边可成为双向连通图","oj":"POJ","probNum":"3352","num":"I","publicDescId":3161409178607261,"publicDescVersion":1718805720000,"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":19855,"title":"Labeling Balls","oj":"POJ","probNum":"3687","num":"J","publicDescId":3108619889152288,"publicDescVersion":1718524892000,"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\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.08.31\"\u003ePOJ Founder Monthly Contest – 2008.08.31\u003c/a\u003e, windy7926778\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":"K","publicDescId":3158579925450056,"publicDescVersion":1718617112000,"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":"81f76aef8e4e2ffcaf305ec7cd523881","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}