3、动态规划练习1（数位、树状、状压） [Cloned] - Virtual Judge

Begin: 1662118200000

3、动态规划练习1（数位、树状、状压） [Cloned]

End: 1665358200000

Elapsed:

Remaining:

	Stat	#	Origin	Title
		A	洛谷 P4127	同类分布
		B	HDU 3709	Balanced Number
		C	HDU 4507	吉哥系列故事――恨7不成妻
		D	CodeForces 55D	Beautiful numbers
		E	CodeChef FAVNUM	Favourite Numbers
		F	HDU 1561	The more, The Better
		G	HDU 5593	ZYB's Tree
		H	POJ 2486	Apple Tree
		I	CodeForces 960E	Alternating Tree
		J	HDU 4628	Pieces
		K	HDU 6149	Valley Numer II
		L	洛谷 P2831	愤怒的小鸟
		M	洛谷 P3959	宝藏

Status

My Status

Select a statement for participants:

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

{"id":513260,"title":"3、动态规划练习1（数位、树状、状压） [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1662118200000,"end":1665358200000,"createTime":1662117676000,"started":true,"ended":true,"managerId":283874,"managerName":"song8448","fav":false,"description":{"format":"MD","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/502064\u0027 target\u003d\u0027_blank\u0027\u003e3、动态规划练习1（数位、树状、状压）\u003c/a\u003e]"},"announcement":"","problems":[{"pid":4049783,"title":"同类分布","oj":"洛谷","probNum":"P4127","num":"A","publicDescId":2533802509514416,"publicDescVersion":1715559382000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"AHOI2009","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/3182\u0027 target\u003d\u0027_blank\u0027\u003eCreated_equal1\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"动态规划,dp; 搜索; 递推; 2009; 各省省选; 安徽; 枚举; 数位 dp","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":18510,"title":"Balanced Number","oj":"HDU","probNum":"3709","num":"B","publicDescId":3156931159044981,"publicDescVersion":1715545944000,"properties":[{"title":"Time limit","content":"5000 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\u003d2010+Asia+Chengdu+Regional+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 Asia Chengdu Regional Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eGAO, Yuan\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":37527,"title":"吉哥系列故事――恨7不成妻","oj":"HDU","probNum":"4507","num":"C","publicDescId":3230924722879468,"publicDescVersion":1715500706000,"properties":[{"title":"Time limit","content":"500 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,"submitMethods":[true,true,true]},{"pid":20357,"title":"Beautiful numbers","oj":"CodeForces","probNum":"55D","num":"D","publicDescId":3107681843336764,"publicDescVersion":1715429968000,"properties":[{"title":"Time limit","content":"4000 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/55\"\u003eCodeforces Beta Round 51\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    number theory\r\n\n\r\n    *2500\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/1107\" title\u003d\"Codeforces Beta Round #51\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e","spoiler":true}],"weight":1,"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":110780,"title":"Favourite Numbers","oj":"CodeChef","probNum":"FAVNUM","num":"E","publicDescId":3273170160631300,"publicDescVersion":1715443829000,"properties":[{"title":"Time limit","content":"500 ms","spoiler":false},{"title":"Code length Limit","content":"50000 B","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"sergey_adm","spoiler":true},{"title":"Author","content":"sergey_adm","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\u0027\u0027 target\u003d\u0027_blank\u0027\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"languages":{"44":"C++14 (gcc 11.1.0)","11":"C (gcc 6.3)","56":"JavaScript (node 17.0.1)","114":"Go (go 1.17.2)","27":"C# (gmcs 6.12)","116":"Python3 (python  3.9.5)","29":"PHP (php 8.0.12)","109":"PyPy 3 (PyPy 3.6.9)","63":"C++17 (gcc 11.1.0)","10":"Java (HotSpot 17.0.1)"},"submitMethods":[true,true,true]},{"pid":18068,"title":"The more, The Better","oj":"HDU","probNum":"1561","num":"F","publicDescId":3153438638637166,"publicDescVersion":1715513406000,"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\u003dHDU+2006-12+Programming+Contest+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2006-12 Programming Contest  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e8600\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":291304,"title":"ZYB\u0027s Tree","oj":"HDU","probNum":"5593","num":"G","publicDescId":3253165314797096,"publicDescVersion":1715981653000,"properties":[{"title":"Time limit","content":"1500 ms","spoiler":false},{"title":"Mem limit","content":"131072 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+%2365\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #65 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":18071,"title":"Apple Tree","oj":"POJ","probNum":"2486","num":"H","publicDescId":3153465579523351,"publicDescVersion":1715826074000,"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\u003dPOJ+Contest\"\u003ePOJ Contest\u003c/a\u003e,Author:magicpig@ZSU\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":1476681,"title":"Alternating Tree","oj":"CodeForces","probNum":"960E","num":"I","publicDescId":2883072231940331,"publicDescVersion":1715485158000,"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/960\"\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    combinatorics\r\n\n\r\n    dfs and similar\r\n\n\r\n    divide and conquer\r\n\n\r\n    dp\r\n\n\r\n    probabilities\r\n\n\r\n    trees\r\n\n\r\n    *2300\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/58802\" title\u003d\"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"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":45784,"title":"Pieces","oj":"HDU","probNum":"4628","num":"J","publicDescId":3172497585144418,"publicDescVersion":1715496823000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"131072 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+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 Multi-University Training Contest 3 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eWJMZBMR\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":1021889,"title":"Valley Numer II","oj":"HDU","probNum":"6149","num":"K","publicDescId":3332872704312154,"publicDescVersion":1715349047000,"properties":[{"title":"Time limit","content":"6000 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\u003d2017%B0%D9%B6%C8%D6%AE%D0%C7%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC+-+%B8%B4%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2017百度之星程序设计大赛 - 复赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4039040,"title":"愤怒的小鸟","oj":"洛谷","probNum":"P2831","num":"L","publicDescId":2572602967211879,"publicDescVersion":1715969212000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"NOIP2016 提高组","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/19\u0027 target\u003d\u0027_blank\u0027\u003eCCF_NOI\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"搜索; 2016; NOIp 提高组; 状态压缩","spoiler":true},{"title":"Difficulty","content":"提高+/省选−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":4048184,"title":"宝藏","oj":"洛谷","probNum":"P3959","num":"M","publicDescId":2548578571259327,"publicDescVersion":1715422541000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"NOIP2017 提高组","spoiler":true},{"title":"Author","content":"\u003ca href\u003d\u0027https://www.luogu.com.cn/user/19\u0027 target\u003d\u0027_blank\u0027\u003eCCF_NOI\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"贪心; 2017; NOIp 提高组; 枚举; 状态压缩","spoiler":true},{"title":"Difficulty","content":"省选/NOI−","spoiler":true}],"weight":1,"submitMethods":[false,true,true]}],"problemsHash":"078cd5ad4369e38d52b026e56360bf2f","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}