SonG_树链剖分 [Cloned]

Begin: 1556038800000

SonG_树链剖分 [Cloned]

End: 1556643600000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 3966	Aragorn's Story
B	SPOJ QTREE	Query on a tree
C	POJ 2763	Housewife Wind
D	HYSBZ 1036	树的统计Count
E	POJ 3237	Tree
F	HYSBZ 2243	染色
G	HDU 5052	Yaoge’s maximum profit
H	HDU 4718	The LCIS on the Tree
I	UVA 12655	Trucks
J	HDU 5029	Relief grain
K	SCU 4549	Greed King
L	HDU 6162	Ch’s gift
M	CodeForces 343D	Water Tree
N	LightOJ 1348	Aladdin and the Return Journey
O	ZOJ 3862	Intersection
P	HDU 4777	区间与其他数互质数的个数

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":297233,"title":"SonG_树链剖分 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1556038800000,"end":1556643600000,"createTime":1556038596000,"started":true,"ended":true,"managerId":132941,"managerName":"mqd","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/272917\u0027 target\u003d\u0027_blank\u0027\u003e树链剖分\u003c/a\u003e]"},"announcement":"","problems":[{"pid":22734,"title":"Aragorn\u0027s Story","oj":"HDU","probNum":"3966","num":"A","publicDescId":3096637009684688,"publicDescVersion":1715021917000,"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":13013,"title":"Query on a tree","oj":"SPOJ","probNum":"QTREE","num":"B","publicDescId":2841621455990113,"publicDescVersion":1539778146000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"1572864 kB","spoiler":false},{"title":"Code length Limit","content":"15000 B","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"Thanh-Vy Hua","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"22":"Pascal (fpc 3.0.4)","23":"Smalltalk (gst 3.2.5)","24":"JAR (JavaSE 6)","25":"Nice (nicec 0.9.13)","26":"Lua (luac 5.3.3)","27":"C# (gmcs 5.20.1)","28":"Bash (bash 5.0.3)","29":"PHP (php 7.3.5)","30":"Nemerle (ncc 1.2.547)","31":"Common Lisp (sbcl 1.4.16)","32":"Common Lisp (clisp 2.49.92)","10":"Java (HotSpot 12)","11":"C (gcc 8.3)","33":"Scheme (guile 2.2.4)","12":"Brainf**k (bff 1.0.6)","13":"Assembler 32 (nasm 2.14)","14":"Clips (clips 6.30)","15":"Prolog (swi 7.6.4)","16":"Icon (iconc 9.5.1)","17":"Ruby (ruby 2.5.5)","18":"Scheme (stalin 0.11)","19":"Pike (pike 8.0)","1":"C++ (gcc 8.3)","2":"Pascal (gpc 20070904)","3":"Perl (perl 5.28.1)","4":"Python (cpython 2.7.16)","5":"Fortran (gfortran 8.3)","6":"Whitespace (wspace 0.3)","7":"Ada95 (gnat 8.3)","8":"Ocaml (ocamlopt 4.05.0)","9":"Intercal (ick 0.3)","62":"Text (plain text)","20":"D (gdc 8.3)","21":"Haskell (ghc 8.4.4)"},"submitMethods":[true,true,false]},{"pid":18624,"title":"Housewife Wind","oj":"POJ","probNum":"2763","num":"C","publicDescId":3157363931102670,"publicDescVersion":1715123337000,"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":"D","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":"E","publicDescId":3108699058454860,"publicDescVersion":1714635641000,"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":38096,"title":"染色","oj":"HYSBZ","probNum":"2243","num":"F","publicDescId":3232807933966311,"publicDescVersion":1591556709000,"properties":[{"title":"Time limit","content":"20000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"SDOI2011","spoiler":true}],"weight":1,"submitTips":"HYSBZ is down.","submitMethods":[false,false,false]},{"pid":53608,"title":"Yaoge’s maximum profit","oj":"HDU","probNum":"5052","num":"G","publicDescId":3284795257177263,"publicDescVersion":1714329584000,"properties":[{"title":"Time limit","content":"5000 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\u003d2014+ACM%2FICPC+Asia+Regional+Shanghai+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2014 ACM/ICPC Asia Regional Shanghai Online \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":46498,"title":"The LCIS on the Tree","oj":"HDU","probNum":"4718","num":"H","publicDescId":3174370198119435,"publicDescVersion":1714496436000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"65535 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\u003d2013+ACM%2FICPC+Asia+Regional+Online+%A1%AA%A1%AA+Warmup2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM/ICPC Asia Regional Online —— Warmup2 \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":46738,"title":"Trucks","oj":"UVA","probNum":"12655","num":"I","publicDescId":3173467229636960,"publicDescVersion":1714950045000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":53372,"title":"Relief grain","oj":"HDU","probNum":"5029","num":"J","publicDescId":3284720137542762,"publicDescVersion":1714927709000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"100000 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\u003d2014+ACM%2FICPC+Asia+Regional+Guangzhou+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2014 ACM/ICPC Asia Regional Guangzhou Online \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":744162,"title":"Greed King","oj":"SCU","probNum":"4549","num":"K","publicDescId":3316591170566142,"publicDescVersion":1671187250000,"properties":[{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"SCU is down.","submitMethods":[false,false,false]},{"pid":1030799,"title":"Ch’s gift","oj":"HDU","probNum":"6162","num":"L","publicDescId":3333371386390598,"publicDescVersion":1714618404000,"properties":[{"title":"Time limit","content":"3000 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\u003d2017+Multi-University+Training+Contest+-+Team+9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2017 Multi-University Training Contest - Team 9 \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":46715,"title":"Water Tree","oj":"CodeForces","probNum":"343D","num":"M","publicDescId":3175052557590135,"publicDescVersion":1714779661000,"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.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":27056,"title":"Aladdin and the Return Journey","oj":"LightOJ","probNum":"1348","num":"N","publicDescId":3129176164873674,"publicDescVersion":1715091949000,"properties":[{"title":"Time limit","content":"3000 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":150136,"title":"Intersection","oj":"ZOJ","probNum":"3862","num":"O","publicDescId":3280115582153341,"publicDescVersion":1714767713000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"LIN, Xi","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":47402,"title":"区间与其他数互质数的个数","oj":"HDU","probNum":"4777","num":"P","publicDescId":3194846164716649,"publicDescVersion":1714958636000,"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\u003d2013+Asia+Hangzhou+Regional+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 Asia Hangzhou Regional Contest  \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":"d5ad645276da65f807385b7ab5f33c17","privatePeerContestIds":[],"enableTimeMachine":false,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}