QUT学算法啦啦啦——dp，并查集等 [Cloned] [Cloned]

Begin: 1492151400000

QUT学算法啦啦啦——dp，并查集等 [Cloned] [Cloned]

End: 1496057400000

Elapsed:

Remaining:

#	Origin	Title
A	POJ 1163	数字三角形
B	POJ 1157	LITTLE SHOP OF FLOWERS
C	POJ 1189	钉子和小球
D	POJ 2063	完全背包
E	POJ 3624	01背包
F	POJ 1458	最长公共子序列
G	HDU 1069	最长下降子序列
H	POJ 1088	记忆化搜索
I	HDU 1251	trie树
J	POJ 1056	trie树
K	HDU 1213	并查集
L	POJ 1611	并查集
M	POJ 2236	并查集
N	POJ 2524	并查集
O	POJ 1182	并查集
P	HDU 1116	Play on Words
Q	POJ 2566	尺取法
R	POJ 2823	单调队列
S	POJ 2785	二分或者hash
T	POJ 1061	扩展欧几里得

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":158766,"title":"QUT学算法啦啦啦——dp，并查集等 [Cloned] [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1492151400000,"end":1496057400000,"createTime":1492150381000,"started":true,"ended":true,"managerId":59055,"managerName":"chaiwenjun000","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/146655\u0027 target\u003d\u0027_blank\u0027\u003e[NWPU][寒假作业][正常版第四组]学算法啦啦啦——dp，并查集等 [Cloned]\u003c/a\u003e]"},"announcement":"","problems":[{"pid":10754,"title":"数字三角形","oj":"POJ","probNum":"1163","num":"A","publicDescId":3158020084618969,"publicDescVersion":1715915240000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003dIOI+1994\"\u003eIOI 1994\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":17329,"title":"LITTLE SHOP OF FLOWERS","oj":"POJ","probNum":"1157","num":"B","publicDescId":3151343259258769,"publicDescVersion":1715637940000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003dIOI+1999\"\u003eIOI 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":17648,"title":"钉子和小球","oj":"POJ","probNum":"1189","num":"C","publicDescId":3155032477858983,"publicDescVersion":1715922905000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003dNoi+99\"\u003eNoi 99\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":26349,"title":"完全背包","oj":"POJ","probNum":"2063","num":"D","publicDescId":3126969163581142,"publicDescVersion":1716101298000,"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\u003dNorthwestern+Europe+2004\"\u003eNorthwestern Europe 2004\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":17547,"title":"01背包","oj":"POJ","probNum":"3624","num":"E","publicDescId":3151977794434643,"publicDescVersion":1716023772000,"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+2007+December+Silver\"\u003eUSACO 2007 December Silver\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":17083,"title":"最长公共子序列","oj":"POJ","probNum":"1458","num":"F","publicDescId":3153338328717217,"publicDescVersion":1715638700000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003dSoutheastern+Europe+2003\"\u003eSoutheastern 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":19392,"title":"最长下降子序列","oj":"HDU","probNum":"1069","num":"G","publicDescId":3106776627865565,"publicDescVersion":1716105418000,"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+1996\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e University of Ulm Local Contest 1996 \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":16378,"title":"记忆化搜索","oj":"POJ","probNum":"1088","num":"H","publicDescId":3150960638215831,"publicDescVersion":1715737969000,"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\u003dSHTSC+2002\"\u003eSHTSC 2002\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":16379,"title":"trie树","oj":"HDU","probNum":"1251","num":"I","publicDescId":3150964048920354,"publicDescVersion":1716097112000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"131070 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L\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":27215,"title":"trie树","oj":"POJ","probNum":"1056","num":"J","publicDescId":3127492156624670,"publicDescVersion":1715662357000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003dPacific+Northwest+1998\"\u003ePacific Northwest 1998\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":19354,"title":"并查集","oj":"HDU","probNum":"1213","num":"K","publicDescId":3107206738359983,"publicDescVersion":1716091911000,"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%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 杭电ACM省赛集训队选拔赛之热身赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L\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":10536,"title":"并查集","oj":"POJ","probNum":"1611","num":"L","publicDescId":3158152641717759,"publicDescVersion":1715647858000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"20000 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\u003dAsia+Kaohsiung+2003\"\u003eAsia Kaohsiung 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":11125,"title":"并查集","oj":"POJ","probNum":"2236","num":"M","publicDescId":3158569934768058,"publicDescVersion":1716089037000,"properties":[{"title":"Time limit","content":"10000 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,HQM\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":14593,"title":"并查集","oj":"POJ","probNum":"2524","num":"N","publicDescId":3165578732016699,"publicDescVersion":1715814153000,"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\u003dAlberta+Collegiate+Programming+Contest+2003.10.18\"\u003eAlberta Collegiate Programming Contest 2003.10.18\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":14789,"title":"并查集","oj":"POJ","probNum":"1182","num":"O","publicDescId":3166324600228015,"publicDescVersion":1715752688000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003dNoi+01\"\u003eNoi 01\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":18117,"title":"Play on Words","oj":"HDU","probNum":"1116","num":"P","publicDescId":3153592841629485,"publicDescVersion":1716084935000,"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\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":39361,"title":"尺取法","oj":"POJ","probNum":"2566","num":"Q","publicDescId":3219773680689802,"publicDescVersion":1716023155000,"properties":[{"title":"Time limit","content":"5000 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\u003dUlm+Local+2001\"\u003eUlm Local 2001\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":"单调队列","oj":"POJ","probNum":"2823","num":"R","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":21897,"title":"二分或者hash","oj":"POJ","probNum":"2785","num":"S","publicDescId":3112013735138157,"publicDescVersion":1715939263000,"properties":[{"title":"Time limit","content":"15000 ms","spoiler":false},{"title":"Case time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"228000 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\u003dSouthwestern+Europe+2005\"\u003eSouthwestern 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":10755,"title":"扩展欧几里得","oj":"POJ","probNum":"1061","num":"T","publicDescId":3158014367453028,"publicDescVersion":1715809499000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 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\u003d%E6%B5%99%E6%B1%9F\"\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]}],"problemsHash":"ec6f8b6d1568c7db8b6088baeb2ee3e1","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}