Finish 1998-12-21 00:00:00 UTC

cumsumshortsort

by Hakan Erdogan

Status: Passed
Results: 0.37% blank
CPU Time: 7.641
Score: 79.053
Submitted at: 1998-12-18 17:01:03 UTC
Scored at: 2000-03-16 16:51:51 UTC

Current Rank: 1st
Based on: CutSortShort5 (diff)

Comments
Please login or create a profile.
Code
function indexList = binpack(songList,mediaLength)
[s,t] = sort(songList);
a = size(s,2);
b = min(a,round(4*a*mediaLength/sum(s)));
c = 85+0.09*a;
%[d,e] = sort(rand(b,c));
[d,e] = sort(rand(b,c/4));
c=4*size(e,2);
e = [e flipud(e) e([2:b 1],:) e([3:b 1 2],:)];
q = 0.25*(a-b);
if q > 1
   r = floor(q*rand(1,c));
   e = e+r(ones(1,b),:);
end
f = cumsum(s(e));
g = sum(f<=mediaLength);
[d,h] = max(f(g+(0:b:b*c-b)));
indexList = t(e(1:g(h),h));
leftOff = t(e(g(h)+1:end,h));
remTime = mediaLength-d;
onez1 = ones(1,g(h));
onez2 = ones(b-g(h),1);
newFree = remTime + songList(onez2,indexList) - songList(onez1,leftOff)';
newFree(newFree<0) = 9e9;
[m,i] = min(newFree);
[m,j] = min(m);
if m<remTime
aux = indexList(j);
indexList(j) = leftOff(i(j));
leftOff(i(j)) = aux;
newFree = m+songList(onez2,indexList)-songList(onez1,leftOff)';
newFree(newFree<0) = 9e9;
[m1,i] = min(newFree);
[m1,j] = min(m1);
if m1<m
aux = indexList(j);
indexList(j) = leftOff(i(j));
leftOff(i(j)) = aux;
newFree = m1+songList(onez2,indexList)-songList(onez1,leftOff)';
newFree(newFree<0) = 9e9;
[m2,i] = min(newFree);
[m2,j] = min(m2);
if m2<m1
indexList(j) = leftOff(i(j));
end
end
end