台州学院maximum cow 训练树形DP

Begin: 1529371800000

台州学院maximum cow 训练树形DP

End: 1530235800000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1520	Anniversary party
B	HDU 2196	Computer
C	POJ 1741	Tree
D	POJ 2152	Fire
E	POJ 3162	Walking Race
F	CodeForces 219D	Choosing Capital for Treeland
G	POJ 1155	TELE
H	POJ 1947	Rebuilding Roads
I	HDU 1011	Starship Troopers
J	HDU 1561	The more, The Better
K	ZOJ 3627	Treasure Hunt II
L	HDU 3586	Information Disturbing
M	POJ 3107	Godfather
N	POJ 3140	Contestants Division

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":235187,"title":"台州学院maximum cow 训练 树形DP","type":0,"openness":0,"authStatus":1,"begin":1529371800000,"end":1530235800000,"createTime":1529371716000,"started":true,"ended":true,"managerId":178945,"managerName":"tzc2017103","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":19758,"title":"Anniversary party","oj":"HDU","probNum":"1520","num":"A","publicDescId":3105658316156757,"publicDescVersion":1713650546000,"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\u003dUral+State+University+Internal+Contest+October%26%23039%3B2000+Students+Session\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Ural State University Internal Contest October\u00272000 Students Session \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":18067,"title":"Computer","oj":"HDU","probNum":"2196","num":"B","publicDescId":3153444422576675,"publicDescVersion":1713654234000,"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\"\u003escnu\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":17241,"title":"Tree","oj":"POJ","probNum":"1741","num":"C","publicDescId":3151595604701733,"publicDescVersion":1714062422000,"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\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":10481,"title":"Fire","oj":"POJ","probNum":"2152","num":"D","publicDescId":3159669332811892,"publicDescVersion":1713949009000,"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\u003dPOJ+Monthly\"\u003ePOJ Monthly\u003c/a\u003e,Lou Tiancheng\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":11552,"title":"Walking Race","oj":"POJ","probNum":"3162","num":"E","publicDescId":3161937338994429,"publicDescVersion":1714049408000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Case time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"131072 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+Monthly--2006.12.31\"\u003ePOJ Monthly--2006.12.31\u003c/a\u003e, flymouse\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":31641,"title":"Choosing Capital for Treeland","oj":"CodeForces","probNum":"219D","num":"F","publicDescId":3213884426580464,"publicDescVersion":1713525187000,"properties":[{"title":"Time limit","content":"3000 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/219\"\u003eCodeforces Round 135 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dfs and similar\r\n\n\r\n    dp\r\n\n\r\n    graphs\r\n\n\r\n    trees\r\n\n\r\n    *1700\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/5156\" title\u003d\"Codeforces Round #135 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/5160\" title\u003d\"User editorial for Codeforces Round #135 (Div. 2)\" target\u003d\"_blank\"\u003eTutorial #2 \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.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":16417,"title":"TELE","oj":"POJ","probNum":"1155","num":"G","publicDescId":3151098872475091,"publicDescVersion":1713498967000,"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\u003dCroatia+OI+2002+Final+Exam+-+Second+Day\"\u003eCroatia OI 2002 Final Exam - Second Day\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":11317,"title":"Rebuilding Roads","oj":"POJ","probNum":"1947","num":"H","publicDescId":3161594263661146,"publicDescVersion":1713674135000,"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\u003dUSACO+2002+February\"\u003eUSACO 2002 February\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":18063,"title":"Starship Troopers","oj":"HDU","probNum":"1011","num":"I","publicDescId":3153423199633647,"publicDescVersion":1713651348000,"properties":[{"title":"Time limit","content":"5000 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\u003dZJCPC2004\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e ZJCPC2004 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eXU, Chuan\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":18068,"title":"The more, The Better","oj":"HDU","probNum":"1561","num":"J","publicDescId":3153438638637166,"publicDescVersion":1713623649000,"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,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":30528,"title":"Treasure Hunt II","oj":"ZOJ","probNum":"3627","num":"K","publicDescId":3122287202381680,"publicDescVersion":1713588397000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"LI, Chao","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":12314,"title":"Information Disturbing","oj":"HDU","probNum":"3586","num":"L","publicDescId":3160215856708886,"publicDescVersion":1713823850000,"properties":[{"title":"Time limit","content":"3000 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%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\"\u003ealpc86\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":18069,"title":"Godfather","oj":"POJ","probNum":"3107","num":"M","publicDescId":3201029899483229,"publicDescVersion":1391327640000,"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+2005\"\u003eNortheastern Europe 2005\u003c/a\u003e, Northern 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":17374,"title":"Contestants Division","oj":"POJ","probNum":"3140","num":"N","publicDescId":3152057787566066,"publicDescVersion":1713465667000,"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\u003dShanghai+2006\"\u003eShanghai 2006\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":"ba6936a75889043dd3e423dd15e6016c","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}

台州学院maximum cow 训练 树形DP

台州学院maximum cow 训练树形DP