SDTBU-ACM集训队暑假训练 -- 线段树树状数组

Begin: 1627823100000

SDTBU-ACM集训队暑假训练 -- 线段树树状数组

End: 1628147100000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1166	敌兵布阵
B	POJ 2182	Lost Cows
C	POJ 2528	Mayor's posters
D	HDU 1698	Just a Hook
E	HDU 1754	I Hate It
F	POJ 2299	Ultra-QuickSort
G	POJ 2828	Buy Tickets
H	POJ 2352	Stars
I	POJ 3468	A Simple Problem with Integers

Status

My Status

Translate

PDF

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

{"id":450704,"title":" SDTBU-ACM集训队暑假训练 -- 线段树 树状数组","type":0,"openness":1,"authStatus":1,"begin":1627823100000,"end":1628147100000,"createTime":1627822970000,"started":true,"ended":true,"managerId":369915,"managerName":"2019214174","fav":false,"description":{"format":"MD","content":""},"announcement":"- 所有题目线段树和树状数组都可以解决 但是希望两种方式都实现一下\n树状数组在处理一些问题上是优于线段树","problems":[{"pid":16216,"title":"敌兵布阵","oj":"HDU","probNum":"1166","num":"A","enabledDescKeys":[3150570514286242],"descBriefs":[{"key":3150570514286242,"updateDate":"2024-06-28","version":1719579065000,"author":"0","remarks":"Initialization."}],"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":14606,"title":"Lost Cows","oj":"POJ","probNum":"2182","num":"B","enabledDescKeys":[3165610080965949],"descBriefs":[{"key":3165610080965949,"updateDate":"2024-06-28","version":1719565294000,"author":"0","remarks":"Initialization."}],"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\u003dUSACO+2003+U+S+Open+Orange\"\u003eUSACO 2003 U S Open Orange\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":14608,"title":"Mayor\u0027s posters","oj":"POJ","probNum":"2528","num":"C","enabledDescKeys":[3165607572384151],"descBriefs":[{"key":3165607572384151,"updateDate":"2024-06-26","version":1719389875000,"author":"0","remarks":"Initialization."}],"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":"D","enabledDescKeys":[3165336834773755],"descBriefs":[{"key":3165336834773755,"updateDate":"2024-06-29","version":1719610811000,"author":"0","remarks":"Initialization."}],"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":14797,"title":"I Hate It","oj":"HDU","probNum":"1754","num":"E","enabledDescKeys":[3166345824293859],"descBriefs":[{"key":3166345824293859,"updateDate":"2024-06-30","version":1719728863000,"author":"0","remarks":"Initialization."}],"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":15025,"title":"Ultra-QuickSort","oj":"POJ","probNum":"2299","num":"F","enabledDescKeys":[3166053879901773],"descBriefs":[{"key":3166053879901773,"updateDate":"2024-06-27","version":1719465730000,"author":"0","remarks":"Initialization."}],"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":10345,"title":"Buy Tickets","oj":"POJ","probNum":"2828","num":"G","enabledDescKeys":[3159454031301955],"descBriefs":[{"key":3159454031301955,"updateDate":"2024-06-28","version":1719570881000,"author":"0","remarks":"Initialization."}],"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":14610,"title":"Stars","oj":"POJ","probNum":"2352","num":"H","enabledDescKeys":[3165605198560369],"descBriefs":[{"key":3165605198560369,"updateDate":"2024-06-29","version":1719627973000,"author":"0","remarks":"Initialization."}],"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":14607,"title":"A Simple Problem with Integers","oj":"POJ","probNum":"3468","num":"I","enabledDescKeys":[3165613021115208],"descBriefs":[{"key":3165613021115208,"updateDate":"2024-06-30","version":1719725487000,"author":"0","remarks":"Initialization."}],"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]}],"problemsHash":"e25844cdd46bb7f9418ba14c63bec276","privatePeerContestIds":[],"enableTimeMachine":false,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

SDTBU-ACM集训队暑假训练 -- 线段树 树状数组

SDTBU-ACM集训队暑假训练 -- 线段树树状数组