2-D Segment Tree

Begin: 1579771800000

End: 1580131800000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1823	Luck and Love
B	HDU 4819	Mosaic
C	UVA 11992	Fast Matrix Operations
D	POJ 2155	Matrix
E	POJ 1195	Mobile phones
F	POJ 2029	Get Many Persimmon Trees

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":353513,"title":"2-D Segment Tree","type":0,"openness":0,"authStatus":1,"begin":1579771800000,"end":1580131800000,"createTime":1579770834000,"started":true,"ended":true,"managerId":261116,"managerName":"mumei","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":14799,"title":"Luck and Love","oj":"HDU","probNum":"1823","num":"A","publicDescId":3166343718364797,"publicDescVersion":1712854494000,"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+2007+Summer+Exercise%A3%A83%A3%A9-+Hold+by+Wiskey\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ 2007 Summer Exercise（3）- Hold by Wiskey \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\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":48764,"title":"Mosaic","oj":"HDU","probNum":"4819","num":"B","publicDescId":3199234407439795,"publicDescVersion":1712834903000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"102400 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+Asia+Regional+Changchun+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 Asia Regional Changchun  \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":18697,"title":"Fast Matrix Operations","oj":"UVA","probNum":"11992","num":"C","publicDescId":3155933372327007,"publicDescVersion":1713451866000,"properties":[{"title":"Time limit","content":"5000 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]},{"pid":10491,"title":"Matrix","oj":"POJ","probNum":"2155","num":"D","publicDescId":3159682801300561,"publicDescVersion":1713136156000,"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":17086,"title":"Mobile phones","oj":"POJ","probNum":"1195","num":"E","publicDescId":3153364866940998,"publicDescVersion":1713337559000,"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":13384,"title":"Get Many Persimmon Trees","oj":"POJ","probNum":"2029","num":"F","publicDescId":3163910214593090,"publicDescVersion":1713343965000,"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\u003dJapan+2003+Domestic\"\u003eJapan 2003 Domestic\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":"f1c0ba0281c0e657d344bb1011c0adfd","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}