专题训练の线段树基础 [Cloned]

Begin: 1581953760000

专题训练の线段树基础 [Cloned]

End: 1582313760000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1166	敌兵布阵
B	HDU 1754	I Hate It
C	CodeForces 1111C	Creative Snap
D	POJ 3468	A Simple Problem with Integers
E	POJ 2528	Mayor's posters
F	HDU 1698	Just a Hook
G	ZOJ 1610	Count the Colors
H	POJ 3264	Balanced Lineup
I	HDU 4027	Can you answer these queries?
J	HDU 1540	Tunnel Warfare
K	HDU 3974	Assign the task
L	HDU 4578	Transformation
M	HDU 4614	Vases and Flowers
N	HDU 4553	约会安排
O	HDU 1255	覆盖的面积
P	HDU 1542	Atlantis
Q	HDU 3642	Get The Treasury
R	SPOJ GSS3	Can you answer these queries III
S	POJ 2482	Stars in Your Window
T	Gym 237040A	校门外的树
U	Gym 237040C	清点人数
V	Gym 237040D	简单题
W	Gym 237040E	二维树状数组：单点修改，区间查询
X	Gym 237040F	线段树：区间修改，区间查询
Y	Gym 237040G	维护序列

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":357681,"title":"专题训练の线段树基础 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1581953760000,"end":1582313760000,"createTime":1581953725000,"started":true,"ended":true,"managerId":247638,"managerName":"caihonghao","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/305691\u0027 target\u003d\u0027_blank\u0027\u003eCUGBACM18级专题训练の线段树基础\u003c/a\u003e]"},"announcement":"一道题做不出来看题解前看看是否满足下列条件：\n1，已经尝试30分钟以上。\n2，尝试过码题。","problems":[{"pid":16216,"title":"敌兵布阵","oj":"HDU","probNum":"1166","num":"A","publicDescId":3150570514286242,"publicDescVersion":1715852186000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eWindbreaker\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":14797,"title":"I Hate It","oj":"HDU","probNum":"1754","num":"B","publicDescId":3166345824293859,"publicDescVersion":1715482829000,"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\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A86%A3%A9_linle%D7%A8%B3%A1\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2007省赛集训队练习赛（6）_linle专场 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elinle\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":2198183,"title":"Creative Snap","oj":"CodeForces","probNum":"1111C","num":"C","publicDescId":2838498270049271,"publicDescVersion":1715538080000,"properties":[{"title":"Time limit","content":"1000 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/1111\"\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    brute force\r\n\n\r\n    divide and conquer\r\n\n\r\n    math\r\n\n\r\n    *1700\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/64989\" title\u003d\"CodeCraft-19 and Codeforces Round #537 (Div. 2) 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":14607,"title":"A Simple Problem with Integers","oj":"POJ","probNum":"3468","num":"D","publicDescId":3165613021115208,"publicDescVersion":1715927933000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Case time limit","content":"2000 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.11.25\"\u003ePOJ Monthly--2007.11.25\u003c/a\u003e, Yang Yi\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":14608,"title":"Mayor\u0027s posters","oj":"POJ","probNum":"2528","num":"E","publicDescId":3165607572384151,"publicDescVersion":1715537626000,"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\u003dAlberta+Collegiate+Programming+Contest+2003.10.18\"\u003eAlberta Collegiate Programming Contest 2003.10.18\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":15763,"title":"Just a Hook","oj":"HDU","probNum":"1698","num":"F","publicDescId":3165336834773755,"publicDescVersion":1715651193000,"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\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008 “Sunline Cup” National Invitational 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]},{"pid":11553,"title":"Count the Colors","oj":"ZOJ","probNum":"1610","num":"G","publicDescId":3161931890796296,"publicDescVersion":1715729645000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"Standlove","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":10244,"title":"Balanced Lineup","oj":"POJ","probNum":"3264","num":"H","publicDescId":3159823042551374,"publicDescVersion":1715599945000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Case 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\u003dUSACO+2007+January+Silver\"\u003eUSACO 2007 January Silver\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":23290,"title":"Can you answer these queries?","oj":"HDU","probNum":"4027","num":"I","publicDescId":3099770572498070,"publicDescVersion":1715488884000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65768 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\u003dThe+36th+ACM%2FICPC+Asia+Regional+Shanghai+Site+%A1%AA%A1%AA+Online+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e The 36th ACM/ICPC Asia Regional Shanghai Site —— Online 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]},{"pid":14794,"title":"Tunnel Warfare","oj":"HDU","probNum":"1540","num":"J","publicDescId":3166322629648137,"publicDescVersion":1715481423000,"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\u003dPOJ+Monthly\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e POJ Monthly \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":22741,"title":"Assign the task","oj":"HDU","probNum":"3974","num":"K","publicDescId":3096641887518509,"publicDescVersion":1715524604000,"properties":[{"title":"Time limit","content":"5000 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+14+-+Host+by+FZU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 14 - 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":46096,"title":"Transformation","oj":"HDU","probNum":"4578","num":"L","publicDescId":3171310427402556,"publicDescVersion":1715543461000,"properties":[{"title":"Time limit","content":"8000 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\u003d2013ACM-ICPC%BA%BC%D6%DD%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013ACM-ICPC杭州赛区全国邀请赛 \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":45647,"title":"Vases and Flowers","oj":"HDU","probNum":"4614","num":"M","publicDescId":3169796943142699,"publicDescVersion":1715483768000,"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\u003d2013+Multi-University+Training+Contest+2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 Multi-University Training Contest 2 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eSYSU\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":38882,"title":"约会安排","oj":"HDU","probNum":"4553","num":"N","publicDescId":3235849241006698,"publicDescVersion":1715800220000,"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\u003d2013%BD%F0%C9%BD%CE%F7%C9%BD%BE%D3%B4%B4%D2%E2%D3%CE%CF%B7%B3%CC%D0%F2%CC%F4%D5%BD%C8%FC%A1%AA%A1%AA%B3%F5%C8%FC%A3%A83%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013金山西山居创意游戏程序挑战赛——初赛（3） \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":15768,"title":"覆盖的面积","oj":"HDU","probNum":"1255","num":"O","publicDescId":3165329146699744,"publicDescVersion":1715498803000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L \u0026amp; weigang Lee\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":14795,"title":"Atlantis","oj":"HDU","probNum":"1542","num":"P","publicDescId":3166351540925780,"publicDescVersion":1715539557000,"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+European+Regional+Contest+2000\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Mid-Central European Regional Contest 2000 \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":13041,"title":"Get The Treasury","oj":"HDU","probNum":"3642","num":"Q","publicDescId":3163429887004287,"publicDescVersion":1715720608000,"properties":[{"title":"Time limit","content":"5000 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\u003d2010+Asia+Regional+Hangzhou+Site+%A1%AA%A1%AA+Online+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 Asia Regional Hangzhou Site —— Online 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]},{"pid":19937,"title":"Can you answer these queries III","oj":"SPOJ","probNum":"GSS3","num":"R","publicDescId":3108863829711281,"publicDescVersion":1716087219000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"1572864 kB","spoiler":false},{"title":"Code length Limit","content":"\u003cspan style\u003d\u0027color:red\u0027\u003e5000 B\u003c/span\u003e","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"own problem","spoiler":true},{"title":"Author","content":"Bin Jin","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)","50":"VB.net (mono 4.7)","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)","54":"Perl (perl 2018.12)","11":"C (gcc 8.3)","99":"Python (PyPy 2.7.13)","12":"Brainf**k (bff 1.0.6)","56":"Node.js (node 11.12.0)","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)","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)","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)","33":"Scheme (guile 2.2.4)","34":"C99 (gcc 8.3)","35":"JavaScript (rhino 1.7.9)","36":"Erlang (erl 21.3.8)","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":10341,"title":"Stars in Your Window","oj":"POJ","probNum":"2482","num":"S","publicDescId":3159451158271796,"publicDescVersion":1715944633000,"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\u003dPOJ+Contest\"\u003ePOJ Contest\u003c/a\u003e,Author:kinfkong@ZSU\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":2169180,"title":"校门外的树","oj":"Gym","probNum":"237040A","num":"T","publicDescId":2835412732518747,"publicDescVersion":1715362912000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/237040\u0027 target\u003d\u0027_blank\u0027\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":2169350,"title":"清点人数","oj":"Gym","probNum":"237040C","num":"U","publicDescId":2835420484178883,"publicDescVersion":1715207603000,"properties":[{"title":"Time limit","content":"250 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/237040\u0027 target\u003d\u0027_blank\u0027\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":2169351,"title":"简单题","oj":"Gym","probNum":"237040D","num":"V","publicDescId":2835449596774414,"publicDescVersion":1714377365000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/237040\u0027 target\u003d\u0027_blank\u0027\u003e线段树与树状数组\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","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":2169354,"title":"二维树状数组 ：单点修改，区间查询 ","oj":"Gym","probNum":"237040E","num":"W","publicDescId":2835444148053597,"publicDescVersion":1715656386000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/237040\u0027 target\u003d\u0027_blank\u0027\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":2169355,"title":"线段树 ：区间修改，区间查询","oj":"Gym","probNum":"237040F","num":"X","publicDescId":2835447021100264,"publicDescVersion":1714701663000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/237040\u0027 target\u003d\u0027_blank\u0027\u003e线段树与树状数组\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","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":2169398,"title":"维护序列","oj":"Gym","probNum":"237040G","num":"Y","publicDescId":2835441640011063,"publicDescVersion":1715253547000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/237040\u0027 target\u003d\u0027_blank\u0027\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]}],"problemsHash":"02683bb9d1f36760d32b4312c7ac08d0","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}