图论专题

Begin: 1555506600000

End: 1556406600000

Elapsed:

Remaining:

#	Origin	Title
A	CodeForces 467D	Fedor and Essay
B	HDU 1269	迷宫城堡
C	HDU 1325	Is It A Tree?
D	HDU 3861	The King’s Problem
E	HDU 5154	Harry and Magical Computer
F	HDU 5652	India and China Origins
G	POJ 1144	Network
H	POJ 1236	Network of Schools
I	POJ 2762	Going from u to v or from v to u?

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":295959,"title":"图论专题","type":0,"openness":0,"authStatus":1,"begin":1555506600000,"end":1556406600000,"createTime":1555506594000,"started":true,"ended":true,"managerId":257210,"managerName":"709401953","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":53357,"title":"Fedor and Essay","oj":"CodeForces","probNum":"467D","num":"A","publicDescId":3284659042104372,"publicDescVersion":1715980339000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/467\"\u003eCodeforces Round 267 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    dp\r\n\n\r\n    graphs\r\n\n\r\n    hashing\r\n\n\r\n    strings\r\n\n\r\n    *2400\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/13797\" title\u003d\"Announcement\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":23836,"title":"迷宫城堡","oj":"HDU","probNum":"1269","num":"B","publicDescId":3099048298952244,"publicDescVersion":1715575075000,"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":27465,"title":"Is It A Tree?","oj":"HDU","probNum":"1325","num":"C","publicDescId":3127739803157151,"publicDescVersion":1715855981000,"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\u003dNorth+Central+North+America+1997\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e North 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]},{"pid":20786,"title":"The King’s Problem","oj":"HDU","probNum":"3861","num":"D","publicDescId":3110600381841792,"publicDescVersion":1715575368000,"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+Multi-University+Training+Contest+3+-+Host+by+BIT\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 3 - Host by BIT \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":100918,"title":"Harry and Magical Computer","oj":"HDU","probNum":"5154","num":"E","publicDescId":2875086711715960,"publicDescVersion":1529471993000,"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\u003dBestCoder+Round+%2325\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #25 \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":348497,"title":"India and China Origins","oj":"HDU","probNum":"5652","num":"F","publicDescId":3265226061580305,"publicDescVersion":1715949698000,"properties":[{"title":"Time limit","content":"2000 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+%2377+%28div.2%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #77 (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":19361,"title":"Network","oj":"POJ","probNum":"1144","num":"G","publicDescId":3106696153582216,"publicDescVersion":1715916648000,"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\u003dCentral+Europe+1996\"\u003eCentral Europe 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":17001,"title":"Network of Schools","oj":"POJ","probNum":"1236","num":"H","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":12633,"title":"Going from u to v or from v to u?","oj":"POJ","probNum":"2762","num":"I","publicDescId":3160758152944864,"publicDescVersion":1715650882000,"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]}],"problemsHash":"2d9ce0be1297bbab6949ea43fc527b7e","privatePeerContestIds":[],"enableTimeMachine":false,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}