数据结构线段树合集 - Virtual Judge

Begin: 1518222600000

数据结构线段树合集

End: 1519660800000

Elapsed:

Remaining:

	Stat	#	Origin	Title
		A	HDU 1754	I Hate It
		B	POJ 3468	A Simple Problem with Integers
		C	OpenJ_Bailian 2452	Sticks Problem
		D	POJ 3264	Balanced Lineup
		E	POJ 3368	Frequent values
		F	HDU 2795	Billboard
		G	HDU 3071	Gcd & Lcm game
		H	HDU 3564	Another LIS
		I	HDU 2305	WorstWeather Ever
		J	OpenJ_Bailian 1769	Minimizing maximizer
		K	POJ 2886	Who Gets the Most Candies?
		L	HDU 4288	Coder
		M	CodeForces 85D	Sum of Medians
		N	OpenJ_Bailian 2481	Cows
		O	HDU 3950	Parking Log
		P	HDU 4521	小明系列问题——小明序列
		Q	HRBUST 1820	Just a Hook
		R	HRBUST 1794	敌兵布阵
		S	HDU 3016	Man Down
		T	HDU 3333	Turing Tree
		U	POJ 3225	Help with Intervals
		V	HDU 2991	Generate random numbers
		W	CodeForces 35E	Parade
		X	UVA 12436	Rip Van Winkle's Code

Status

My Status

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

