HLJU@树状数组专题

Begin: 1406427600000

End: 1411611600000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 2352	Stars
B	POJ 3067	Japan
C	POJ 1195	Mobile phones
D	HDU 1166	敌兵布阵
E	POJ 2481	Cows
F	POJ 2155	Matrix
G	HDU 1556	Color the ball
H	HDU 2299	Largest Triangle
I	POJ 1990	MooFest
J	HDU 1559	最大子矩阵
K	POJ 2309	BST
L	HDU 2852	KiKi's K-Number
M	UVA 11610	Reverse Prime

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":51241,"title":"HLJU@树状数组专题","type":0,"openness":0,"authStatus":1,"begin":1406427600000,"end":1411611600000,"createTime":0,"started":true,"ended":true,"managerId":34803,"managerName":"20132708","fav":false,"description":{"format":"HTML","content":"F题是楼教主出的题~~欢迎AC"},"announcement":"大家好好A题，晚上出去看《后会无期》~~","problems":[{"pid":14610,"title":"Stars","oj":"POJ","probNum":"2352","num":"A","publicDescId":3165605198560369,"publicDescVersion":1715663041000,"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":10487,"title":"Japan","oj":"POJ","probNum":"3067","num":"B","publicDescId":3159684772995575,"publicDescVersion":1715524145000,"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\u003dSoutheastern+Europe+2006\"\u003eSoutheastern Europe 2006\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":1715241902000,"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":16216,"title":"敌兵布阵","oj":"HDU","probNum":"1166","num":"D","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":10588,"title":"Cows","oj":"POJ","probNum":"2481","num":"E","publicDescId":3158293447015585,"publicDescVersion":1715256249000,"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+Contest\"\u003ePOJ Contest\u003c/a\u003e,Author:Mathematica@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":10491,"title":"Matrix","oj":"POJ","probNum":"2155","num":"F","publicDescId":3159682801300561,"publicDescVersion":1715735019000,"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":27239,"title":"Color the ball","oj":"HDU","probNum":"1556","num":"G","publicDescId":3127043774878806,"publicDescVersion":1715518114000,"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\u003dHDU+2006-12+Programming+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2006-12 Programming Contest  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e8600\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":40961,"title":"Largest Triangle","oj":"HDU","probNum":"2299","num":"H","publicDescId":3224803365976601,"publicDescVersion":1715788163000,"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\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":10489,"title":"MooFest","oj":"POJ","probNum":"1990","num":"I","publicDescId":3159679660088834,"publicDescVersion":1715228178000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"30000 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+2004+U+S+Open\"\u003eUSACO 2004 U S Open\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":31460,"title":"最大子矩阵","oj":"HDU","probNum":"1559","num":"J","publicDescId":3211640131745880,"publicDescVersion":1715533510000,"properties":[{"title":"Time limit","content":"10000 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\u003dHDU+2006-12+Programming+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2006-12 Programming Contest  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elwg\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":17417,"title":"BST","oj":"POJ","probNum":"2309","num":"K","publicDescId":3152177163876192,"publicDescVersion":1715243535000,"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+Monthly\"\u003ePOJ Monthly\u003c/a\u003e,Minkerui\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\u0026#39;s K-Number","oj":"HDU","probNum":"2852","num":"L","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":23947,"title":"Reverse Prime","oj":"UVA","probNum":"11610","num":"M","publicDescId":3102198438339471,"publicDescVersion":1715590309000,"properties":[{"title":"Time limit","content":"1000 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]}],"problemsHash":"b9c534891d05fb05bb193e13da483df4","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}