暑期训练 Week1：线段树基础

Begin: 1498732200000

暑期训练 Week1：线段树基础

End: 1503916200000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1166	敌兵布阵
B	HDU 1754	I Hate It
C	HDU 1394	Minimum Inversion Number
D	HDU 2795	Billboard
E	POJ 2828	Buy Tickets
F	POJ 2886	Who Gets the Most Candies?
G	HDU 1698	Just a Hook
H	POJ 3468	A Simple Problem with Integers
I	POJ 2528	Mayor's posters
J	POJ 3225	Help with Intervals
K	POJ 1436	Horizontally Visible Segments
L	POJ 2991	Crane
M	POJ 3667	Hotel
N	HDU 3308	LCIS
O	HDU 3397	Sequence operation
P	HDU 2871	Memory Control
Q	HDU 1540	Tunnel Warfare
R	CodeForces 46D	Parking Lot
S	HDU 1542	Atlantis
T	HDU 1828	Picture
U	HDU 3265	Posters
V	HDU 3642	Get The Treasury
W	HDU 3255	Farming
X	POJ 2482	Stars in Your Window
Y	POJ 2464	Brownie Points II
Z	HDU 3954	Level up

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":168554,"title":"暑期训练 Week1：线段树基础","type":0,"openness":0,"authStatus":1,"begin":1498732200000,"end":1503916200000,"createTime":1498731893000,"started":true,"ended":true,"managerId":70776,"managerName":"oxx1108","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/162149\u0027 target\u003d\u0027_blank\u0027\u003e线段树专题训练\u003c/a\u003e]"},"announcement":"","problems":[{"pid":16216,"title":"敌兵布阵","oj":"HDU","probNum":"1166","num":"A","publicDescId":3150570514286242,"publicDescVersion":1713433438000,"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":1713147933000,"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":15764,"title":"Minimum Inversion Number","oj":"HDU","probNum":"1394","num":"C","publicDescId":3165331117869830,"publicDescVersion":1712912713000,"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\u003dZOJ+Monthly%2C+January+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e ZOJ Monthly, January 2003 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eCHEN, Gaoli\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":11557,"title":"Billboard","oj":"HDU","probNum":"2795","num":"D","publicDescId":3161953247891068,"publicDescVersion":1712872554000,"properties":[{"title":"Time limit","content":"8000 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\u003dHDOJ+2009+Summer+Exercise%A3%A85%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ 2009 Summer Exercise（5） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003ehhanger@zju\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":10345,"title":"Buy Tickets","oj":"POJ","probNum":"2828","num":"E","publicDescId":3159454031301955,"publicDescVersion":1713184966000,"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.05.28\"\u003ePOJ Monthly--2006.05.28\u003c/a\u003e, Zhu, Zeyuan\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":10269,"title":"Who Gets the Most Candies?","oj":"POJ","probNum":"2886","num":"F","publicDescId":3159884671458773,"publicDescVersion":1713023209000,"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--2006.07.30\"\u003ePOJ Monthly--2006.07.30\u003c/a\u003e, Sempr\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":"G","publicDescId":3165336834773755,"publicDescVersion":1713429797000,"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":14607,"title":"A Simple Problem with Integers","oj":"POJ","probNum":"3468","num":"H","publicDescId":3165613021115208,"publicDescVersion":1713359593000,"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":"I","publicDescId":3165607572384151,"publicDescVersion":1713054718000,"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":10350,"title":"Help with Intervals","oj":"POJ","probNum":"3225","num":"J","publicDescId":3159477695775197,"publicDescVersion":1713146426000,"properties":[{"title":"Time limit","content":"6000 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\u003dPKU+Local+2007+%28POJ+Monthly--2007.04.28%29\"\u003ePKU Local 2007 (POJ Monthly--2007.04.28)\u003c/a\u003e, frkstyc\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":10338,"title":"Horizontally Visible Segments","oj":"POJ","probNum":"1436","num":"K","publicDescId":3159461719900250,"publicDescVersion":1713261130000,"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\u003dCentral+Europe+2001\"\u003eCentral Europe 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":14613,"title":"Crane","oj":"POJ","probNum":"2991","num":"L","publicDescId":3165599750036156,"publicDescVersion":1713065916000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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\u003dCTU+Open+2005\"\u003eCTU Open 2005\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":10354,"title":"Hotel","oj":"POJ","probNum":"3667","num":"M","publicDescId":3159475116954807,"publicDescVersion":1712948390000,"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\u003dUSACO+2008+February+Gold\"\u003eUSACO 2008 February Gold\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":18578,"title":"LCIS","oj":"HDU","probNum":"3308","num":"N","publicDescId":3157773423273324,"publicDescVersion":1712929667000,"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\u003dHDOJ+Monthly+Contest+%A8C+2010.02.06+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.02.06  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eshǎ崽\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":14689,"title":"Sequence operation","oj":"HDU","probNum":"3397","num":"O","publicDescId":3165711249643906,"publicDescVersion":1713497531000,"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\u003dHDOJ+Monthly+Contest+%A8C+2010.05.01\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.05.01 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elxhgww\u0026amp;\u0026amp;shǎ崽\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":15767,"title":"Memory Control","oj":"HDU","probNum":"2871","num":"P","publicDescId":3165334259605845,"publicDescVersion":1713454421000,"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+7+-+Host+by+FZU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 7 - 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":14794,"title":"Tunnel Warfare","oj":"HDU","probNum":"1540","num":"Q","publicDescId":3166322629648137,"publicDescVersion":1713473669000,"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":23137,"title":"Parking Lot","oj":"CodeForces","probNum":"46D","num":"R","publicDescId":3099890203109283,"publicDescVersion":1713239202000,"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/46\"\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    implementation\r\n\n\r\n    *1800\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/912\" title\u003d\"School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/916\" title\u003d\"School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules). Tasks B, D, E tutorial.\" target\u003d\"_blank\"\u003eTutorial #1\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/917\" title\u003d\"School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules): A, C, F and G tutorial\" target\u003d\"_blank\"\u003eTutorial #2\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]},{"pid":14795,"title":"Atlantis","oj":"HDU","probNum":"1542","num":"S","publicDescId":3166351540925780,"publicDescVersion":1713499360000,"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":14800,"title":"Picture","oj":"HDU","probNum":"1828","num":"T","publicDescId":3166338068520072,"publicDescVersion":1713461648000,"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\u003dIOI+1998\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e IOI 1998 \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":10769,"title":"Posters","oj":"HDU","probNum":"3265","num":"U","publicDescId":3158041241704282,"publicDescVersion":1713473943000,"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+Asia+Ningbo+Regional+Contest+Hosted+by+NIT+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Asia Ningbo Regional Contest Hosted by NIT  \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":"V","publicDescId":3163429887004287,"publicDescVersion":1713461014000,"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":19080,"title":"Farming","oj":"HDU","probNum":"3255","num":"W","publicDescId":3106526547593705,"publicDescVersion":1713278047000,"properties":[{"title":"Time limit","content":"6000 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\u003d2009+Asia+Regional+Ningbo+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Asia Regional Ningbo 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":10341,"title":"Stars in Your Window","oj":"POJ","probNum":"2482","num":"X","publicDescId":3159451158271796,"publicDescVersion":1713360090000,"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":10340,"title":"Brownie Points II","oj":"POJ","probNum":"2464","num":"Y","publicDescId":3159456539885289,"publicDescVersion":1713462976000,"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\u003dWaterloo+local+2005.06.11\"\u003eWaterloo local 2005.06.11\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":22396,"title":"Level up","oj":"HDU","probNum":"3954","num":"Z","publicDescId":3097473502369232,"publicDescVersion":1713473935000,"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+Alibaba+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Alibaba Programming Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eNotOnlySuccess\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":"95fd4e6642e4523bd7f5043c4edeb1a0","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}