CHD萌新练习9--动态规划与记忆化搜索

Begin: 1480575600000

CHD萌新练习9--动态规划与记忆化搜索

End: 1481180400000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 2084	数塔
B	CodeForces 429B	Working out
C	HDU 1231	最大连续子序列
D	POJ 2533	Longest Ordered Subsequence
E	POJ 3624	Charm Bracelet
F	HDU 1203	I NEED A OFFER!
G	HDU 2955	Robberies
H	HDU 2191	悼念512汶川大地震遇难同胞――珍惜现在，感恩生活
I	HDU 4508	湫湫系列故事――减肥记I
J	POJ 1088	滑雪
K	UVA 10118	Free Candies
L	HDU 5602	Black Jack

Status

My Status

Translate

PDF

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

{"id":143393,"title":"CHD萌新练习9--动态规划与记忆化搜索","type":0,"openness":0,"authStatus":1,"begin":1480575600000,"end":1481180400000,"createTime":0,"started":true,"ended":true,"managerId":87293,"managerName":"chdacm","fav":false,"description":{"format":"HTML","content":"HINT:JKL为记忆化搜索"},"announcement":"An AC a day keeps the WAs away.","problems":[{"pid":23620,"title":"数塔","oj":"HDU","probNum":"2084","num":"A","enabledDescKeys":[3098947544305651],"descBriefs":[{"key":3098947544305651,"updateDate":"2024-06-21","version":1718981474000,"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\u003d2006%2F1%2F15+ACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2006/1/15 ACM程序设计期末考试 \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":51070,"title":"Working out","oj":"CodeForces","probNum":"429B","num":"B","enabledDescKeys":[3189715846077621],"descBriefs":[{"key":3189715846077621,"updateDate":"2024-06-27","version":1719423576000,"author":"0","remarks":"Initialization."}],"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/429\"\u003eCodeforces Round 245 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    *1600\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/12254\" title\u003d\"Announcement\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/12265\" title\u003d\"Codeforces Round #245 — Editorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\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.10 (7.3.15, 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.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":17322,"title":"最大连续子序列","oj":"HDU","probNum":"1231","num":"C","enabledDescKeys":[3151329790983092],"descBriefs":[{"key":3151329790983092,"updateDate":"2024-06-24","version":1719226786000,"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\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2005%C4%EA\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙大计算机研究生复试上机考试-2005年 \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":15302,"title":"Longest Ordered Subsequence","oj":"POJ","probNum":"2533","num":"D","enabledDescKeys":[3164707879725883],"descBriefs":[{"key":3164707879725883,"updateDate":"2024-06-22","version":1719037261000,"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\u003dNortheastern+Europe+2002\"\u003eNortheastern Europe 2002\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":17547,"title":"Charm Bracelet","oj":"POJ","probNum":"3624","num":"E","enabledDescKeys":[3151977794434643],"descBriefs":[{"key":3151977794434643,"updateDate":"2024-06-24","version":1719194772000,"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+2007+December+Silver\"\u003eUSACO 2007 December 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":20466,"title":"I NEED A OFFER!","oj":"HDU","probNum":"1203","num":"F","enabledDescKeys":[3107451062227053],"descBriefs":[{"key":3107451062227053,"updateDate":"2024-06-23","version":1719133435000,"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\u003dGardon-DYGG+Contest+2\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Gardon-DYGG Contest 2 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eSpeakless\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":17681,"title":"Robberies","oj":"HDU","probNum":"2955","num":"G","enabledDescKeys":[3154586332179538],"descBriefs":[{"key":3154586332179538,"updateDate":"2024-06-22","version":1719012316000,"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\u003dIDI+Open+2009\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e IDI Open 2009 \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":20468,"title":"悼念512汶川大地震遇难同胞――珍惜现在，感恩生活","oj":"HDU","probNum":"2191","num":"H","enabledDescKeys":[3107474860844231],"descBriefs":[{"key":3107474860844231,"updateDate":"2024-06-26","version":1719355935000,"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\u003d2008-06-18%A1%B6+ACM%B3%CC%D0%F2%C9%E8%BC%C6%A1%B7%C6%DA%C4%A9%BF%BC%CA%D4%A1%AA%A1%AA%CB%C4%B4%A8%BC%D3%D3%CD%A3%A1%D6%D0%B9%FA%BC%D3%D3%CD%A3%A1\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008-06-18《 ACM程序设计》期末考试——四川加油！中国加油！ \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elcy\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":37528,"title":"湫湫系列故事――减肥记I","oj":"HDU","probNum":"4508","num":"I","enabledDescKeys":[3230927663026235],"descBriefs":[{"key":3230927663026235,"updateDate":"2024-06-27","version":1719423498000,"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%D2%BB%B3%A1%A3%A83%D4%C221%C8%D5%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013腾讯编程马拉松初赛第一场（3月21日） \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":16378,"title":"滑雪","oj":"POJ","probNum":"1088","num":"J","enabledDescKeys":[3150960638215831],"descBriefs":[{"key":3150960638215831,"updateDate":"2024-06-20","version":1718872445000,"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\u003dSHTSC+2002\"\u003eSHTSC 2002\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":19440,"title":"Free Candies","oj":"UVA","probNum":"10118","num":"K","enabledDescKeys":[3106930301137560],"descBriefs":[{"key":3106930301137560,"updateDate":"2024-06-26","version":1719412087000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"30000 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":300990,"title":"Black Jack","oj":"HDU","probNum":"5602","num":"L","enabledDescKeys":[3237992966387897],"descBriefs":[{"key":3237992966387897,"updateDate":"2024-06-16","version":1718544763000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dBestCoder+Round+%2367+%28div.2%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #67 (div.2) \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":"7aec0976c2d7398311680295b26b7780","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}