2018 Multi-University Training Contest 3 [Cloned]

Begin: 1581224400000

2018 Multi-University Training Contest 3 [Cloned]

End: 1581242400000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 6319	Problem A. Ascending Rating
B	HDU 6320	Problem B. Cut The String
C	HDU 6321	Problem C. Dynamic Graph Matching
D	HDU 6322	Problem D. Euler Function
E	HDU 6323	Problem E. Find The Submatrix
F	HDU 6324	Problem F. Grab The Tree
G	HDU 6325	Problem G. Interstellar Travel
H	HDU 6326	Problem H. Monster Hunter
I	HDU 6327	Problem I. Random Sequence
J	HDU 6328	Problem J. Rectangle Radar Scanner
K	HDU 6329	Problem K. Transport Construction
L	HDU 6330	Problem L. Visual Cube
M	HDU 6331	Problem M. Walking Plan

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":356207,"title":"2018 Multi-University Training Contest 3 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1581224400000,"end":1581242400000,"createTime":1581217046000,"started":true,"ended":true,"managerId":191912,"managerName":"maxdumbledore","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/242707\u0027 target\u003d\u0027_blank\u0027\u003e2018 Multi-University Training Contest 3\u003c/a\u003e]"},"announcement":"","problems":[{"pid":1734323,"title":"Problem A. Ascending Rating","oj":"HDU","probNum":"6319","num":"A","publicDescId":2828878120490048,"publicDescVersion":1713623904000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734324,"title":"Problem B. Cut The String","oj":"HDU","probNum":"6320","num":"B","publicDescId":2828872940728975,"publicDescVersion":1713681392000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734351,"title":"Problem C. Dynamic Graph Matching","oj":"HDU","probNum":"6321","num":"C","publicDescId":2828904657666409,"publicDescVersion":1713941134000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734352,"title":"Problem D. Euler Function","oj":"HDU","probNum":"6322","num":"D","publicDescId":2828899477651380,"publicDescVersion":1713956343000,"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":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734353,"title":"Problem E. Find The Submatrix","oj":"HDU","probNum":"6323","num":"E","publicDescId":2828894096364995,"publicDescVersion":1713706624000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734354,"title":"Problem F. Grab The Tree","oj":"HDU","probNum":"6324","num":"F","publicDescId":2828896969667086,"publicDescVersion":1713666452000,"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":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734355,"title":"Problem G. Interstellar Travel","oj":"HDU","probNum":"6325","num":"G","publicDescId":2828891521198173,"publicDescVersion":1713711843000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734356,"title":"Problem H. Monster Hunter","oj":"HDU","probNum":"6326","num":"H","publicDescId":2828920630396648,"publicDescVersion":1713739530000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734357,"title":"Problem I. Random Sequence","oj":"HDU","probNum":"6327","num":"I","publicDescId":2828914913509175,"publicDescVersion":1713683883000,"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":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734358,"title":"Problem J. Rectangle Radar Scanner","oj":"HDU","probNum":"6328","num":"J","publicDescId":2828918122288450,"publicDescVersion":1713711616000,"properties":[{"title":"Time limit","content":"15000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734359,"title":"Problem K. Transport Construction","oj":"HDU","probNum":"6329","num":"K","publicDescId":2828912942265233,"publicDescVersion":1714101450000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734361,"title":"Problem L. Visual Cube","oj":"HDU","probNum":"6330","num":"L","publicDescId":2828907493534172,"publicDescVersion":1713623883000,"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":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":1734364,"title":"Problem M. Walking Plan","oj":"HDU","probNum":"6331","num":"M","publicDescId":2828936069269099,"publicDescVersion":1713544803000,"properties":[{"title":"Time limit","content":"2500 ms","spoiler":false},{"title":"Mem limit","content":"524288 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\u003d2018+Multi-University+Training+Contest+3\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2018 Multi-University Training Contest 3 \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":"d7b222e96678f12ed1ee259e4cca9f94","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}