{"id":212349,"title":"数据结构 线段树合集","type":1,"openness":0,"authStatus":1,"begin":1518222600000,"end":1519660800000,"createTime":1518203424000,"started":true,"ended":true,"managerId":111427,"managerName":"alexandleo","groupShortName":"nervending","groupName":"nervending的私宅","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":14797,"title":"I Hate It","oj":"HDU","probNum":"1754","num":"A","enabledDescKeys":[3166345824293859],"descBriefs":[{"key":3166345824293859,"updateDate":"2024-09-11","version":1726063192000,"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":14607,"title":"A Simple Problem with Integers","oj":"POJ","probNum":"3468","num":"B","enabledDescKeys":[3290213631743427],"descBriefs":[{"key":3290213631743427,"updateDate":"2015-08-03","version":1438536395000,"author":"qingping","avatarUrl":"https://cravatar.cn/avatar/6982d93b3b4dd75cf6721c19623e9d4e?d\u003dmonsterid","remarks":""}],"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":256462,"title":"Sticks Problem","oj":"OpenJ_Bailian","probNum":"2452","num":"C","enabledDescKeys":[3246671548447118],"descBriefs":[{"key":3246671548447118,"updateDate":"2024-09-12","version":1726104566000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"6000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"POJ Monthly,static","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":10244,"title":"Balanced Lineup","oj":"POJ","probNum":"3264","num":"D","enabledDescKeys":[3262238378370982],"descBriefs":[{"key":3262238378370982,"updateDate":"2016-08-18","version":1471512776000,"author":"fA1sEr","avatarUrl":"https://cravatar.cn/avatar/b5002678b29d7f0cabf902fc91dcffa6?d\u003dwavatar","remarks":""}],"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":10355,"title":"Frequent values","oj":"POJ","probNum":"3368","num":"E","enabledDescKeys":[3159470004040386],"descBriefs":[{"key":3159470004040386,"updateDate":"2024-09-10","version":1725953577000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"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\u003dUlm+Local+2007\"\u003eUlm Local 2007\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":11557,"title":"Billboard","oj":"HDU","probNum":"2795","num":"F","enabledDescKeys":[3332017496160396],"descBriefs":[{"key":3332017496160396,"updateDate":"2017-08-23","version":1503492900000,"author":"Purity","avatarUrl":"https://cravatar.cn/avatar/62d767efc9aa85030124cac6453238a6?d\u003dretro","remarks":"                                                                        \n                    \n                    \n                    "}],"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":41194,"title":"Gcd \u0026amp; Lcm game","oj":"HDU","probNum":"3071","num":"G","enabledDescKeys":[3227201472880236],"descBriefs":[{"key":3227201472880236,"updateDate":"2024-09-12","version":1726110190000,"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":"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+17+-+Host+by+NUDT\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 17 - Host by NUDT \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":11614,"title":"Another LIS","oj":"HDU","probNum":"3564","num":"H","enabledDescKeys":[3162088130772845],"descBriefs":[{"key":3162088130772845,"updateDate":"2024-09-14","version":1726299049000,"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":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A813%A3%A9%A1%AA%A1%AAHost+by+UESTC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（13）——Host by UESTC \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003estandy\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":40967,"title":"WorstWeather Ever","oj":"HDU","probNum":"2305","num":"I","enabledDescKeys":[3224822220066855],"descBriefs":[{"key":3224822220066855,"updateDate":"2024-09-12","version":1726112111000,"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\u003dNCPC2005\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e NCPC2005 \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":1214230,"title":"Minimizing maximizer","oj":"OpenJ_Bailian","probNum":"1769","num":"J","enabledDescKeys":[2851719778478323],"descBriefs":[{"key":2851719778478323,"updateDate":"2024-09-12","version":1726109705000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"Central Europe 2003","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":10269,"title":"Who Gets the Most Candies?","oj":"POJ","probNum":"2886","num":"K","enabledDescKeys":[2865944264503503],"descBriefs":[{"key":2865944264503503,"updateDate":"2017-11-11","version":1510373877000,"author":"heu2016061130","avatarUrl":"https://cravatar.cn/avatar/2e7e2e11d1719074a112ed415e66c1ed?d\u003dretro","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--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":32087,"title":"Coder","oj":"HDU","probNum":"4288","num":"L","enabledDescKeys":[3213706460772701],"descBriefs":[{"key":3213706460772701,"updateDate":"2024-09-16","version":1726466200000,"author":"0","remarks":"Initialization."}],"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\u003d2012+ACM%2FICPC+Asia+Regional+Chengdu+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 ACM/ICPC Asia Regional Chengdu 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":20284,"title":"Sum of Medians","oj":"CodeForces","probNum":"85D","num":"M","enabledDescKeys":[3107522461819276],"descBriefs":[{"key":3107522461819276,"updateDate":"2024-09-10","version":1725945721000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Input file","content":"\u003cspan style\u003d\u0027color:red\u0027\u003e stdin\u003c/span\u003e","spoiler":false},{"title":"Output file","content":"\u003cspan style\u003d\u0027color:red\u0027\u003e stdout\u003c/span\u003e","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/85\"\u003eYandex.Algorithm 2011: Round 1\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    binary search\r\n\n\r\n    brute force\r\n\n\r\n    data structures\r\n\n\r\n    implementation\r\n\n\r\n    *2300\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/2008\" title\u003d\"Yandex.Algorithm 2011 - Round1\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/2020\" title\u003d\"Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е \u0026quot;Сторожевые башни\u0026quot;)\" target\u003d\"_blank\"\u003eTutorial #1 \u003cspan class\u003d\"resource-locale\"\u003e(ru)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/2021\" title\u003d\"Yandex.Algorithm 2011 - Round 1. Problem C. 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","91":"GNU G++23 14.2 (64 bit, msys2)","70":"PyPy 3.10 (7.3.15, 64bit)","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.22.2","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":379039,"title":"Cows","oj":"OpenJ_Bailian","probNum":"2481","num":"N","enabledDescKeys":[3268276918708705],"descBriefs":[{"key":3268276918708705,"updateDate":"2024-09-14","version":1726287267000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"POJ Contest,Author:Mathematica@ZSU","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":22338,"title":"Parking Log","oj":"HDU","probNum":"3950","num":"O","enabledDescKeys":[3097340389150793],"descBriefs":[{"key":3097340389150793,"updateDate":"2024-09-13","version":1726171419000,"author":"0","remarks":"Initialization."}],"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+11+-+Host+by+UESTC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2011 Multi-University Training Contest 11 - Host by UESTC \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":37618,"title":"小明系列问题——小明序列","oj":"HDU","probNum":"4521","num":"P","enabledDescKeys":[3233976495600730],"descBriefs":[{"key":3233976495600730,"updateDate":"2024-09-12","version":1726074698000,"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":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%CB%C4%B3%A1%A3%A83%D4%C224%C8%D5%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013腾讯编程马拉松初赛第四场（3月24日） \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":990336,"title":"Just a Hook","oj":"HRBUST","probNum":"1820","num":"Q","enabledDescKeys":[3331050916087078],"descBriefs":[{"key":3331050916087078,"updateDate":"2022-01-09","version":1641718058000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"2008 “Sunline Cup” National Invitational Contest","spoiler":true}],"weight":1,"submitTips":"HRBUST is down.","submitMethods":[false,false,false]},{"pid":602937,"title":"敌兵布阵","oj":"HRBUST","probNum":"1794","num":"R","enabledDescKeys":[3374310130283326],"descBriefs":[{"key":3374310130283326,"updateDate":"2022-01-08","version":1641608598000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"Source HDU","spoiler":true}],"weight":1,"submitTips":"HRBUST is down.","submitMethods":[false,false,false]},{"pid":17590,"title":"Man Down","oj":"HDU","probNum":"3016","num":"S","enabledDescKeys":[3154843986491995],"descBriefs":[{"key":3154843986491995,"updateDate":"2024-09-14","version":1726255319000,"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":"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+12+-+Host+by+FZU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 12 - 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":15630,"title":"Turing Tree","oj":"HDU","probNum":"3333","num":"T","enabledDescKeys":[3164471443514470],"descBriefs":[{"key":3164471443514470,"updateDate":"2024-09-12","version":1726116940000,"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\u003dHDOJ+Monthly+Contest+%A8C+2010.03.06\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.03.06 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e3xian@GDUT\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":"U","enabledDescKeys":[2864390758373228],"descBriefs":[{"key":2864390758373228,"updateDate":"2017-10-13","version":1507871139000,"author":"jinmingyi1998","avatarUrl":"https://cravatar.cn/avatar/0e0f1aa80b63a86a2a8b5e6069a6f832?d\u003didenticon","remarks":"Initialization."}],"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":21970,"title":"Generate random numbers","oj":"HDU","probNum":"2991","num":"V","enabledDescKeys":[3111703445227489],"descBriefs":[{"key":3111703445227489,"updateDate":"2024-09-15","version":1726347696000,"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":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2009%2F2010+Ulm+Local+Contest++\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009/2010 Ulm Local 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":21624,"title":"Parade","oj":"CodeForces","probNum":"35E","num":"W","enabledDescKeys":[3112916843204116],"descBriefs":[{"key":3112916843204116,"updateDate":"2024-09-15","version":1726332978000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Input file","content":"\u003cspan style\u003d\u0027color:red\u0027\u003e input.txt\u003c/span\u003e","spoiler":false},{"title":"Output file","content":"\u003cspan style\u003d\u0027color:red\u0027\u003e output.txt\u003c/span\u003e","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/35\"\u003eCodeforces Beta Round 35 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    sortings\r\n\n\r\n    *2100\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/764\" title\u003d\"Codeforces Beta Round #35 (Div. 2) and Codeforces Beta Round #36\" target\u003d\"_blank\"\u003eAnnouncement\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","91":"GNU G++23 14.2 (64 bit, msys2)","70":"PyPy 3.10 (7.3.15, 64bit)","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.22.2","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":26646,"title":"Rip Van Winkle\u0027s Code","oj":"UVA","probNum":"12436","num":"X","enabledDescKeys":[3125688883014840],"descBriefs":[{"key":3125688883014840,"updateDate":"2024-09-12","version":1726088054000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 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":"b3a9ced01f9f1a54d724d8401a37dd22","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}