SDUT 2019 寒假高级算法组第一讲树链剖分

Begin: 1547605800000

SDUT 2019 寒假高级算法组第一讲树链剖分

End: 1551205801000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 3966	Aragorn's Story
B	POJ 2763	Housewife Wind
C	HYSBZ 1036	树的统计Count
D	POJ 3237	Tree
E	CodeForces 343D	Water Tree

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":279350,"title":"SDUT 2019 寒假高级算法组 第一讲 树链剖分","type":0,"openness":0,"authStatus":1,"begin":1547605800000,"end":1551205801000,"createTime":1547605375000,"started":true,"ended":true,"managerId":112389,"managerName":"Fish_Li","fav":false,"description":{"format":"MD","content":"省赛题目（树链剖分可做） http://acm.sdut.edu.cn/onlinejudge2/index.php/Home/Index/problemdetail/pid/4217.html\n\nFish的模板（基于纳爷改造的金桔的版本改造而来） https://li-fish.github.io/2017/08/09/cjqx554pg002d4kc24xybxqqi/\n\n卿学姐的树链剖分视频 https://www.bilibili.com/video/av4482146?from\u003dsearch\u0026seid\u003d4801303176259127508\n\nUESTC 的新版算法讲堂 https://www.bilibili.com/video/av24798851?from\u003dsearch\u0026seid\u003d4801303176259127508"},"announcement":"","problems":[{"pid":22734,"title":"Aragorn\u0027s Story","oj":"HDU","probNum":"3966","num":"A","publicDescId":3096637009684688,"publicDescVersion":1713652761000,"properties":[{"title":"Time limit","content":"3000 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+13+-+Host+by+HIT+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 13 - Host by HIT  \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":18624,"title":"Housewife Wind","oj":"POJ","probNum":"2763","num":"B","publicDescId":3157363931102670,"publicDescVersion":1713786248000,"properties":[{"title":"Time limit","content":"4000 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":24279,"title":"树的统计Count","oj":"HYSBZ","probNum":"1036","num":"C","publicDescId":3102386886040188,"publicDescVersion":1591886792000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"165888 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ZJOI2008","spoiler":true}],"weight":1,"submitTips":"HYSBZ is down.","submitMethods":[false,false,false]},{"pid":19890,"title":"Tree","oj":"POJ","probNum":"3237","num":"D","publicDescId":3108699058454860,"publicDescVersion":1714023886000,"properties":[{"title":"Time limit","content":"5000 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--2007.06.03\"\u003ePOJ Monthly--2007.06.03\u003c/a\u003e, Lei, Tao\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":46715,"title":"Water Tree","oj":"CodeForces","probNum":"343D","num":"E","publicDescId":3175052557590135,"publicDescVersion":1713533735000,"properties":[{"title":"Time limit","content":"4000 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/343\"\u003eCodeforces Round 200 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    dfs and similar\r\n\n\r\n    graphs\r\n\n\r\n    trees\r\n\n\r\n    *2100\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/8860\" title\u003d\"Codeforces Round #200 Tutorial\" 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.9.10 (7.3.9, 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.19.5","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]}],"problemsHash":"21242b4cfafc5aa8384ec9446c5c9b87","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

SDUT 2019 寒假高级算法组 第一讲 树链剖分

SDUT 2019 寒假高级算法组第一讲树链剖分