SCUACM2022集训前训练-动态规划 - Virtual Judge

Begin: 1649835780000

SCUACM2022集训前训练-动态规划

End: 1653958620000

Elapsed:

Remaining:

	Stat	#	Origin	Title
		A	OpenJ_Bailian 2760	数字三角形
		B	51Nod 1006	最长公共子序列Lcs
		C	LibreOJ 10147	石子合并
		D	LibreOJ 10148	能量项链
		E	计蒜客 T2146	拦截导弹
		F	计蒜客 T2129	采药
		G	51Nod 2649	完全背包
		H	HDU 1712	ACboy needs your help
		I	计蒜客 T1880	最长公共子序列
		J	LibreOJ 10158	加分二叉树
		K	黑暗爆炸 1026	windy数
		L	51Nod 2605	没有上司的舞会
		M	黑暗爆炸 3143	游走
		N	CodeForces 708C	Centroids
		O	UVA 11762	Race to 1
		P	HDU 3591	The trouble of Xiaoqian
		Q	SPOJ MTELE	Tele Broadcast
		R	黑暗爆炸 4318	OSU!
		S	LibreOJ 10182	理想的正方形
		T	POJ 1742	Coins
		U	UVA 11021	Tribles
		V	LibreOJ 10154	选课
		W	UVA 11181	Probability\|Given
		X	POJ 3585	Accumulation Degree
		Y	黑暗爆炸 1499	瑰丽华尔兹
		Z	LibreOJ 10173	炮兵阵地
		AA	LibreOJ 2124	树上染色
		AB	黑暗爆炸 1833	count 数字计数
		AC	CodeForces 559C	Gerald and Giant Chess
		AD	SCU 3968	Mowing the Lawn
		AE	POJ 1821	Fence
		AF	洛谷 P1064	金明的预算方案
		AG	LibreOJ 2153	互不侵犯
		AH	Kattis beetle	Beetle
		AI	CodeForces 165E	Compatible Numbers
		AJ	LibreOJ 2056	序列
		AK	LibreOJ 10188	玩具装箱
		AL	LibreOJ 2318	宝藏

Status

My Status

Select a statement for participants:

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

