2019 GDUT Winter Training II (背包/基础DP/LIS/LCS/概率DP)

Begin: 1547658000000

2019 GDUT Winter Training II (背包/基础DP/LIS/LCS/概率DP)

End: 1548262800000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 2602	送快弟
B	UVA 624	CD
C	UVA 116	Unidirectional TSP
D	HDU 1114	猪钱罐
E	HDU 1059	划分
F	POJ 1742	硬币
G	HDU 1159	LCS
H	HDU 1257	最少拦截系统
I	HDU 1087	Super Jumping! Jumping! Jumping!
J	LightOJ 1248	Dice (III)
K	LightOJ 1030	Discovering Gold
L	Gym 101606F	Flipping Coins
M	CodeForces 1013E	Hills
N	UVA 323	Jury Compromise

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":279505,"title":"2019 GDUT Winter Training II (背包/基础DP/LIS/LCS/概率DP)","type":0,"openness":0,"authStatus":1,"begin":1547658000000,"end":1548262800000,"createTime":1547656866000,"started":true,"ended":true,"managerId":183464,"managerName":"2683331518","fav":false,"description":{"format":"HTML","content":""},"announcement":"\u003cp\u003e动态规划（Dynamic Programming，简称DP），通常用于求解具有某种最优性质的问题，求解步骤一般分为：1.划分阶段。2.确定状态表达方式。3.确定状态转移方程。\u003c/p\u003e\n\u003cp\u003e背包问题：具体参见《背包九讲》：\nhttps://wenku.baidu.com/view/a169fa3ca32d7375a4178057.html\n\u003c/p\u003e\nLIS:最长上升子序列   LCS:最长公共子序列\nDP学习：https://www.cnblogs.com/wuyuegb2312/p/3281264.html","problems":[{"pid":17434,"title":"送快弟","oj":"HDU","probNum":"2602","num":"A","publicDescId":2858261744622546,"publicDescVersion":1517034480000,"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+1st+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 1st “Vegetable-Birds Cup” Programming Open Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eTeddy\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":19209,"title":"CD","oj":"UVA","probNum":"624","num":"B","publicDescId":2836570210822989,"publicDescVersion":1547696483000,"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]},{"pid":18206,"title":"Unidirectional TSP","oj":"UVA","probNum":"116","num":"C","publicDescId":3154382260305646,"publicDescVersion":1714474297000,"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]},{"pid":17679,"title":"猪钱罐","oj":"HDU","probNum":"1114","num":"D","publicDescId":2856476390569904,"publicDescVersion":1515151207000,"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\u003dCentral+Europe+1999\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Central Europe 1999 \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":17678,"title":"划分","oj":"HDU","probNum":"1059","num":"E","publicDescId":2816066467323258,"publicDescVersion":1534159633000,"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\u003dMid-Central+European+Regional+Contest+1999\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Mid-Central European Regional Contest 1999 \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":15995,"title":"硬币","oj":"POJ","probNum":"1742","num":"F","publicDescId":3311635854668721,"publicDescVersion":1498438099000,"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,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":22149,"title":"LCS","oj":"HDU","probNum":"1159","num":"G","publicDescId":3343915594095301,"publicDescVersion":1478226270000,"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\u003dSoutheastern+Europe+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Southeastern Europe 2003 \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":25970,"title":"最少拦截系统","oj":"HDU","probNum":"1257","num":"H","publicDescId":3123535222321891,"publicDescVersion":1714302448000,"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%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙江工业大学第四届大学生程序设计竞赛 \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":17613,"title":"Super Jumping! Jumping! Jumping!","oj":"HDU","probNum":"1087","num":"I","publicDescId":3154918282041066,"publicDescVersion":1714249253000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"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":26958,"title":"Dice (III)","oj":"LightOJ","probNum":"1248","num":"J","publicDescId":3128318600102480,"publicDescVersion":1714791195000,"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":25907,"title":"Discovering Gold","oj":"LightOJ","probNum":"1030","num":"K","publicDescId":3122770370519022,"publicDescVersion":1714502570000,"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":1169756,"title":"Flipping Coins","oj":"Gym","probNum":"101606F","num":"L","publicDescId":2835901279976415,"publicDescVersion":1547609862000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"524288 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/101606\u0027 target\u003d\u0027_blank\u0027\u003e2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017)\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":1735645,"title":"Hills","oj":"CodeForces","probNum":"1013E","num":"M","publicDescId":2828503459056243,"publicDescVersion":1714750268000,"properties":[{"title":"Time limit","content":"1000 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/1013\"\u003eCodeforces Round 500 (Div. 2) [based on EJOI]\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/60920\" title\u003d\"Codeforces Round #500 (based on EJOI 2018) — 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":35621,"title":"Jury Compromise","oj":"UVA","probNum":"323","num":"N","publicDescId":3209919616445744,"publicDescVersion":1714669302000,"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":"83a63de1b9e9991632dcfea2faefe44a","privatePeerContestIds":[],"enableTimeMachine":false,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}