HPU DFS + BFS + 树的直径专项练习

Begin: 1501461000000

HPU DFS + BFS + 树的直径专项练习

End: 1501749000000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1312	Red and Black
B	HDU 1010	Tempter of the Bone
C	HDU 1241	Oil Deposits
D	CodeForces 510B	Fox And Two Dots
E	HDU 2266	How Many Equations Can You Find
F	CodeForces 723D	Lakes in Berland
G	LightOJ 1141	Number Transformation
H	LightOJ 1104	Birthday Paradox
I	POJ 1383	树的直径

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":174968,"title":"HPU DFS + BFS  + 树的直径 专项练习","type":0,"openness":1,"authStatus":1,"begin":1501461000000,"end":1501749000000,"createTime":1501402936000,"started":true,"ended":true,"managerId":103235,"managerName":"1823376647WYK","fav":false,"description":{"format":"HTML","content":""},"announcement":"劳逸结合，多思考~祝大家度过愉快充实的一天~QAQ，有什么不懂随时可以在群里问 或者 小窗口我~大家根据自己的情况，暂时掌握不了的题可以先放一放~","problems":[{"pid":15706,"title":"Red and Black","oj":"HDU","probNum":"1312","num":"A","publicDescId":3164656529174567,"publicDescVersion":1714941446000,"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+2004%2C+Ehime+%28Japan%29%2C+Japan+Domestic\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Asia 2004, Ehime (Japan), Japan Domestic \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":16336,"title":"Tempter of the Bone","oj":"HDU","probNum":"1010","num":"B","publicDescId":3150241236417113,"publicDescVersion":1714975936000,"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\u003dZJCPC2004\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e ZJCPC2004 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eZHANG, Zheng\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":15719,"title":"Oil Deposits","oj":"HDU","probNum":"1241","num":"C","publicDescId":3165219753788416,"publicDescVersion":1714878631000,"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\u003dMid-Central+USA+1997\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Mid-Central USA 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":115821,"title":"Fox And Two Dots","oj":"CodeForces","probNum":"510B","num":"D","publicDescId":3275611104865232,"publicDescVersion":1714712638000,"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/510\"\u003eCodeforces Round 290 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    *1500\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/16173\" title\u003d\"Codeforces Round #290 Editorial\" target\u003d\"_blank\"\u003eTutorial \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":18753,"title":"How Many Equations Can You Find","oj":"HDU","probNum":"2266","num":"E","publicDescId":3156139546909520,"publicDescVersion":1714331445000,"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+8th+Programming+Contest+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 8th Programming Contest Online \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":513486,"title":"Lakes in Berland","oj":"CodeForces","probNum":"723D","num":"F","publicDescId":3357678240971292,"publicDescVersion":1714799648000,"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/723\"\u003eCodeforces Round 375 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    dsu\r\n\n\r\n    graphs\r\n\n\r\n    greedy\r\n\n\r\n    implementation\r\n\n\r\n    *1600\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/47501\" title\u003d\"Codeforces Round #375 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/47502\" title\u003d\"Codeforces Round #375 (Div.2) Editorial\" target\u003d\"_blank\"\u003eTutorial\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":26855,"title":"Number Transformation","oj":"LightOJ","probNum":"1141","num":"G","publicDescId":3128570268412759,"publicDescVersion":1714995004000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26819,"title":"Birthday Paradox","oj":"LightOJ","probNum":"1104","num":"H","publicDescId":3128448585322115,"publicDescVersion":1714699783000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":17109,"title":"树的直径","oj":"POJ","probNum":"1383","num":"I","publicDescId":3152880811834521,"publicDescVersion":1714611434000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"32768 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+1999\"\u003eCentral Europe 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]}],"problemsHash":"0b3e4fe645285594ec450dff8fc96bc2","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

HPU DFS + BFS + 树的直径 专项练习

HPU DFS + BFS + 树的直径专项练习