[kuangbin]永不放弃！怒整DP！(区间) [Cloned]

Begin: 1579699800000

[kuangbin]永不放弃！怒整DP！(区间) [Cloned]

End: 1584883800000

Elapsed:

Remaining:

#	Origin	Title
A	LightOJ 1422	Halloween Costumes
B	POJ 2955	Brackets
C	CodeForces 149D	Coloring Brackets
D	POJ 1651	Multiplication Puzzle
E	HDU 4283	You Are the One
F	HDU 2476	String painter
G	HDU 3506	Monkey Party
H	HDU 4632	Palindrome subsequence

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":353439,"title":"[kuangbin]永不放弃！怒整DP！(区间) [Cloned]","type":1,"openness":0,"authStatus":1,"begin":1579699800000,"end":1584883800000,"createTime":1579698165000,"started":true,"ended":true,"managerId":281667,"managerName":"201805550815","groupShortName":"xtu-acm","groupName":"我永远喜欢智乃","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/145612\u0027 target\u003d\u0027_blank\u0027\u003e[kuangbin]永不放弃！怒整DP！(区间)\u003c/a\u003e]"},"announcement":"","problems":[{"pid":27130,"title":"Halloween Costumes","oj":"LightOJ","probNum":"1422","num":"A","publicDescId":3128876133352972,"publicDescVersion":1713097210000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":23652,"title":"Brackets","oj":"POJ","probNum":"2955","num":"B","publicDescId":3098492875423646,"publicDescVersion":1713515590000,"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\u003dStanford+Local+2004\"\u003eStanford Local 2004\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":26367,"title":"Coloring Brackets","oj":"CodeForces","probNum":"149D","num":"C","publicDescId":2883324370675519,"publicDescVersion":1523102636000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/149\"\u003eCodeforces Round 106 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/3859\" title\u003d\"Codeforces Round #106 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/3864\" title\u003d\"Codeforces Round #106 (Div. 2) Tutorial\" target\u003d\"_blank\"\u003eTutorial #1\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","70":"PyPy 3.9.10 (7.3.9, 64bit)","50":"GNU G++14 6.4.0","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.19.5","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":21493,"title":"Multiplication Puzzle","oj":"POJ","probNum":"1651","num":"D","publicDescId":3113081517166373,"publicDescVersion":1713187136000,"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\u003dNortheastern+Europe+2001\"\u003eNortheastern Europe 2001\u003c/a\u003e, Far-Eastern Subregion\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":31865,"title":"You Are the One","oj":"HDU","probNum":"4283","num":"E","publicDescId":3214651814722621,"publicDescVersion":1713436003000,"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\u003d2012+ACM%2FICPC+Asia+Regional+Tianjin+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 ACM/ICPC Asia Regional Tianjin 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":13415,"title":"String painter","oj":"HDU","probNum":"2476","num":"F","publicDescId":3163953056199227,"publicDescVersion":1713473923000,"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+Asia+Regional+Chengdu\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008 Asia Regional Chengdu \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":10719,"title":"Monkey Party","oj":"HDU","probNum":"3506","num":"G","publicDescId":3157931923039917,"publicDescVersion":1713460506000,"properties":[{"title":"Time limit","content":"2000 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\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A87%A3%A9%A1%AA%A1%AAHost+by+HIT+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（7）——Host by HIT  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003ePerfectCai\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":45822,"title":"Palindrome subsequence","oj":"HDU","probNum":"4632","num":"H","publicDescId":3172611789875679,"publicDescVersion":1712865478000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65535 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+4\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 Multi-University Training Contest 4 \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":"6d7dc39cffb48dc4f53fcb9c2bd475b5","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}