【两个月刷题计划】专题七线段树

Begin: 1581134400000

【两个月刷题计划】专题七线段树

End: 1586318400000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1166	敌兵布阵
B	HDU 1754	I Hate It
C	POJ 3468	A Simple Problem with Integers
D	POJ 2528	Mayor's posters
E	HDU 1698	Just a Hook
F	ZOJ 1610	Count the Colors
G	POJ 3264	Balanced Lineup
H	HDU 4027	Can you answer these queries?
I	HDU 1540	Tunnel Warfare
J	HDU 3974	Assign the task
K	HDU 4578	Transformation
L	HDU 4614	Vases and Flowers
M	HDU 4553	约会安排
N	POJ 1177	Picture
O	HDU 1255	覆盖的面积
P	HDU 1542	Atlantis
Q	HDU 3642	Get The Treasury

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":356002,"title":"【两个月刷题计划】专题七 线段树","type":0,"openness":0,"authStatus":1,"begin":1581134400000,"end":1586318400000,"createTime":1581125950000,"started":true,"ended":true,"managerId":270775,"managerName":"yangchaoyi","fav":false,"description":{"format":"MD","content":"学如逆水行舟，不进则退"},"announcement":"博客地址：https://blog.csdn.net/weixin_42429718\n\n欢迎一起来做题！","problems":[{"pid":16216,"title":"敌兵布阵","oj":"HDU","probNum":"1166","num":"A","publicDescId":3150570514286242,"publicDescVersion":1714547029000,"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":1714249507000,"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":14607,"title":"A Simple Problem with Integers","oj":"POJ","probNum":"3468","num":"C","publicDescId":3165613021115208,"publicDescVersion":1714594089000,"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":"D","publicDescId":3165607572384151,"publicDescVersion":1714309729000,"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":"E","publicDescId":3165336834773755,"publicDescVersion":1714414651000,"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":"F","publicDescId":3161931890796296,"publicDescVersion":1714468556000,"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":"G","publicDescId":3159823042551374,"publicDescVersion":1714345809000,"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":"H","publicDescId":3099770572498070,"publicDescVersion":1714232986000,"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":"I","publicDescId":3166322629648137,"publicDescVersion":1714265193000,"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":"J","publicDescId":3096641887518509,"publicDescVersion":1714242338000,"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":"K","publicDescId":3171310427402556,"publicDescVersion":1714259133000,"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":"L","publicDescId":3169796943142699,"publicDescVersion":1714242086000,"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":"M","publicDescId":3235849241006698,"publicDescVersion":1714296089000,"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":10496,"title":"Picture","oj":"POJ","probNum":"1177","num":"N","publicDescId":3159677084471964,"publicDescVersion":1714541835000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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+1998\"\u003eIOI 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":15768,"title":"覆盖的面积","oj":"HDU","probNum":"1255","num":"O","publicDescId":3165329146699744,"publicDescVersion":1714258594000,"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":1714249224000,"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":1714334283000,"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]}],"problemsHash":"85e1096562a7f8a372ca9e87a173f638","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

【两个月刷题计划】专题七 线段树

【两个月刷题计划】专题七线段树