zjnu2020- 08-12 专题分块莫队|笛卡尔树

Begin: 1597212000000

zjnu2020- 08-12 专题分块莫队|笛卡尔树

End: 1597222800000

Elapsed:

Remaining:

#	Origin	Title
A	计蒜客 38228	Max answer
B	HDU 6756	Finding a MEX
C	LibreOJ 6277	数列分块入门 1
D	LibreOJ 6278	数列分块入门 2
E	LibreOJ 6279	数列分块入门 3
F	LibreOJ 6280	数列分块入门 4
G	LibreOJ 2254	一个简单的询问
H	Kattis scaffolding	Scaffolding
I	SPOJ DQUERY	D-query
J	CodeForces 617E	XOR and Favorite Number
K	HDU 1506	Largest Rectangle in a Histogram

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":388992,"title":"zjnu2020- 08-12  专题 分块莫队|笛卡尔树","type":0,"openness":1,"authStatus":1,"begin":1597212000000,"end":1597222800000,"createTime":1597209345000,"started":true,"ended":true,"managerId":269762,"managerName":"tc2000731","fav":false,"description":{"format":"MD","content":""},"announcement":"题目顺序不是推荐做题顺序","problems":[{"pid":3198558,"title":"Max answer","oj":"计蒜客","probNum":"38228","num":"A","publicDescId":2891677529146148,"publicDescVersion":1666357987000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false}],"weight":1,"submitTips":"The problem is unavailable for long time.","languages":{"python3":"Python 语言 (3.8)","c++14":"C++ 语言 (C++14)","c++":"C++ 语言 (C++11)","python":"Python 语言 (2.7)","c":"C 语言","java":"Java 语言"},"submitMethods":[false,true,true]},{"pid":3572084,"title":"Finding a MEX","oj":"HDU","probNum":"6756","num":"B","publicDescId":3023761807095092,"publicDescVersion":1714327723000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2020+Multi-University+Training+Contest+1\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2020 Multi-University Training Contest 1 \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":3186310,"title":"数列分块入门 1","oj":"LibreOJ","probNum":"6277","num":"C","publicDescId":2888098094973759,"publicDescVersion":1714658406000,"properties":[{"title":"Time limit","content":"100 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"数据结构; 分块及按大小分类; hzwer 题集","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":3187582,"title":"数列分块入门 2","oj":"LibreOJ","probNum":"6278","num":"D","publicDescId":2890902318776704,"publicDescVersion":1714452366000,"properties":[{"title":"Time limit","content":"500 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"数据结构; 分块及按大小分类; hzwer 题集","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":3187799,"title":"数列分块入门 3","oj":"LibreOJ","probNum":"6279","num":"E","publicDescId":2890923542767860,"publicDescVersion":1714705069000,"properties":[{"title":"Time limit","content":"1500 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"数据结构; 分块及按大小分类; hzwer 题集","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":3187818,"title":"数列分块入门 4","oj":"LibreOJ","probNum":"6280","num":"F","publicDescId":2890918093979907,"publicDescVersion":1714600632000,"properties":[{"title":"Time limit","content":"500 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"数据结构; 分块及按大小分类; hzwer 题集","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":3631944,"title":"一个简单的询问","oj":"LibreOJ","probNum":"2254","num":"G","publicDescId":3012305055736791,"publicDescVersion":1714382505000,"properties":[{"title":"Time limit","content":"2800 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"SNOI2017","spoiler":true},{"title":"Tags","content":"数据结构; 2017; 分块及按大小分类; 莫队; SNOI","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":551499,"title":"Scaffolding","oj":"Kattis","probNum":"scaffolding","num":"H","publicDescId":3343809906175509,"publicDescVersion":1713911110000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"1048576 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\"https://open.kattis.com/problem-sources/Hong%20Kong%20Regional%20Contest%202016\"\u003eHong Kong Regional Contest 2016\u003c/a\u003e","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\"https://open.kattis.com/problem-authors/Yuen%20Chak%20Fai\"\u003eYuen Chak Fai\u003c/a\u003e","spoiler":true},{"title":"License","content":"\u003ca rel\u003d\"license\" href\u003d\"https://creativecommons.org/licenses/by-sa/3.0/\" style\u003d\"vertical-align: middle;\"\u003e\u003cimg class\u003d\"problem-license\" alt\u003d\"Creative Commons License (cc by-sa)\" src\u003d\"CDN_BASE_URL/9f210cdd030c90615fab37b8125d28ab?v\u003d1713911109\"\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,false]},{"pid":32356,"title":"D-query","oj":"SPOJ","probNum":"DQUERY","num":"I","publicDescId":3216280258965232,"publicDescVersion":1714592246000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"1572864 kB","spoiler":false},{"title":"Code length Limit","content":"50000 B","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"Minesweeper","spoiler":true},{"title":"Author","content":"Jimmy","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"44":"C++14 (gcc 8.3)","45":"Assembler 32 (gcc 8.3)","46":"Sed (sed 4.7)","47":"Kotlin (kotlin 1.3.21)","48":"Dart (dart 2.3.0)","110":"BC (bc 1.07.1)","111":"Clojure (clojure 1.10.0)","112":"JavaScript (SMonkey 60.2.3)","114":"Go (go 1.12.1)","115":"Unlambda (unlambda 0.1.4.2)","116":"Python 3 (python 3.9.5)","117":"R (R 3.5.2)","118":"Cobol (gnucobol 2.2.0)","91":"CoffeeScript (coffee 2.4.1)","92":"Fantom (fantom 1.0.72)","93":"Rust (rust 1.56)","94":"Pico Lisp (pico 18.12.27)","95":"Racket (racket 7.0)","96":"Elixir (elixir 1.8.2)","97":"Scheme (chicken 4.13)","98":"Gosu (gosu 1.14.9)","10":"Java (HotSpot 12)","11":"C (gcc 8.3)","99":"Python (PyPy 2.7.13)","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)","121":"Groovy (groovy 2.5.6)","1":"C++ (gcc 8.3)","122":"Nim (nim 0.19.4)","2":"Pascal (gpc 20070904)","124":"F# (mono 4.1)","3":"Perl (perl 5.28.1)","4":"Python (cpython 2.7.16)","5":"Fortran (gfortran 8.3)","126":"Python 3 nbc (python 3.7.3)","127":"Octave (octave 4.4.1)","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)","22":"Pascal (fpc 3.0.4)","23":"Smalltalk (gst 3.2.5)","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)","33":"Scheme (guile 2.2.4)","34":"C99 (gcc 8.3)","38":"TCL (tcl 8.6)","39":"Scala (scala 2.12.8)","102":"D (dmd 2.085.0)","104":"AWK (gawk 4.2.1)","105":"AWK (mawk 1.3.3)","107":"Forth (gforth 0.7.3)","80":"Julia (julia 1.5.3)","81":"C (clang 8.0)","108":"Prolog (gprolog 1.4.5)","82":"C++14 (clang 8.0)","109":"Python 3 (PyPy 3.6.1)","83":"Objective-C (clang 8.0)","84":"D (ldc 1.12.0)","40":"SQLite (sqlite 3.27.2)","41":"C++ (g++ 4.3.2)","85":"Swift (swift 4.2.2)","42":"Assembler 64 (nasm 2.14)","86":"C# (NET 6.0)","43":"Objective-C (gcc 8.3)"},"submitMethods":[true,true,false]},{"pid":313276,"title":"XOR and Favorite Number","oj":"CodeForces","probNum":"617E","num":"J","publicDescId":3240021798650735,"publicDescVersion":1714700186000,"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/617\"\u003eCodeforces Round 340 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    *2200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/22950\" title\u003d\"22950\" 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/22971\" title\u003d\"Tutorial\" 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":24533,"title":"Largest Rectangle in a Histogram","oj":"HDU","probNum":"1506","num":"K","publicDescId":3101491605041836,"publicDescVersion":1714230418000,"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\u003dUniversity+of+Ulm+Local+Contest+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 2003 \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":"ac7b2085ffea69d3b8ee06081a6b106c","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

zjnu2020- 08-12 专题 分块莫队|笛卡尔树

zjnu2020- 08-12 专题分块莫队|笛卡尔树