2019 GDUT Winter Training V ( 算法优化)

Begin: 1550116800000

2019 GDUT Winter Training V ( 算法优化)

End: 1550505600000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 2352	Stars
B	POJ 3468	A Simple Problem with Integers
C	POJ 2796	Feel Good
D	HDU 2256	Problem of Precision
E	HDU 2604	Queuing
F	POJ 2431	Expedition
G	POJ 2823	Sliding Window
H	POJ 2750	Potted Flower
I	POJ 2777	Count Color
J	LightOJ 1282	Leading and Trailing
K	HDU 4565	So Easy!
L	HDU 1506	Largest Rectangle in a Histogram

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":283317,"title":"2019 GDUT Winter Training V  ( 算法优化)","type":0,"openness":0,"authStatus":1,"begin":1550116800000,"end":1550505600000,"createTime":1550025694000,"started":true,"ended":true,"managerId":205917,"managerName":"Ready_Player_One","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/215946\u0027 target\u003d\u0027_blank\u0027\u003e算法优化专题\u003c/a\u003e]"},"announcement":"","problems":[{"pid":14610,"title":"Stars","oj":"POJ","probNum":"2352","num":"A","publicDescId":3165605198560369,"publicDescVersion":1715663041000,"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\u003dUral+Collegiate+Programming+Contest+1999\"\u003eUral Collegiate Programming 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":14607,"title":"A Simple Problem with Integers","oj":"POJ","probNum":"3468","num":"B","publicDescId":3165613021115208,"publicDescVersion":1715199129000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Case time limit","content":"2000 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--2007.11.25\"\u003ePOJ Monthly--2007.11.25\u003c/a\u003e, Yang Yi\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":27873,"title":"Feel Good","oj":"POJ","probNum":"2796","num":"C","publicDescId":3129627541997249,"publicDescVersion":1715409474000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Case time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","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\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":32559,"title":"Problem of Precision","oj":"HDU","probNum":"2256","num":"D","publicDescId":3215294235660225,"publicDescVersion":1715586204000,"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\u003dHDOJ+2008+Summer+Exercise%A3%A84%A3%A9-+Buffet+Dinner\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ 2008 Summer Exercise（4）- Buffet Dinner \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":17436,"title":"Queuing","oj":"HDU","probNum":"2604","num":"E","publicDescId":3152225462380170,"publicDescVersion":1715500001000,"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\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\"\u003eWhereIsHeroFrom\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":30470,"title":"Expedition","oj":"POJ","probNum":"2431","num":"F","publicDescId":3122130759318014,"publicDescVersion":1715596041000,"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+2005+U+S+Open+Gold\"\u003eUSACO 2005 U S Open Gold\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":16694,"title":"Sliding Window","oj":"POJ","probNum":"2823","num":"G","publicDescId":3149832335839297,"publicDescVersion":1715506445000,"properties":[{"title":"Time limit","content":"12000 ms","spoiler":false},{"title":"Case 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\u003dPOJ+Monthly--2006.04.28\"\u003ePOJ Monthly--2006.04.28\u003c/a\u003e, Ikki\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":10054,"title":"Potted Flower","oj":"POJ","probNum":"2750","num":"H","publicDescId":3158989008443135,"publicDescVersion":1715394855000,"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--2006.01.22\"\u003ePOJ Monthly--2006.01.22\u003c/a\u003e,Zeyuan Zhu\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":14609,"title":"Count Color","oj":"POJ","probNum":"2777","num":"I","publicDescId":3165602392360482,"publicDescVersion":1715386476000,"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+Monthly--2006.03.26\"\u003ePOJ Monthly--2006.03.26\u003c/a\u003e,dodo\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":26992,"title":"Leading and Trailing","oj":"LightOJ","probNum":"1282","num":"J","publicDescId":3129000868554890,"publicDescVersion":1715220263000,"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":44687,"title":"So Easy!","oj":"HDU","probNum":"4565","num":"K","publicDescId":3168561173648707,"publicDescVersion":1715042175000,"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+ACM-ICPC%B3%A4%C9%B3%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM-ICPC长沙赛区全国邀请赛——题目重现 \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":24533,"title":"Largest Rectangle in a Histogram","oj":"HDU","probNum":"1506","num":"L","publicDescId":3101491605041836,"publicDescVersion":1715481248000,"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\u003dUniversity+of+Ulm+Local+Contest+2003\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 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]}],"problemsHash":"90623c5efa9dec181cedb69d667dddaa","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}