{"id":488877,"title":"SCUACM2022集训前训练-动态规划","type":0,"openness":0,"authStatus":1,"begin":1649835780000,"end":1653958620000,"createTime":1649663034000,"started":true,"ended":true,"managerId":630953,"managerName":"scuacm2022","fav":false,"description":{"format":"MD","content":"\u003cdiv style\u003d\"align: center\"\u003e\n\u003cimg src\u003d\"https://s3.bmp.ovh/imgs/2022/04/16/dc3f7b12ac6c5cb0.jpg\"/\u003e\n\u003c/div\u003e"},"announcement":"","problems":[{"pid":315190,"title":"数字三角形","oj":"OpenJ_Bailian","probNum":"2760","num":"A","publicDescId":3240125274125082,"publicDescVersion":1715259373000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"翻译自 IOI 1994 的试题","spoiler":true}],"weight":1,"submitMethods":[true,false,false]},{"pid":729098,"title":"最长公共子序列Lcs","oj":"51Nod","probNum":"1006","num":"B","publicDescId":3367696975068498,"publicDescVersion":1715413975000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"李陶冶","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":3203606,"title":"石子合并","oj":"LibreOJ","probNum":"10147","num":"C","publicDescId":2891406733990931,"publicDescVersion":1715520324000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.1 例 1","spoiler":true},{"title":"Tags","content":"区间 DP","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3204020,"title":"能量项链","oj":"LibreOJ","probNum":"10148","num":"D","publicDescId":2889795433402863,"publicDescVersion":1715322581000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.1 例 2","spoiler":true},{"title":"Tags","content":"区间 DP; 早于 2010; NOIP","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3530271,"title":"拦截导弹","oj":"计蒜客","probNum":"T2146","num":"E","publicDescId":3021923750530652,"publicDescVersion":1715223728000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"[NOIP1999] ","spoiler":true}],"weight":1,"languages":{"c++":"c++","python":"python","c":"c","java":"java"},"submitMethods":[false,true,true]},{"pid":3197501,"title":"采药","oj":"计蒜客","probNum":"T2129","num":"F","publicDescId":2891592701988551,"publicDescVersion":1715335218000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Input file","content":"\u003cspan style\u003d\u0027color:red\u0027\u003emedic.in\u003c/span\u003e","spoiler":false},{"title":"Output file","content":"\u003cspan style\u003d\u0027color:red\u0027\u003emedic.out\u003c/span\u003e","spoiler":false},{"title":"Source","content":"[NOIP普及组 2005] ","spoiler":true}],"weight":1,"languages":{"c++":"c++","python":"python","c":"c","java":"java"},"submitMethods":[false,true,true]},{"pid":3021715,"title":"完全背包","oj":"51Nod","probNum":"2649","num":"G","publicDescId":2899838850803250,"publicDescVersion":1715433769000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"Zollinline","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":17676,"title":"ACboy needs your help","oj":"HDU","probNum":"1712","num":"H","publicDescId":3154570355387603,"publicDescVersion":1715523058000,"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\u003dHDU+2007-Spring+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2007-Spring Programming Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":2983370,"title":"最长公共子序列","oj":"计蒜客","probNum":"T1880","num":"I","publicDescId":2894625662866405,"publicDescVersion":1715730706000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false}],"weight":1,"languages":{"c++":"c++","python":"python","c":"c","java":"java","go":"go"},"submitMethods":[false,true,true]},{"pid":3297378,"title":"加分二叉树","oj":"LibreOJ","probNum":"10158","num":"J","publicDescId":2912595545372088,"publicDescVersion":1715239436000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.2 练习 1","spoiler":true},{"title":"Tags","content":"树形 DP; 早于 2010; NOIP","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3844823,"title":"windy数","oj":"黑暗爆炸","probNum":"1026","num":"K","publicDescId":2971795650234788,"publicDescVersion":1715335170000,"properties":[{"title":"Source","content":"SCOI2009","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":3547488,"title":"没有上司的舞会","oj":"51Nod","probNum":"2605","num":"L","publicDescId":3025140079167275,"publicDescVersion":1715479919000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"lajiyuan","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":3837851,"title":"游走","oj":"黑暗爆炸","probNum":"3143","num":"M","publicDescId":2972748956500767,"publicDescVersion":1715456993000,"properties":[{"title":"Source","content":"Hnoi2013 非官方数据","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":476614,"title":"Centroids","oj":"CodeForces","probNum":"708C","num":"N","publicDescId":3352626515926809,"publicDescVersion":1715452256000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/708\"\u003eAIM Tech Round 3 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    data structures\r\n\n\r\n    dfs and similar\r\n\n\r\n    dp\r\n\n\r\n    graphs\r\n\n\r\n    greedy\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/46720\" title\u003d\"Announcement\" target\u003d\"_blank\"\u003eAnnouncement \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":20869,"title":"Race to 1","oj":"UVA","probNum":"11762","num":"O","publicDescId":3111378837006303,"publicDescVersion":1715886936000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitMethods":[true,false,false]},{"pid":12319,"title":"The trouble of Xiaoqian","oj":"HDU","probNum":"3591","num":"P","publicDescId":3160206062772889,"publicDescVersion":1715511565000,"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%A815%A3%A9%A1%AA%A1%AAHost+by+NUDT\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（15）——Host by NUDT \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003ealpc97\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4058093,"title":"Tele Broadcast","oj":"SPOJ","probNum":"MTELE","num":"Q","publicDescId":2650757769492800,"publicDescVersion":1715239440000,"properties":[{"title":"Time limit","content":"100 ms","spoiler":false},{"title":"Mem limit","content":"1572864 kB","spoiler":false},{"title":"Code length Limit","content":"50000 B","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"COI 02","spoiler":true},{"title":"Author","content":"psetter","spoiler":true}],"weight":1,"languages":{"44":"C++14 (gcc 8.3)","45":"Assembler 32 (gcc 8.3)","46":"Sed (sed 4.7)","47":"Kotlin (kotlin 1.3.21)","48":"Dart (dart 2.3.0)","110":"BC (bc 1.07.1)","111":"Clojure (clojure 1.10.0)","112":"JavaScript (SMonkey 60.2.3)","114":"Go (go 1.12.1)","115":"Unlambda (unlambda 0.1.4.2)","116":"Python 3 (python 3.9.5)","117":"R (R 3.5.2)","118":"Cobol (gnucobol 2.2.0)","91":"CoffeeScript (coffee 2.4.1)","92":"Fantom (fantom 1.0.72)","93":"Rust (rust 1.56)","94":"Pico Lisp (pico 18.12.27)","95":"Racket (racket 7.0)","96":"Elixir (elixir 1.8.2)","97":"Scheme (chicken 4.13)","98":"Gosu (gosu 1.14.9)","10":"Java (HotSpot 12)","11":"C (gcc 8.3)","99":"Python (PyPy 2.7.13)","12":"Brainf**k (bff 1.0.6)","13":"Assembler 32 (nasm 2.14)","14":"Clips (clips 6.30)","15":"Prolog (swi 7.6.4)","16":"Icon (iconc 9.5.1)","17":"Ruby (ruby 2.5.5)","18":"Scheme (stalin 0.11)","19":"Pike (pike 8.0)","121":"Groovy (groovy 2.5.6)","1":"C++ (gcc 8.3)","122":"Nim (nim 0.19.4)","2":"Pascal (gpc 20070904)","124":"F# (mono 4.1)","3":"Perl (perl 5.28.1)","4":"Python (cpython 2.7.16)","5":"Fortran (gfortran 8.3)","126":"Python 3 nbc (python 3.7.3)","127":"Octave (octave 4.4.1)","6":"Whitespace (wspace 0.3)","7":"Ada95 (gnat 8.3)","8":"Ocaml (ocamlopt 4.05.0)","9":"Intercal (ick 0.3)","62":"Text (plain text)","20":"D (gdc 8.3)","21":"Haskell (ghc 8.4.4)","22":"Pascal (fpc 3.0.4)","23":"Smalltalk (gst 3.2.5)","25":"Nice (nicec 0.9.13)","26":"Lua (luac 5.3.3)","27":"C# (gmcs 5.20.1)","28":"Bash (bash 5.0.3)","29":"PHP (php 7.3.5)","30":"Nemerle (ncc 1.2.547)","31":"Common Lisp (sbcl 1.4.16)","32":"Common Lisp (clisp 2.49.92)","33":"Scheme (guile 2.2.4)","34":"C99 (gcc 8.3)","38":"TCL (tcl 8.6)","39":"Scala (scala 2.12.8)","102":"D (dmd 2.085.0)","104":"AWK (gawk 4.2.1)","105":"AWK (mawk 1.3.3)","107":"Forth (gforth 0.7.3)","80":"Julia (julia 1.5.3)","81":"C (clang 8.0)","108":"Prolog (gprolog 1.4.5)","82":"C++14 (clang 8.0)","109":"Python 3 (PyPy 3.6.1)","83":"Objective-C (clang 8.0)","84":"D (ldc 1.12.0)","40":"SQLite (sqlite 3.27.2)","41":"C++ (g++ 4.3.2)","85":"Swift (swift 4.2.2)","42":"Assembler 64 (nasm 2.14)","86":"C# (NET 6.0)","43":"Objective-C (gcc 8.3)"},"submitMethods":[true,true,false]},{"pid":3822817,"title":"OSU!","oj":"黑暗爆炸","probNum":"4318","num":"R","publicDescId":2969445829330701,"publicDescVersion":1715421493000,"properties":[],"weight":1,"submitMethods":[true,true,false]},{"pid":3183610,"title":"理想的正方形","oj":"LibreOJ","probNum":"10182","num":"S","publicDescId":2887999673514693,"publicDescVersion":1715100891000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.5 练习 3","spoiler":true},{"title":"Tags","content":"单调队列; HAOI; 早于 2010","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":15995,"title":"Coins","oj":"POJ","probNum":"1742","num":"T","publicDescId":3165052440976333,"publicDescVersion":1715540323000,"properties":[{"title":"Time limit","content":"3000 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\u003dLouTiancheng%40POJ\"\u003eLouTiancheng@POJ\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":33059,"title":"Tribles","oj":"UVA","probNum":"11021","num":"U","publicDescId":3218515901856307,"publicDescVersion":1715735027000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitMethods":[true,false,false]},{"pid":3182467,"title":"选课","oj":"LibreOJ","probNum":"10154","num":"V","publicDescId":2887903882000254,"publicDescVersion":1715345468000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.2 例 2","spoiler":true},{"title":"Tags","content":"树形 DP; 背包 DP; CTSC / CTS; 早于 2010","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":18546,"title":"Probability|Given","oj":"UVA","probNum":"11181","num":"W","publicDescId":3157605747935828,"publicDescVersion":1715753207000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitMethods":[true,false,false]},{"pid":14362,"title":"Accumulation Degree","oj":"POJ","probNum":"3585","num":"X","publicDescId":3165897679282567,"publicDescVersion":1715321067000,"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\u003dSouth+Central+China+2008+hosted+by+NUDT\"\u003eSouth Central China 2008 hosted by NUDT\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3838520,"title":"瑰丽华尔兹","oj":"黑暗爆炸","probNum":"1499","num":"Y","publicDescId":2971237923384923,"publicDescVersion":1715113925000,"properties":[{"title":"Source","content":"NOI2005","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":3190161,"title":"炮兵阵地","oj":"LibreOJ","probNum":"10173","num":"Z","publicDescId":2891141348402780,"publicDescVersion":1715415162000,"properties":[{"title":"Time limit","content":"200 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.4 练习 2","spoiler":true},{"title":"Tags","content":"DP; 状态压缩; NOI; 早于 2010","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3302569,"title":"树上染色","oj":"LibreOJ","probNum":"2124","num":"AA","publicDescId":2650781165522394,"publicDescVersion":1649698471000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"HAOI2015","spoiler":true},{"title":"Tags","content":"2015; 树形 DP; HAOI; 复杂度分析","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4013082,"title":"count 数字计数","oj":"黑暗爆炸","probNum":"1833","num":"AB","publicDescId":2984440632375307,"publicDescVersion":1715748217000,"properties":[{"title":"Source","content":"ZJOI2010 Day1","spoiler":true}],"weight":1,"submitMethods":[true,true,false]},{"pid":191315,"title":"Gerald and Giant Chess","oj":"CodeForces","probNum":"559C","num":"AC","publicDescId":3304769867308709,"publicDescVersion":1715926488000,"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/559\"\u003eCodeforces Round 313 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    combinatorics\r\n\n\r\n    dp\r\n\n\r\n    math\r\n\n\r\n    number theory\r\n\n\r\n    *2200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/19478\" title\u003d\"VK Cup 2015: online mirror and final thanks\" target\u003d\"_blank\"\u003eAnnouncement #2 \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/19237\" title\u003d\"Codeforces Round 313 — Extended editoral\" target\u003d\"_blank\"\u003eTutorial\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":53646,"title":"Mowing the Lawn","oj":"SCU","probNum":"3968","num":"AD","publicDescId":3284895515614735,"publicDescVersion":1672297628000,"properties":[{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"SCU is down.","submitMethods":[false,false,false]},{"pid":10478,"title":"Fence","oj":"POJ","probNum":"1821","num":"AE","publicDescId":3159637011557786,"publicDescVersion":1715444055000,"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\u003dRomania+OI+2002\"\u003eRomania OI 2002\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":4030060,"title":"金明的预算方案","oj":"洛谷","probNum":"P1064","num":"AF","publicDescId":3054015042396259,"publicDescVersion":1715599966000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"134144 kB","spoiler":false},{"title":"Source","content":"NOIP2006 提高组","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":"动态规划,dp; 2006; NOIp 提高组; 背包","spoiler":true},{"title":"Difficulty","content":"普及+/提高","spoiler":true}],"weight":1,"submitMethods":[false,true,true]},{"pid":3190157,"title":"互不侵犯","oj":"LibreOJ","probNum":"2153","num":"AG","publicDescId":2891117952963522,"publicDescVersion":1715239411000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"SCOI2005","spoiler":true},{"title":"Tags","content":"DP; 状态压缩; SCOI; 早于 2010","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":2376954,"title":"Beetle","oj":"Kattis","probNum":"beetle","num":"AH","publicDescId":2935069783506588,"publicDescVersion":1715239426000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"1048576 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\"https://open.kattis.com/problem-sources/Baltic%20Olympiad%20in%20Informatics%202009%2C%20Day%201\"\u003eBaltic Olympiad in Informatics 2009, Day 1\u003c/a\u003e","spoiler":true},{"title":"License","content":"\u003ca rel\u003d\"license\" href\u003d\"https://creativecommons.org/licenses/by-sa/3.0/\" style\u003d\"vertical-align: middle;\"\u003e\u003cimg class\u003d\"problem-license\" alt\u003d\"Creative Commons License (cc by-sa)\" src\u003d\"CDN_BASE_URL/9f210cdd030c90615fab37b8125d28ab?v\u003d1715239424\"\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitMethods":[false,true,false]},{"pid":27347,"title":"Compatible Numbers","oj":"CodeForces","probNum":"165E","num":"AI","publicDescId":3127936026731873,"publicDescVersion":1715405553000,"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/165\"\u003eCodeforces Round 112 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    bitmasks\r\n\n\r\n    brute force\r\n\n\r\n    dfs and similar\r\n\n\r\n    dp\r\n\n\r\n    *2200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/4120\" title\u003d\"Codeforces Round #112 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/4124\" title\u003d\"Codeforces Round #112 (Div. 2) Tutorial\" target\u003d\"_blank\"\u003eTutorial\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":3486304,"title":"序列","oj":"LibreOJ","probNum":"2056","num":"AJ","publicDescId":3018086196198735,"publicDescVersion":1715239407000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"TJOI / HEOI2016","spoiler":true},{"title":"Tags","content":"树套树; CDQ 分治; DP; 2016; TJOI; HEOI","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3229283,"title":"玩具装箱","oj":"LibreOJ","probNum":"10188","num":"AK","publicDescId":2892892077879217,"publicDescVersion":1715586701000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"Source","content":"一本通 5.6 练习 1","spoiler":true},{"title":"Tags","content":"DP; HNOI; 斜率优化; 早于 2010","spoiler":true}],"weight":1,"submitMethods":[true,true,true]},{"pid":3140985,"title":"宝藏","oj":"LibreOJ","probNum":"2318","num":"AL","publicDescId":2885176484472645,"publicDescVersion":1715380538000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"NOIP2017","spoiler":true},{"title":"Tags","content":"DP; 状态压缩; 2017; NOIP","spoiler":true}],"weight":1,"submitMethods":[true,true,true]}],"problemsHash":"b2d18afe1307f46839d710648e625900","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}