专题6 树状数组 [Cloned]

Begin: 1564915080000

专题6 树状数组 [Cloned]

End: 1568515080000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 2299	Ultra-QuickSort
B	POJ 2352	Stars
C	POJ 1195	Mobile phones
D	POJ 2155	Matrix
E	POJ 3321	Apple Tree
F	HDU 3015	Disharmony Trees
G	HDU 2852	KiKi's K-Number
H	CodeForces 629D	Babaei and Birthday Cake
I	CodeForces 731D	80-th Level Archeology
J	CodeForces 1076E	Vasya and a 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":317256,"title":"专题6 树状数组 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1564915080000,"end":1568515080000,"createTime":1564915036000,"started":true,"ended":true,"managerId":262639,"managerName":"18110506081","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/311637\u0027 target\u003d\u0027_blank\u0027\u003e专题6 树状数组 [Cloned]\u003c/a\u003e]"},"announcement":"","problems":[{"pid":15025,"title":"Ultra-QuickSort","oj":"POJ","probNum":"2299","num":"A","publicDescId":2931460773963035,"publicDescVersion":1554800592000,"properties":[{"title":"Time limit","content":"7000 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\u003dWaterloo+local+2005.02.05\"\u003eWaterloo local 2005.02.05\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":14610,"title":"Stars","oj":"POJ","probNum":"2352","num":"B","publicDescId":2931455531746214,"publicDescVersion":1583842703000,"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\u003dUral+Collegiate+Programming+Contest+1999\"\u003eUral Collegiate Programming Contest 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]},{"pid":17086,"title":"Mobile phones","oj":"POJ","probNum":"1195","num":"C","publicDescId":3153364866940998,"publicDescVersion":1715933320000,"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\u003dIOI+2001\"\u003eIOI 2001\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":10491,"title":"Matrix","oj":"POJ","probNum":"2155","num":"D","publicDescId":3363081093497988,"publicDescVersion":1488593990000,"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\u003dPOJ+Monthly\"\u003ePOJ Monthly\u003c/a\u003e,Lou Tiancheng\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":10486,"title":"Apple Tree","oj":"POJ","probNum":"3321","num":"E","publicDescId":3159655861455784,"publicDescVersion":1715424607000,"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--2007.08.05\"\u003ePOJ Monthly--2007.08.05\u003c/a\u003e, Huang, Jinsong\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":17589,"title":"Disharmony Trees","oj":"HDU","probNum":"3015","num":"F","publicDescId":3154849434950668,"publicDescVersion":1715892148000,"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\u003d2009+Multi-University+Training+Contest+12+-+Host+by+FZU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 12 - Host by FZU \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":17358,"title":"KiKi\u0027s K-Number","oj":"HDU","probNum":"2852","num":"G","publicDescId":3151431228096061,"publicDescVersion":1715591941000,"properties":[{"title":"Time limit","content":"2000 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\u003d2009+Multi-University+Training+Contest+4+-+Host+by+HDU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 4 - Host by HDU \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":327868,"title":"Babaei and Birthday Cake","oj":"CodeForces","probNum":"629D","num":"H","publicDescId":3242003335232756,"publicDescVersion":1715361512000,"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/629\"\u003eCodeforces Round 343 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    dp\r\n\n\r\n    *2000\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/24159\" title\u003d\"Announcement\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/43227\" title\u003d\"Editorial of Codeforces Round #343 (Div.2)\" 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":525657,"title":"80-th Level Archeology","oj":"CodeForces","probNum":"731D","num":"I","publicDescId":3356666945767886,"publicDescVersion":1715739087000,"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/731\"\u003eCodeforces Round 376 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    brute force\r\n\n\r\n    data structures\r\n\n\r\n    greedy\r\n\n\r\n    sortings\r\n\n\r\n    *2200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/47769\" title\u003d\"Codeforces Round #376 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/47840\" title\u003d\"47840\" 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":2028113,"title":"Vasya and a Tree","oj":"CodeForces","probNum":"1076E","num":"J","publicDescId":2846765714092566,"publicDescVersion":1715526953000,"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/1076\"\u003eEducational Codeforces Round 54 (Rated for Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    trees\r\n\n\r\n    *1900\r\n","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]}],"problemsHash":"4412eaae8638731b7b87a1e085c368cb","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}