ID: 
Title:tweaky bird and pushy cat 21Marco Tullio 119
Author:srachFabio Carnevale
Date:2008-05-07 11:55:182008-05-07 11:56:04
Score:13374.019713419.6657
Result:133071.00 (cyc: 21, node: 7229)133827.00 (cyc: 19, node: 6532)
CPU Time:47.885135.5772
Status:PassedPassed
Code:
function W = solv(B) - tweak = rand(43,1); - W=solverF(B); - S = mygrade(B,W); - - [nr,nc] = size(B); - [W2,S2] = sunday(B,[1 2],[1 2],4*nr*nc); - if S > S2 - W = W2; - S=S2; + psqq=40617; + Qcxt = rand(43,1); + W=vQFM(B); + mF0u = I0Ef(B,W); + [ZGlW,tM5M] = size(B); + z5GL = B(ZGlW:-1:1,:); + z5GL = z5GL.'; + [IUgZ,NhZc] = A2F5(z5GL,[1 2],[1 2],4*ZGlW*tM5M); + if mF0u > NhZc + W = [ZGlW-IUgZ(:,2)+1 IUgZ(:,1) ZGlW-IUgZ(:,4)+1 IUgZ(:,3)]; + mF0u=NhZc; end - - - X = B(nr:-1:1,:); - X = X.'; - - [W2,S2] = sunday(X,[1 2],[1 2],4*nr*nc); - if S > S2 - W = [nr-W2(:,2)+1 W2(:,1) nr-W2(:,4)+1 W2(:,3)]; - S=S2; + FSfw=rand('state'); + rand(psqq,1); + if mF0u>1000 + [IUgZ,NhZc] = A2F5(z5GL,[1 2],[1 2],4*ZGlW*tM5M); + if mF0u > NhZc + W = [ZGlW-IUgZ(:,2)+1 IUgZ(:,1) ZGlW-IUgZ(:,4)+1 IUgZ(:,3)]; + mF0u=NhZc; end - end - - - function [W,S] = sunday(B0,x000,y000,th000) - [nR,nC]=size(B0); - Borig= -ones(nR+2,nC+2); - Borig(2:end-1,2:end-1)=B0; - Bedit = Borig; - - maxbridges = 4; - - if size(Bedit,2) > 18 - cutfirst = 4; - cutsecond = 8; - cutoff = 18; + rand('state',FSfw); + end + function [W,mF0u] = A2F5(SSG4,rP8f,kae3,o8Os) + [aSyo,Iigd]=size(SSG4); + p9n7= -ones(aSyo+2,Iigd+2); + p9n7(2:end-1,2:end-1)=SSG4; + Z5io = p9n7; + vDl3 = 4; + if size(Z5io,2) > 20 + DgX_ = 4; + iQ1g = 8; + nZfY = 18; else - cutfirst = 3; - cutsecond = 7; - cutoff = 13; + DgX_ = 3; + iQ1g = 7; + nZfY = 13; end - - S = inf; - X1 = [1 2;2 1]; - X2 = [1 3;3 1]; - Y = [3 2 1;1 2 3]; - - % fprintf('\n'); - - for x = x000 - if x == 2 - [U BU] = phase1(Bedit,cutfirst,X1(x,:)); - [UU BUU] = phase3(BU,U,cutsecond,X2(x,:)); - [V BX] = phase3(BUU,UU,cutoff,X2(x,:)); - else - [U BU] = phase1(Bedit,4,X1(x,:)); - [V BX] = phase3(BU,U,11,X2(x,:)); - end - - for y = y000 - % if x == 1 && y == 2, continue, end - %if x == 2 && y == 2 && S > th000, return, end - W1 = phase2_a(Bedit,BX,V,maxbridges,cutoff,Y(y,:))-1; - S1 = mygrade(B0,W1); - % fprintf('x=%d, y=%d, %d', x, y, S1); - % if isfinite(S), fprintf(' (%4d)\n', S1 - S), else, - % fprintf('\n'), end - if S1 <= S - S = S1; - W = W1; - maxbridges = maxbridges - 1; - end - end + mF0u = inf; + eC_u = [1 2;2 1]; + bzcw = [1 3;3 1]; + oFAl = [3 2 1;1 2 3]; + for kQrw = rP8f + if kQrw == 2 + [iOBh cbWI] = qi2o(Z5io,DgX_,eC_u(kQrw,:)); + [YQj_ T3hS] = OsIB(cbWI,iOBh,iQ1g,bzcw(kQrw,:)); + [Vqrs oDjQ] = OsIB(T3hS,YQj_,nZfY,bzcw(kQrw,:)); + else + [iOBh cbWI] = qi2o(Z5io,4,eC_u(kQrw,:)); + [Vqrs oDjQ] = OsIB(cbWI,iOBh,11,bzcw(kQrw,:)); end + for CfVo = kae3 + sXx8 = PikE(Z5io,oDjQ,Vqrs,vDl3,nZfY,oFAl(CfVo,:))-1; + cyx7 = I0Ef(SSG4,sXx8); + if cyx7 <= mF0u + mF0u = cyx7; + W = sXx8; + vDl3 = vDl3 - 1; end - - %% - function score = mygrade(B,W) - nR=size(B,1); - B(W(:,1)+(W(:,2)-1)*nR)=0; - B(W(:,3)+(W(:,4)-1)*nR)=0; - score=sum(B(:))+size(W,1)+sum(W(:,1)==W(:,3)&W(:,2)==W(:,4))*24; end - - %% - function [pincount k] = analyzeboard(B,rz) - - % make a sorted list of all pins - pin = sort(B(B>0),'descend'); - npins = size(pin,1); - if npins < 1 - pincount = []; - k = 0; - return end - - uniPins=pin(diff([0;pin])~=0); - % pin, count, benefit - - pincount = zeros(nnz(uniPins),3); - thesepins=histc(pin,uniPins(end:-1:1)); - pincount(:,1)=uniPins; - pincount(:,2)=thesepins(end:-1:1); - k=nnz(uniPins); - - if rz < 3, return, end - % calculate the benefit of a path - for i = 1:k - if pincount(i,2) >= 2 - p = pincount(i,1); - [row col] = find(B == p); - d = 0; - N = size(row,1); - d=sum(abs(diff(row))+abs(diff(col))); - pincount(i,3) = pincount(i,2)*p - 0.85 * d; - end end + function Uslx = I0Ef(B,W) + aSyo=size(B,1); + B(W(:,1)+(W(:,2)-1)*aSyo)=0; + B(W(:,3)+(W(:,4)-1)*aSyo)=0; + Uslx=sum(B(:))+size(W,1)+sum(W(:,1)==W(:,3)&W(:,2)==W(:,4))*24; end - - %% - function [W B] = phase1(B,cutoff,rz) - % fprintf('-- phase 1 --\n'); - + function [LVLs wqrx] = jur9(B,jfz7) + m94B = sort(B(B>0),'descend'); + et4B = size(m94B,1); + if et4B < 1 + LVLs = []; + wqrx = 0; + return + end + lDip=m94B(diff([0;m94B])~=0); + LVLs = zeros(nnz(lDip),3); + ASVG=histc(m94B,lDip(end:-1:1)); + LVLs(:,1)=lDip; + LVLs(:,2)=ASVG(end:-1:1); + wqrx=nnz(lDip); + if jfz7 < 3, return, end + for Wbee = 1:wqrx + if LVLs(Wbee,2) >= 2 + rhLK = LVLs(Wbee,1); + [U_4G Bfxz] = find(B == rhLK); + IMWN = 0; + DiOr = size(U_4G,1); + IMWN=sum(abs(diff(U_4G))+abs(diff(Bfxz))); + LVLs(Wbee,3) = LVLs(Wbee,2)*rhLK - 0.85 * IMWN; + end + end + end + function [W B] = qi2o(B,nZfY,jfz7) W = []; - - [pincount k] = analyzeboard(B,rz); - - if k < 1 - return + [LVLs wqrx] = jur9(B,jfz7); + if wqrx < 1 + return end - - pincount=sortrows(pincount,-rz); - - for i = 1:k - if pincount(i,2) >= 2 - p = pincount(i,1); - [row col] = find(B == p); - N = size(row,1); - % find all pairwise distances - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - [I J]=find(tril(ones(N),-1)); - dist(:,1)=J; - dist(:,2)=I; - dist(:,3)=abs(col(I)-col(J))+abs(row(I)-row(J)); - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect the closest pair possible - npins = 0; - for x = 1:Npairs - if dist(x,3) > cutoff+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = simplepath([row(a); row(b)], [col(a); col(b)], -p); - path = complexpath(B,[row(a); row(b)], [col(a); col(b)], -p, cutoff, 2*p); - if size(path,1) > 0 - % fprintf('p = %d, connect a=%d, b=%d, dist = %d\n', p, a, b, dist(x,3)); - % fprintf('\nFound path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row(a), col(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - - % pinlist = [row(a) col(a); row(b) col(b)]; - npins = 2; - edit = [1:(a-1) (a+1):(b-1) (b+1):N]; - row = [row(a); row(b); row(edit)]; - col = [col(a); col(b); col(edit)]; - break - else - % fprintf('p = %d, cannot connect a=%d, b=%d, dist = %d\n', p, a, b, dist(x,3)); - end - end - - if npins < 2 - continue - end - - for j = 3:N - % find all pins and wires - [row2 col2] = find(B == -p); - Npinwires = size(row2,1); - % fprintf('npins = %d, nwires = %d\n', npins, Npinwires - npins); - - % find all pairwise distances - % a = already connected (pin or wire), b = not yet connected - Npairs = Npinwires * (N - npins); - - - dist = zeros(Npairs,3); - x = 0; - for a = 1:Npinwires - for b = (npins+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row2(a)-row(b)) + abs(col2(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > cutoff+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = simplepath([row2(a); row(b)], [col2(a); col(b)], -p); - path = complexpath(B,[row2(a); row(b)], [col2(a); col(b)], -p, cutoff, p); - if size(path,1) > 0 - W = [W; path]; - - B = addwirepath(B,path,-p); - - npins = npins + 1; - connected = true; - row([j b]) = row([b j]); - col([j b]) = col([b j]); - break - end - end - - if ~connected - break - end - end - - end + LVLs=sortrows(LVLs,-jfz7); + for Wbee = 1:wqrx + if LVLs(Wbee,2) >= 2 + rhLK = LVLs(Wbee,1); + [U_4G Bfxz] = find(B == rhLK); + DiOr = size(U_4G,1); + BDjo = DiOr*(DiOr-1)/2; + dist = zeros(BDjo,3); + [pUHo EiaE]=find(tril(ones(DiOr),-1)); + dist(:,1)=EiaE; + dist(:,2)=pUHo; + dist(:,3)=abs(Bfxz(pUHo)-Bfxz(EiaE))+abs(U_4G(pUHo)-U_4G(EiaE)); + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + et4B = 0; + for kQrw = 1:BDjo + if dist(kQrw,3) > nZfY+1 + break end + PUeo = dist(kQrw,1); + Y2fY = dist(kQrw,2); + path = uIAl(B,[U_4G(PUeo); U_4G(Y2fY)], [Bfxz(PUeo); Bfxz(Y2fY)], -rhLK, nZfY, 2*rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + et4B = 2; + edit = [1:(PUeo-1) (PUeo+1):(Y2fY-1) (Y2fY+1):DiOr]; + U_4G = [U_4G(PUeo); U_4G(Y2fY); U_4G(edit)]; + Bfxz = [Bfxz(PUeo); Bfxz(Y2fY); Bfxz(edit)]; + break + else end - - %% - function [W B] = phase2(Borig,B,W,maxbridges,kappa,rz) - - function addbridgewirepath() - for w = 1:size(path,1); - if path(w,1) == path(w,3) % horizontal - BH(path(w,1),path(w,2)) = false; - BH(path(w,3),path(w,4)) = false; - if path(w,2) == path(w,4) - B(path(w,1),path(w,2)) = -9999; - end - end - if path(w,2) == path(w,4) % vertical - BV(path(w,1),path(w,2)) = false; - BV(path(w,3),path(w,4)) = false; - end end + if et4B < 2 + continue end - - % fprintf('-- phase 2 --\n'); - - [BH BV] = buildbridges(Borig,B,W); - - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - - pincount=sortrows(pincount,-rz); - - for i = 1:k - p = pincount(i,1); - - Npinwires = sum(B == -p); - - if Npinwires == 0 - % fprintf('p = %d, no previous pinwires\n', p); - - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - % find all pairwise distances - Npairs = N*(N-1)*.5; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - maxstep = min((maxbridges*25)+kappa,2*p+1); - - % try to connect the closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - path = bridgepath(B,BH,BV,[row(a); row(b)], [col(a); col(b)], -p, maxbridges, kappa, ceil(1.85*p)); - if size(path,1) > 0 - % fprintf('\nBRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row(a), col(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - addbridgewirepath(); - - connected = true; - break - end - end - if ~connected - continue - end - end - end - - [row col] = find(B == p); - Npins = size(row,1); - - maxstep = min((maxbridges*25)+kappa,p+1); - - for j = 1:Npins - [row2 col2] = find(B == -p); - Npinwires = size(row2,1); - - % find all pairwise distances - % a = already connected (pin or wire), b = not yet connected - Npairs = Npinwires * (Npins-j+1); - dist = zeros(Npairs,3); - x = 0; - for a = 1:Npinwires - for b = j:Npins - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row2(a)-row(b)) + abs(col2(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - path = bridgepath(B,BH,BV,[row2(a); row(b)], [col2(a); col(b)], -p, maxbridges, kappa, p); - if size(path,1) > 0 - % fprintf('\nEXTRA BRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row2(a), col2(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - addbridgewirepath(); - - connected = true; - - row([j b]) = row([b j]); - col([j b]) = col([b j]); - break - end - end - - if ~connected - break - end - end - + for N1pS = 3:DiOr + [zZow vKRV] = find(B == -rhLK); + JO30 = size(zZow,1); + BDjo = JO30 * (DiOr - et4B); + dist = zeros(BDjo,3); + kQrw = 0; + for PUeo = 1:JO30 + for Y2fY = (et4B+1):DiOr + kQrw = kQrw + 1; + dist(kQrw,1) = PUeo; + dist(kQrw,2) = Y2fY; + dist(kQrw,3) = abs(zZow(PUeo)-U_4G(Y2fY)) + abs(vKRV(PUeo)-Bfxz(Y2fY)); end - end - - %% - function [W B] = phase3(B,W,kappa,rz) - - - % fprintf('-- phase 3 --\n'); - - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - - pincount=sortrows(pincount,-rz); - - for i = 1:k - p = pincount(i,1); - - Npinwires = sum(B == -p); - - if Npinwires == 0 - % fprintf('p = %d, no previous pinwires\n', p); - - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - % find all pairwise distances - Npairs = N*(N-1)*.5; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - maxstep = min(kappa,2*p+1); - - % try to connect the closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = bridgepath(B,BH,BV,[row(a); row(b)], [col(a); col(b)], -p, maxbridges, kappa, 2*p); - path = complexpath(B,[row(a); row(b)], [col(a); col(b)], -p, kappa, 2*p); - if size(path,1) > 0 - % fprintf('\nBRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row(a), col(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - % [B BH BV] = addbridgewirepath(B,BH,BV,path,-p); - - connected = true; - break - end - end - if ~connected - continue - end - end - end - - [row col] = find(B == p); - Npins = size(row,1); - - maxstep = min(kappa,p+1); - - for j = 1:Npins - [row2 col2] = find(B == -p); - Npinwires = size(row2,1); - - % find all pairwise distances - % a = already connected (pin or wire), b = not yet connected - Npairs = Npinwires * (Npins-j+1); - dist = zeros(Npairs,3); - x = 0; - for a = 1:Npinwires - for b = j:Npins - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row2(a)-row(b)) + abs(col2(a)-col(b)); - end - end - % sort by distance - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - - % try to connect closest pair possible - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - % fprintf('warning: dist = %2d\n', dist(x,3)); - break - end - a = dist(x,1); - b = dist(x,2); - % path = bridgepath(B,BH,BV,[row2(a); row(b)], [col2(a); col(b)], -p, maxbridges, kappa, p); - path = complexpath(B,[row2(a); row(b)], [col2(a); col(b)], -p, kappa, 2*p); - if size(path,1) > 0 - % fprintf('\nEXTRA BRIDGE path, p = %d, r=%d c=%d, r=%d, c=%d\n', p, row2(a), col2(a), row(b), col(b)); - W = [W; path]; - - B = addwirepath(B,path,-p); - % [B BH BV] = addbridgewirepath(B,BH,BV,path,-p); - - connected = true; - row([j b]) = row([b j]); - col([j b]) = col([b j]); - break - end - end - - if ~connected - break - end - end - + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + JOTH = false(DiOr,1); + j0g6 = false; + for kQrw = 1:BDjo + if dist(kQrw,3) > nZfY+1 + break end - + Y2fY = dist(kQrw,2); + if JOTH(Y2fY) + randperm(4); + continue end - - %% - function [BH BV] = buildbridges(Borig,B,path) - [NR NC] = size(B); - BH = Borig == 0; - BV = BH; - BH(:,[1 NC]) = false; - BV([1 NR],:) = false; - for i = 1:size(path,1) - if path(i,1) == path(i,3) % horizontal - BH(path(i,1),path(i,2)) = false; - BH(path(i,3),path(i,4)) = false; - end - if path(i,2) == path(i,4) % vertical - BV(path(i,1),path(i,2)) = false; - BV(path(i,3),path(i,4)) = false; - end + PUeo = dist(kQrw,1); + path = uIAl(B,[zZow(PUeo); U_4G(Y2fY)], [vKRV(PUeo); Bfxz(Y2fY)], -rhLK, nZfY, rhLK); + JOTH(Y2fY)=true; + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + et4B = et4B + 1; + j0g6 = true; + U_4G([N1pS Y2fY]) = U_4G([Y2fY N1pS]); + Bfxz([N1pS Y2fY]) = Bfxz([Y2fY N1pS]); + break end end - - %% - function B = addwirepath(B,path,label) - B(path(1,1),path(1,2)) = label; - for i = 1:size(path,1); - B(path(i,3),path(i,4)) = label; + if ~j0g6 + break end end - - %% - function path = traceback(z,PZ,NR,t) - path = zeros(t,4); - dr = mod(z,NR); - dc = ceil(z/NR); - for j = 1:t - path(j,1:2) = [dr dc]; - z = PZ(z); - dr = mod(z,NR); - dc = ceil(z/NR); - path(j,3:4) = [dr dc]; end end - - - function path = complexpath(B,row,col,label,cutoff,maxpathlen) - - % - complexpath - - [NR NC] = size(B); - PZ = zeros(NR,NC); - C = -ones(NR,NC); - C(row(2),col(2)) = 0; % source - - % tag the targets - C(row(1),col(1)) = -2; - C( B == label ) = -2; - - znext = zeros(NR*NC,1); - znext(1) = row(2) + (col(2)-1)*NR; + end + function [W B] = OsIB(B,W,wGCf,jfz7) + [LVLs wqrx] = jur9(B,jfz7); + if wqrx < 1, return, end + LVLs=sortrows(LVLs,-jfz7); + for Wbee = 1:wqrx + rhLK = LVLs(Wbee,1); + JO30 = sum(B == -rhLK); + if JO30 == 0 + if LVLs(Wbee,2) >= 2 + [U_4G Bfxz] = find(B == rhLK); + DiOr = size(U_4G,1); + BDjo = DiOr*(DiOr-1)*.5; + dist = zeros(BDjo,3); + kQrw = 0; + for PUeo = 1:DiOr + for Y2fY = (PUeo+1):DiOr + kQrw = kQrw + 1; + dist(kQrw,1) = PUeo; + dist(kQrw,2) = Y2fY; + dist(kQrw,3) = abs(U_4G(PUeo)-U_4G(Y2fY)) + abs(Bfxz(PUeo)-Bfxz(Y2fY)); + end + end + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + maxstep = min(wGCf,2*rhLK+1); + j0g6 = false; + for kQrw = 1:BDjo + if dist(kQrw,3) > maxstep+1 + break + end + PUeo = dist(kQrw,1); + Y2fY = dist(kQrw,2); + path = uIAl(B,[U_4G(PUeo); U_4G(Y2fY)], [Bfxz(PUeo); Bfxz(Y2fY)], -rhLK, wGCf, 2*rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + j0g6 = true; + break + end + end + if ~j0g6 + continue + end + end + end + [U_4G Bfxz] = find(B == rhLK); + C5cx = size(U_4G,1); + maxstep = min(wGCf,rhLK+1); + for N1pS = 1:C5cx + [zZow vKRV] = find(B == -rhLK); + JO30 = size(zZow,1); + BDjo = JO30 * (C5cx-N1pS+1); + dist = zeros(BDjo,3); + kQrw = 0; + for PUeo = 1:JO30 + for Y2fY = N1pS:C5cx + kQrw = kQrw + 1; + dist(kQrw,1) = PUeo; + dist(kQrw,2) = Y2fY; + dist(kQrw,3) = abs(zZow(PUeo)-U_4G(Y2fY)) + abs(vKRV(PUeo)-Bfxz(Y2fY)); + end + end + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + JOTH = false(C5cx,1); + j0g6 = false; + for kQrw = 1:BDjo + if dist(kQrw,3) > maxstep+1 + break + end + Y2fY = dist(kQrw,2); + if JOTH(Y2fY) + randperm(4); + continue + end + PUeo = dist(kQrw,1); + path = uIAl(B,[zZow(PUeo); U_4G(Y2fY)], [vKRV(PUeo); Bfxz(Y2fY)], -rhLK, wGCf, 2*rhLK); + JOTH(Y2fY)=true; + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + j0g6 = true; + U_4G([N1pS Y2fY]) = U_4G([Y2fY N1pS]); + Bfxz([N1pS Y2fY]) = Bfxz([Y2fY N1pS]); + break + end + end + if ~j0g6 + break + end + end + end + end + function [UVzS x3jr] = t4TE(p9n7,B,path) + [ma8P UHnc] = size(B); + UVzS = p9n7 == 0; + x3jr = UVzS; + UVzS(:,[1 UHnc]) = false; + x3jr([1 ma8P],:) = false; + for Wbee = 1:size(path,1) + if path(Wbee,1) == path(Wbee,3) + UVzS(path(Wbee,1),path(Wbee,2)) = false; + UVzS(path(Wbee,3),path(Wbee,4)) = false; + end + if path(Wbee,2) == path(Wbee,4) + x3jr(path(Wbee,1),path(Wbee,2)) = false; + x3jr(path(Wbee,3),path(Wbee,4)) = false; + end + end + end + function B = GEkJ(B,path,JuCX) + B(path(1,1),path(1,2)) = JuCX; + for Wbee = 1:size(path,1); + B(path(Wbee,3),path(Wbee,4)) = JuCX; + end + end + function path = M7Vi(bt8q,cECH,ma8P,wb3r) + path = zeros(wb3r,4); + zxLY = mod(bt8q,ma8P); + ZbWE = ceil(bt8q/ma8P); + for N1pS = 1:wb3r + path(N1pS,1:2) = [zxLY ZbWE]; + bt8q = cECH(bt8q); + zxLY = mod(bt8q,ma8P); + ZbWE = ceil(bt8q/ma8P); + path(N1pS,3:4) = [zxLY ZbWE]; + end + end + function path = uIAl(B,U_4G,Bfxz,JuCX,nZfY,bQjT) + [ma8P UHnc] = size(B); + cECH = zeros(ma8P,UHnc); + URW0 = -ones(ma8P,UHnc); + URW0(U_4G(2),Bfxz(2)) = 0; + URW0(U_4G(1),Bfxz(1)) = -2; + URW0( B == JuCX ) = -2; + i6HE = zeros(ma8P*UHnc,1); + i6HE(1) = U_4G(2) + (Bfxz(2)-1)*ma8P; count = 1; - dZ = [-1 1 -NR NR]; - - [ign, ir] = sort(rand(1,4)); - for step = 0:min(cutoff,maxpathlen) - if count < 1, break, end - N = count; - z = znext; - count = 0; - for i = 1:N - zi = z(i); - for s=1:4 - Z = zi + dZ(ir(s)); - tag = C(Z); - if tag == -2 - PZ(Z) = zi; - path = traceback(Z,PZ,NR,step+1); - return - end - if tag == -1 && B(Z) == 0 - C(Z) = step+1; - PZ(Z) = zi; - count = count + 1; - znext(count) = Z; - end - end - end + MI2B = [-1 1 -ma8P ma8P]; + XvRd = randperm(4); + for step = 0:min(nZfY,bQjT) + if count < 1, break, end + DiOr = count; + bt8q = i6HE; + count = 0; + for Wbee = 1:DiOr + U9nT = bt8q(Wbee); + for nsnP=1:4 + z8UH = U9nT + MI2B(XvRd(nsnP)); + UZ4K = URW0(z8UH); + if UZ4K == -2 + cECH(z8UH) = U9nT; + path = M7Vi(z8UH,cECH,ma8P,step+1); + return end + if UZ4K == -1 && B(z8UH) == 0 + URW0(z8UH) = step+1; + cECH(z8UH) = U9nT; + count = count + 1; + i6HE(count) = z8UH; + end + end + end + end path = []; end - - %% - function path = bridgepath(B,BH,BV,row,col,label,maxbridges,kappa,maxpathlen) - - % - bridgepath - - % fprintf('bridgepath ...\n'); - [NR NC] = size(B); - BRIDGE = false(NR,NC); - PZ = zeros(NR,NC); - C = -ones(NR,NC); - % C(row(2),col(2)) = 0; % source - - % tag targets - C(row(1),col(1)) = -2; - C( B == label ) = -2; - - maxstep = min((maxbridges*27)+kappa,maxpathlen+1); - nextstep = zeros(maxstep+28,1); - nextstep(1) = row(2) + (col(2)-1)*NR; - dZ = [-NR NR -1 1]; - + function path = HZE7(B,UVzS,x3jr,U_4G,Bfxz,JuCX,vDl3,wGCf,bQjT) + [ma8P UHnc] = size(B); + EOE4 = false(ma8P,UHnc); + cECH = zeros(ma8P,UHnc); + URW0 = -ones(ma8P,UHnc); + URW0(U_4G(1),Bfxz(1)) = -2; + URW0( B == JuCX ) = -2; + maxstep = min((vDl3*27)+wGCf,bQjT+1); + cVsG = zeros(maxstep+28,1); + cVsG(1) = U_4G(2) + (Bfxz(2)-1)*ma8P; + MI2B = [-ma8P ma8P -1 1]; for step = 1:maxstep - while nextstep(step)>0 - zi = nextstep(step); - nextstep(step)=C(zi); - for s = 1:4 - Z = zi + dZ(s); - tag = C(Z); - if tag==-1 - if B(Z) == 0 - C(Z) = nextstep(step+1); - nextstep(step+1) = Z; - PZ(Z) = zi; - elseif (BH(Z)&&(s<3)) || (BV(Z)&&(s>2)) - C(Z) = nextstep(step+26); - nextstep(step+26) = Z; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - if tag==-2 - step=step+1; - PZ(Z) = zi; - dr=mod(Z,NR); - dc=ceil(Z/NR); - path = zeros(step,4); - j = 0; - while dr ~= row(2) || dc ~= col(2) - j = j + 1; - path(j,1:2) = [dr dc]; - Z = dr + (dc-1)*NR; - pz = PZ(Z); - pr=mod(pz,NR); - pc=ceil(pz/NR); - path(j,3:4) = [pr pc]; - dr = pr; - dc = pc; - if BRIDGE(dr,dc) - j = j + 1; - path(j,:) = [dr dc dr dc]; - end - end - path = path(1:j,:); - return - end - - end - end + while cVsG(step)>0 + U9nT = cVsG(step); + cVsG(step)=URW0(U9nT); + for nsnP = 1:4 + z8UH = U9nT + MI2B(nsnP); + UZ4K = URW0(z8UH); + if UZ4K==-1 + if B(z8UH) == 0 + URW0(z8UH) = cVsG(step+1); + cVsG(step+1) = z8UH; + cECH(z8UH) = U9nT; + elseif (UVzS(z8UH)&&(nsnP<3)) || (x3jr(z8UH)&&(nsnP>2)) + URW0(z8UH) = cVsG(step+26); + cVsG(step+26) = z8UH; + cECH(z8UH) = U9nT; + EOE4(z8UH) = true; end + end + if UZ4K==-2 + step=step+1; + cECH(z8UH) = U9nT; + zxLY=mod(z8UH,ma8P); + ZbWE=ceil(z8UH/ma8P); + path = zeros(step,4); + N1pS = 0; + while zxLY ~= U_4G(2) || ZbWE ~= Bfxz(2) + N1pS = N1pS + 1; + path(N1pS,1:2) = [zxLY ZbWE]; + z8UH = zxLY + (ZbWE-1)*ma8P; + IYqk = cECH(z8UH); + WynI=mod(IYqk,ma8P); + pzrE=ceil(IYqk/ma8P); + path(N1pS,3:4) = [WynI pzrE]; + zxLY = WynI; + ZbWE = pzrE; + if EOE4(zxLY,ZbWE) + N1pS = N1pS + 1; + path(N1pS,:) = [zxLY ZbWE zxLY ZbWE]; + end + end + path = path(1:N1pS,:); + return + end + end + end + end path = []; end - - - function W = solverF(B) - [W,S] = function1(B); - IN55LEuuYN = 0; - d2F7TC2nTS = round(mod(B(:),2)); - if S < 2100 - return + function W = vQFM(B) + [W,mF0u] = fgJL(B); + t1Sg = 0; + c9w2 = round(mod(B(:),2)); + if mF0u < 2100 + return end - [kJfcOitU9b,ZqDtJmqMeb] = size(B); + [wYLJ,TBpL] = size(B); B = flipud(fliplr(B')); - [zElIwYjTOJ,FZzcxpyenz] = function1(B); - if S > FZzcxpyenz - W = [kJfcOitU9b-zElIwYjTOJ(:,2)+1 ZqDtJmqMeb-zElIwYjTOJ(:,1)+1 kJfcOitU9b-zElIwYjTOJ(:,4)+1 ZqDtJmqMeb-zElIwYjTOJ(:,3)+1]; + [APx0,dIhC] = fgJL(B); + if mF0u > dIhC + W = [wYLJ-APx0(:,2)+1 TBpL-APx0(:,1)+1 wYLJ-APx0(:,4)+1 TBpL-APx0(:,3)+1]; end - if d2F7TC2nTS~=IN55LEuuYN; W = zeros(0,4); end + if c9w2~=t1Sg; W = zeros(0,4); end end - - function [W,S] = function1(B) - [nR,nC]=size(B); - Bpad=nan(nR+2,nC+2); - Bpad(2:end-1,2:end-1)=B; - Bedit = Bpad; - maxbridges = 4; - if size(Bedit,2) > 20 - cutfirst = 4; - cutsecond = 8; - cutoff = 12; + function [W,mF0u] = fgJL(B) + [aSyo,Iigd]=size(B); + iIuA=nan(aSyo+2,Iigd+2); + iIuA(2:end-1,2:end-1)=B; + Z5io = iIuA; + vDl3 = 4; + if size(Z5io,2) > 20 + DgX_ = 4; + iQ1g = 8; + nZfY = 12; else - cutfirst = 3; - cutsecond = 7; - cutoff = 11; + DgX_ = 3; + iQ1g = 7; + nZfY = 11; end - S = inf; - X1 = [1 2;2 1]; - X2 = [1 3;3 1]; - Y = [3 2 1;1 2 3]; - for x = 1:2 - if x == 2 - [U BU] = phase1_a(Bedit,cutfirst,X1(x,:)); - [UU BUU] = phase3a(BU,U,cutsecond,X2(x,:)); - [V BX] = phase3a(BUU,UU,cutoff,X2(x,:)); - else - [U BU] = phase1_a(Bedit,4,X1(x,:)); - [V BX] = phase3a(BU,U,11,X2(x,:)); - end - for y = 1:2 - if x == 2 && y == 2 && S > 2100, return, end - W1 = phase2_a(Bedit,BX,V,maxbridges,cutoff,Y(y,:))-1; - S1 = mygrade(B,W1); - if S1 <= S - S = S1; - W = W1; - maxbridges = maxbridges - 1; - end - end + mF0u = inf; + eC_u = [1 2;2 1]; + bzcw = [1 3;3 1]; + oFAl = [3 2 1;1 2 3]; + for kQrw = 1:2 + if kQrw == 2 + [iOBh cbWI] = Z9j_(Z5io,DgX_,eC_u(kQrw,:)); + [YQj_ T3hS] = BPUC(cbWI,iOBh,iQ1g,bzcw(kQrw,:)); + [Vqrs oDjQ] = BPUC(T3hS,YQj_,nZfY,bzcw(kQrw,:)); + else + [iOBh cbWI] = Z9j_(Z5io,4,eC_u(kQrw,:)); + [Vqrs oDjQ] = BPUC(cbWI,iOBh,11,bzcw(kQrw,:)); end - if nR*nC > 290; return; end - br = sum(W(:,1)==W(:,3)&W(:,2)==W(:,4)); - if br <= 4 - WSH = solverSHa(B); - ssh = mygrade(B,WSH); - if ssh < S - W = WSH; - S = ssh; - end + for CfVo = 1:2 + if kQrw == 2 && CfVo == 2 && mF0u > 2100, return, end + sXx8 = PikE(Z5io,oDjQ,Vqrs,vDl3,nZfY,oFAl(CfVo,:))-1; + cyx7 = I0Ef(B,sXx8); + if cyx7 <= mF0u + mF0u = cyx7; + W = sXx8; + vDl3 = vDl3 - 1; end end - - - function path = complexpath_a(B,row,col,label,cutoff,maxpathlen) - function path = traceback_a(r,c,pathLength) - pR(r,c) = zR(i); - pC(r,c) = zC(i); - path = zeros(pathLength,4); - for jjj = 1:pathLength - path(jjj,1:2) = [r c]; - preR = pR(r,c); - preC = pC(r,c); - path(jjj,3:4) = [preR preC]; - r = preR; - c = preC; end + if aSyo*Iigd > 290; return; end + x_J8 = sum(W(:,1)==W(:,3)&W(:,2)==W(:,4)); + if x_J8 <= 4 + qhBl = yM1q(B); + cYGu = I0Ef(B,qhBl); + if cYGu < mF0u + W = qhBl; + mF0u = cYGu; end - [NR NC] = size(B); - pR = zeros(NR,NC); - pC = zeros(NR,NC); - C = -ones(NR,NC); - C(row(2),col(2)) = 0; - C(row(1),col(1)) = -2; - C( B == label ) = -2; - rnext = zeros(NR*NC,1); - cnext = zeros(NR*NC,1); + end + end + function path = NY46(B,U_4G,Bfxz,JuCX,nZfY,bQjT) + function path = Ma4z(jaqu,AMXi,xi1R) + HIeZ(jaqu,AMXi) = ERAE(Wbee); + rUCa(jaqu,AMXi) = W1aD(Wbee); + path = zeros(xi1R,4); + for OV6E = 1:xi1R + path(OV6E,1:2) = [jaqu AMXi]; + xcHW = HIeZ(jaqu,AMXi); + vZbB = rUCa(jaqu,AMXi); + path(OV6E,3:4) = [xcHW vZbB]; + jaqu = xcHW; + AMXi = vZbB; + end + end + [ma8P UHnc] = size(B); + HIeZ = zeros(ma8P,UHnc); + rUCa = zeros(ma8P,UHnc); + URW0 = -ones(ma8P,UHnc); + URW0(U_4G(2),Bfxz(2)) = 0; + URW0(U_4G(1),Bfxz(1)) = -2; + URW0( B == JuCX ) = -2; + IVni = zeros(ma8P*UHnc,1); + nyuo = zeros(ma8P*UHnc,1); count = 1; - rnext(1) = row(2); - cnext(1) = col(2); - dR=[-1 1 0 0]; - dC=[0 0 -1 1]; - for step = 0:min(cutoff,maxpathlen) - if count < 1, break, end - N = count; - zR = rnext; - zC = cnext; - count = 0; - for i = 1:N - Aa2p_xqlDq = zC(i); - zi = zR(i); - for s=1:4 - r = zi + dR(s); - c = Aa2p_xqlDq + dC(s); - Z = r + (c-1)*NR; - tag = C(Z); - if tag == -2 - path = traceback_a(r,c,step+1); - return - elseif tag == -1 && B(Z) == 0 - C(Z) = step+1; - pR(Z) = zi; - pC(Z) = Aa2p_xqlDq; - count = count + 1; rnext(count) = r; cnext(count) = c; - end - end - end + IVni(1) = U_4G(2); + nyuo(1) = Bfxz(2); + J0Mg=[-1 1 0 0]; + ah92=[0 0 -1 1]; + for step = 0:min(nZfY,bQjT) + if count < 1, break, end + DiOr = count; + ERAE = IVni(1:DiOr); + W1aD = nyuo(1:DiOr); + count = 0; + for Wbee = 1:DiOr + gjUR = W1aD(Wbee); + U9nT = ERAE(Wbee); + for nsnP=1:4 + jaqu = U9nT + J0Mg(nsnP); + AMXi = gjUR + ah92(nsnP); + z8UH = jaqu + (AMXi-1)*ma8P; + UZ4K = URW0(z8UH); + if UZ4K == -2 + path = Ma4z(jaqu,AMXi,step+1); + return + elseif UZ4K == -1 && B(z8UH) == 0 + URW0(z8UH) = step+1; + HIeZ(z8UH) = U9nT; + rUCa(z8UH) = gjUR; + count = count + 1; IVni(count) = jaqu; nyuo(count) = AMXi; end + end + end + end path = []; end - - - - - function w = solverSHa(b) - p = unique(b); - p(1) = []; - n = zeros(size(p)); - for i = 1:length(n) - n(i) = nnz(p(i) == b(:)); + function d4Up = yM1q(Y2fY) + rhLK = unique(Y2fY); + rhLK(1) = []; + lYMH = zeros(size(rhLK)); + for Wbee = 1:length(lYMH) + lYMH(Wbee) = nnz(rhLK(Wbee) == Y2fY(:)); end - for i = 1:length(n) - if n(i) == 1 - b(p(i) == b(:)) = -1; - end + for Wbee = 1:length(lYMH) + if lYMH(Wbee) == 1 + Y2fY(rhLK(Wbee) == Y2fY(:)) = -1; end - g = zeros(size(b)+2); - bb = repmat(-1,size(g)); - bb(2:end-1,2:end-1) = b; - w = []; - [rr, cc] = find(bb>0); - d = (size(bb,1)/2 - rr).^2 + (size(bb,2)/2 - cc).^2; - [d, order] = sort(d); + end + yP9R = zeros(size(Y2fY)+2); + PCC7 = repmat(-1,size(yP9R)); + PCC7(2:end-1,2:end-1) = Y2fY; + d4Up = []; + [OEIK, WKVE] = find(PCC7>0); + IMWN = (size(PCC7,1)/2 - OEIK).^2 + (size(PCC7,2)/2 - WKVE).^2; + [IMWN, order] = sort(IMWN); order = order'; - for k = 1:length(rr)-1 - bestscore = 0; - minsteps = 32; - for i = order - if g(rr(i), cc(i)) - continue - end - [score, mv, steps] = findBestMove_a(bb, g, rr(i), cc(i), minsteps); - if score > bestscore - bestscore = score; - bestmove = mv; - minsteps = steps; - if minsteps == 1 - break - end - end - end - if bestscore == 0 - w = w - 1; - return - end - g = addwirepath(g, bestmove, bb(bestmove(1,1), bestmove(1,2))); - bb = addwirepath(bb, bestmove, bb(bestmove(1,1), bestmove(1,2))); - w = [w; bestmove]; + for wqrx = 1:length(OEIK)-1 + xQtt = 0; + Qi6m = 32; + for Wbee = order + if yP9R(OEIK(Wbee), WKVE(Wbee)) + continue end - w = w - 1; + [Uslx, ClXs, VjjM] = Y5PO(PCC7, yP9R, OEIK(Wbee), WKVE(Wbee), Qi6m); + if Uslx > xQtt + xQtt = Uslx; + grF_ = ClXs; + Qi6m = VjjM; + if Qi6m == 1 + break end - - - function [bestscore, bestmove, minsteps] = findBestMove_a(b, g, z, zC, tniOHnFTWS) - bestscore = 0; - bestmove = []; - jjj = [1 -1 0 0]; - k = [0 0 1 -1]; - if ~any(g(:)==b(z,zC)) - g = b; end - bb = b; - bb(bb>0) = -1; - bb(z,zC) = 1; - minsteps = Inf; - p = b(z,zC); - for i = 1:tniOHnFTWS-2 - [rr, cc] = find(bb==i); - for n = 1:length(rr) - for GEOY9vqvEy = 1:4 - Cw4BfzRNQ6 = rr(n) + jjj(GEOY9vqvEy); - qpF1lfOV53 = cc(n) + k(GEOY9vqvEy); - if g(Cw4BfzRNQ6,qpF1lfOV53) == p && ~(Cw4BfzRNQ6 == z && qpF1lfOV53 == zC) - minsteps = i; - break - end - wzyazJbPVF = bb(Cw4BfzRNQ6,qpF1lfOV53); - if wzyazJbPVF == 0 - bb(Cw4BfzRNQ6,qpF1lfOV53) = i+1; - end - end - if minsteps < Inf - break - end - end - if minsteps < Inf - break - end end - if minsteps == Inf - return + if xQtt == 0 + d4Up = d4Up - 1; + return end - bestscore = b(z,zC) - minsteps; - if minsteps == 1 - bestmove = [z, zC, Cw4BfzRNQ6, qpF1lfOV53]; - return + yP9R = GEkJ(yP9R, grF_, PCC7(grF_(1,1), grF_(1,2))); + PCC7 = GEkJ(PCC7, grF_, PCC7(grF_(1,1), grF_(1,2))); + d4Up = [d4Up; grF_]; end - bestmove = zeros(minsteps,4); - for step = minsteps:-1:1 - for GEOY9vqvEy = 1:4 - RugyNPRQTT = Cw4BfzRNQ6 + jjj(GEOY9vqvEy); - Wlfr8gQkkJ = qpF1lfOV53 + k(GEOY9vqvEy); - if bb(RugyNPRQTT, Wlfr8gQkkJ) == step - break - end - end - bestmove(step,:) = [RugyNPRQTT, Wlfr8gQkkJ, Cw4BfzRNQ6, qpF1lfOV53]; - Cw4BfzRNQ6 = RugyNPRQTT; - qpF1lfOV53 = Wlfr8gQkkJ; + d4Up = d4Up - 1; end + function [xQtt, grF_, Qi6m] = Y5PO(Y2fY, yP9R, bt8q, W1aD, IsPY) + xQtt = 0; + grF_ = []; + OV6E = [1 -1 0 0]; + wqrx = [0 0 1 -1]; + if ~any(yP9R(:)==Y2fY(bt8q,W1aD)) + yP9R = Y2fY; end - - - function [W B] = phase1_a(B,cutoff,rz) + PCC7 = Y2fY; + PCC7(PCC7>0) = -1; + PCC7(bt8q,W1aD) = 1; + Qi6m = Inf; + rhLK = Y2fY(bt8q,W1aD); + for Wbee = 1:IsPY-2 + [OEIK, WKVE] = find(PCC7==Wbee); + for lYMH = 1:length(OEIK) + for jRu5 = 1:4 + ni1M = OEIK(lYMH) + OV6E(jRu5); + Yoy5 = WKVE(lYMH) + wqrx(jRu5); + if yP9R(ni1M,Yoy5) == rhLK && ~(ni1M == bt8q && Yoy5 == W1aD) + Qi6m = Wbee; + break + end + MSZx = PCC7(ni1M,Yoy5); + if MSZx == 0 + PCC7(ni1M,Yoy5) = Wbee+1; + end + end + if Qi6m < Inf + break + end + end + if Qi6m < Inf + break + end + end + if Qi6m == Inf + return + end + xQtt = Y2fY(bt8q,W1aD) - Qi6m; + if Qi6m == 1 + grF_ = [bt8q, W1aD, ni1M, Yoy5]; + return + end + grF_ = zeros(Qi6m,4); + for step = Qi6m:-1:1 + for jRu5 = 1:4 + qd8h = ni1M + OV6E(jRu5); + X9jB = Yoy5 + wqrx(jRu5); + if PCC7(qd8h, X9jB) == step + break + end + end + grF_(step,:) = [qd8h, X9jB, ni1M, Yoy5]; + ni1M = qd8h; + Yoy5 = X9jB; + end + end + function [W B] = Z9j_(B,nZfY,jfz7) W = []; - [pincount k] = analyzeboard(B,rz); - if k < 1 - return + [LVLs wqrx] = jur9(B,jfz7); + if wqrx < 1 + return end - pincount=sortrows(pincount,-rz); - for i = 1:k - if pincount(i,2) >= 2 - p = pincount(i,1); - [row col] = find(B == p); - N = size(row,1); - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - qfUlAeE6ke = reshape(dist(:,1:2)',[],1); - npins = 0; - qYyU89IINf = 1; - OEmC4q5N3Q = false(N,1); - for i=1:N - lNue6SeFoq = find( ~OEmC4q5N3Q(qfUlAeE6ke(qYyU89IINf:end)) , 1 , 'first'); - if isempty(lNue6SeFoq) - break - end - a = qfUlAeE6ke(lNue6SeFoq); - Distance = abs(row([1:a-1,a+1:end]')-row(a)) + abs(col([1:a-1,a+1:end]')-col(a)); - if max(Distance)>cutoff-1 - break - end - path = DqbHRtn5ft(B,row(a),col(a),row([1:a-1,a+1:end]'),col([1:a-1,a+1:end]'), -p, cutoff, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - npins = 2; - break - end - end - if npins < 2 - continue - end - for jjj = 3:N - [row2 col2] = find(B == -p); - [row col] = find(B == p); - [AM3xhXGopY,pXUGUzzwiB] = meshgrid(row,row2); - [sb9p2RYeiU,Je3dFDJNL9] = meshgrid(row,row2); - Distance = abs(AM3xhXGopY-pXUGUzzwiB) + abs(sb9p2RYeiU-Je3dFDJNL9); - if max(Distance(:))>cutoff-1 - break - end - path = DqbHRtn5ft(B,row2,col2,row,col, -p, cutoff, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - connected = true; - else - break - end - end - end + LVLs=sortrows(LVLs,-jfz7); + for Wbee = 1:wqrx + if LVLs(Wbee,2) >= 2 + rhLK = LVLs(Wbee,1); + [U_4G Bfxz] = find(B == rhLK); + DiOr = size(U_4G,1); + BDjo = DiOr*(DiOr-1)/2; + dist = zeros(BDjo,3); + kQrw = 0; + for PUeo = 1:DiOr + for Y2fY = (PUeo+1):DiOr + kQrw = kQrw + 1; + dist(kQrw,1) = PUeo; + dist(kQrw,2) = Y2fY; + dist(kQrw,3) = abs(U_4G(PUeo)-U_4G(Y2fY)) + abs(Bfxz(PUeo)-Bfxz(Y2fY)); end end - - - function [W B] = phase3a(B,W,XDfVAc3Mmp,rz) - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - pincount=sortrows(pincount,-rz); - for i = 1:k - p = pincount(i,1); - Npinwires = sum(B == -p); - if Npinwires == 0 - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - maxstep = min(XDfVAc3Mmp,2*p+1); - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - break - end - a = dist(x,1); - b = dist(x,2); - path = complexpath_a(B,[row(a); row(b)], [col(a); col(b)], -p, XDfVAc3Mmp, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - connected = true; - break - end - end - if ~connected - continue - end - end - end - [row col] = find(B == p); - wibFptvq9Y = size(row,1); - maxstep = min(XDfVAc3Mmp,p+1); - for jjj = 1:wibFptvq9Y - [row2 col2] = find(B == -p); - [row col] = find(B == p); - connected = false; - path = DqbHRtn5ft(B,row2,col2,row,col, -p, XDfVAc3Mmp, p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - connected = true; - end - if ~connected - break - end - end + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + XCOz = reshape(dist(:,1:2)',[],1); + et4B = 0; + aLNP = 1; + mAhH = false(DiOr,1); + for Wbee=1:DiOr + MwGP = find( ~mAhH(XCOz(aLNP:end)) , 1 , 'first'); + if isempty(MwGP) + break end + PUeo = XCOz(MwGP); + Distance = abs(U_4G([1:PUeo-1,PUeo+1:end]')-U_4G(PUeo)) + abs(Bfxz([1:PUeo-1,PUeo+1:end]')-Bfxz(PUeo)); + if max(Distance)>nZfY-1 + break end - - - function [W B] = phase2_a(Bpad,B,W,maxbridges,XDfVAc3Mmp,rz) - function hr2OdLy5K5() - for w = 1:size(path,1); - if path(w,1) == path(w,3) - YTx56DA5U8(path(w,1),path(w,2)) = false; - YTx56DA5U8(path(w,3),path(w,4)) = false; - if path(w,2) == path(w,4) - B(path(w,1),path(w,2)) = -9999; - end - end - if path(w,2) == path(w,4) - P9_FTG1hds(path(w,1),path(w,2)) = false; - P9_FTG1hds(path(w,3),path(w,4)) = false; - end + path = BF2a(B,U_4G(PUeo),Bfxz(PUeo),U_4G([1:PUeo-1,PUeo+1:end]'),Bfxz([1:PUeo-1,PUeo+1:end]'), -rhLK, nZfY, 2*rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + et4B = 2; + break end end - [YTx56DA5U8 P9_FTG1hds] = buildbridges(Bpad,B,W); - [pincount k] = analyzeboard(B,rz); - if k < 1, return, end - pincount=sortrows(pincount,-rz); - for i = 1:k - p = pincount(i,1); - Npinwires = sum(B == -p); - if Npinwires == 0 - if pincount(i,2) >= 2 - [row col] = find(B == p); - N = size(row,1); - Npairs = N*(N-1)/2; - dist = zeros(Npairs,3); - x = 0; - for a = 1:N - for b = (a+1):N - x = x + 1; - dist(x,1) = a; - dist(x,2) = b; - dist(x,3) = abs(row(a)-row(b)) + abs(col(a)-col(b)); - end - end - [d ix] = sort(dist(:,3)); - dist = dist(ix,:); - maxstep = min((maxbridges*25)+XDfVAc3Mmp,2*p+1); - connected = false; - for x = 1:Npairs - if dist(x,3) > maxstep+1 - break - end - a = dist(x,1); - b = dist(x,2); - path = bridgepath(B,YTx56DA5U8,P9_FTG1hds,[row(a); row(b)], [col(a); col(b)], -p, maxbridges, XDfVAc3Mmp, 2*p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - hr2OdLy5K5(); - connected = true; - break - end - end - if ~connected - continue - end - end - end - row = find(B == p); - wibFptvq9Y = size(row,1); - % maxstep = min((maxbridges*25)+XDfVAc3Mmp,p+1); - for jjj = 1:wibFptvq9Y - z2 = find(B == -p); - z = find(B == p); - connected = false; - path = d4TZerDbiG(B,YTx56DA5U8,P9_FTG1hds,z2,z, maxbridges, XDfVAc3Mmp, p); - if size(path,1) > 0 - W = [W; path]; - B = addwirepath(B,path,-p); - hr2OdLy5K5(); - connected = true; - end - if ~connected - break - end - end + if et4B < 2 + continue end + for OV6E = 3:DiOr + [zZow vKRV] = find(B == -rhLK); + [U_4G Bfxz] = find(B == rhLK); + [Ufe0,hWwF] = meshgrid(U_4G,zZow); + [wLgZ,Riq9] = meshgrid(U_4G,zZow); + Distance = abs(Ufe0-hWwF) + abs(wLgZ-Riq9); + if max(Distance(:))>nZfY-1 + break end - - %% - function path = d4TZerDbiG(B,BH,BV,zS,zT,maxbridges,kappa,maxpathlen) - function path = traceback_b(Z,step) - PZ(Z) = zi; - r=mod(Z,NR); - c=ceil(Z/NR); - path = zeros(step,4); - jjj = 0; - - while ~any(zS==Z) - jjj = jjj + 1; - path(jjj,1:2) = [r c]; - Z = PZ(Z); - r=mod(Z,NR); - c=ceil(Z/NR); - path(jjj,3:4) = [r c]; - if BRIDGE(r,c) - jjj = jjj + 1; - path(jjj,:) = [r c r c]; - end - end - path = path(1:jjj,:); - end - [NR NC] = size(B); - BRIDGE = false(NR,NC); - PZ = zeros(NR,NC); - C = -ones(NR,NC); - C(zS) = 0; - C(zT) = -2; - maxstep = min((maxbridges*25)+kappa,maxpathlen+1); - nextstep = zeros(maxstep+26,1); + path = BF2a(B,zZow,vKRV,U_4G,Bfxz, -rhLK, nZfY, 2*rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + j0g6 = true; + else + break + end + end + end + end + end + function [W B] = BPUC(B,W,Kv3I,jfz7) + [LVLs wqrx] = jur9(B,jfz7); + if wqrx < 1, return, end + LVLs=sortrows(LVLs,-jfz7); + for Wbee = 1:wqrx + rhLK = LVLs(Wbee,1); + JO30 = sum(B == -rhLK); + if JO30 == 0 + if LVLs(Wbee,2) >= 2 + [U_4G Bfxz] = find(B == rhLK); + DiOr = size(U_4G,1); + BDjo = DiOr*(DiOr-1)/2; + dist = zeros(BDjo,3); + kQrw = 0; + for PUeo = 1:DiOr + for Y2fY = (PUeo+1):DiOr + kQrw = kQrw + 1; + dist(kQrw,1) = PUeo; + dist(kQrw,2) = Y2fY; + dist(kQrw,3) = abs(U_4G(PUeo)-U_4G(Y2fY)) + abs(Bfxz(PUeo)-Bfxz(Y2fY)); + end + end + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + maxstep = min(Kv3I,2*rhLK+1); + j0g6 = false; + for kQrw = 1:BDjo + if dist(kQrw,3) > maxstep+1 + break + end + PUeo = dist(kQrw,1); + Y2fY = dist(kQrw,2); + path = NY46(B,[U_4G(PUeo); U_4G(Y2fY)], [Bfxz(PUeo); Bfxz(Y2fY)], -rhLK, Kv3I, 2*rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + j0g6 = true; + break + end + end + if ~j0g6 + continue + end + end + end + [U_4G Bfxz] = find(B == rhLK); + EBID = size(U_4G,1); + maxstep = min(Kv3I,rhLK+1); + for OV6E = 1:EBID + [zZow vKRV] = find(B == -rhLK); + [U_4G Bfxz] = find(B == rhLK); + j0g6 = false; + path = BF2a(B,zZow,vKRV,U_4G,Bfxz, -rhLK, Kv3I, rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + j0g6 = true; + end + if ~j0g6 + break + end + end + end + end + function [W B] = PikE(iIuA,B,W,vDl3,Kv3I,jfz7) + function FExA() + for d4Up = 1:size(path,1); + if path(d4Up,1) == path(d4Up,3) + gc1W(path(d4Up,1),path(d4Up,2)) = false; + gc1W(path(d4Up,3),path(d4Up,4)) = false; + if path(d4Up,2) == path(d4Up,4) + B(path(d4Up,1),path(d4Up,2)) = -9999; + end + end + if path(d4Up,2) == path(d4Up,4) + j3ah(path(d4Up,1),path(d4Up,2)) = false; + j3ah(path(d4Up,3),path(d4Up,4)) = false; + end + end + end + [gc1W j3ah] = t4TE(iIuA,B,W); + [LVLs wqrx] = jur9(B,jfz7); + if wqrx < 1, return, end + LVLs=sortrows(LVLs,-jfz7); + for Wbee = 1:wqrx + rhLK = LVLs(Wbee,1); + JO30 = sum(B == -rhLK); + if JO30 == 0 + if LVLs(Wbee,2) >= 2 + [U_4G Bfxz] = find(B == rhLK); + DiOr = size(U_4G,1); + BDjo = DiOr*(DiOr-1)/2; + dist = zeros(BDjo,3); + kQrw = 0; + for PUeo = 1:DiOr + for Y2fY = (PUeo+1):DiOr + kQrw = kQrw + 1; + dist(kQrw,1) = PUeo; + dist(kQrw,2) = Y2fY; + dist(kQrw,3) = abs(U_4G(PUeo)-U_4G(Y2fY)) + abs(Bfxz(PUeo)-Bfxz(Y2fY)); + end + end + [IMWN blcF] = sort(dist(:,3)); + dist = dist(blcF,:); + maxstep = min((vDl3*25)+Kv3I,2*rhLK+1); + j0g6 = false; + for kQrw = 1:BDjo + if dist(kQrw,3) > maxstep+1 + break + end + PUeo = dist(kQrw,1); + Y2fY = dist(kQrw,2); + path = HZE7(B,gc1W,j3ah,[U_4G(PUeo); U_4G(Y2fY)], [Bfxz(PUeo); Bfxz(Y2fY)], -rhLK, vDl3, Kv3I, 2*rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + FExA(); + j0g6 = true; + break + end + end + if ~j0g6 + continue + end + end + end + [U_4G Bfxz] = find(B == rhLK); + EBID = size(U_4G,1); + maxstep = min((vDl3*25)+Kv3I,rhLK+1); + for OV6E = 1:EBID + [zZow vKRV] = find(B == -rhLK); + [U_4G Bfxz] = find(B == rhLK); + j0g6 = false; + path = F17l(B,gc1W,j3ah,zZow,vKRV,U_4G,Bfxz, -rhLK, vDl3, Kv3I, rhLK); + if size(path,1) > 0 + W = [W; path]; + B = GEkJ(B,path,-rhLK); + FExA(); + j0g6 = true; + end + if ~j0g6 + break + end + end + end + end + function path = F17l(B,UVzS,x3jr,rowS,colS,xDTj,Yf6H,JuCX,vDl3,wGCf,bQjT) + function path = M7Vi(z8UH,step) + cECH(z8UH) = U9nT; + path = zeros(step,4); + N1pS = 0; + Uc6H = 0; + umWm = zeros(step,1); + QCNZ = zeros(step,1); + hyv2 = zeros(step,1); + while isempty(find(NdKt==z8UH,1)) + N1pS = N1pS + 1; + umWm(N1pS,1) = z8UH; + IYqk = cECH(z8UH); + QCNZ(N1pS,1) = IYqk; + z8UH = IYqk; + if EOE4(z8UH) + Uc6H = Uc6H + 1; + hyv2(Uc6H,1) = z8UH; + end + end + umWm = [ umWm(1:N1pS,:) ; hyv2(1:Uc6H,1) ]; + QCNZ = [ QCNZ(1:N1pS,:) ; hyv2(1:Uc6H,1) ]; + path = [ mod(umWm,ma8P) , ceil(umWm/ma8P) , mod(QCNZ,ma8P) , ceil(QCNZ/ma8P) ]; + end + [ma8P UHnc] = size(B); + EOE4 = false(ma8P,UHnc); + cECH = zeros(ma8P,UHnc); + URW0 = -ones(ma8P,UHnc); + NdKt = rowS + (colS-1)*ma8P; + URW0(NdKt) = 0; + URW0(xDTj + (Yf6H-1)*ma8P) = -2; + maxstep = min((vDl3*25)+wGCf,bQjT+1); + IFEb = zeros(maxstep+26,1); + JXN_ = [-1 1]; for step = 0:maxstep - if step == 0 - z = zS; - elseif nextstep(step) == 0 - continue - else - z = find(C == step); - end - N = numel(z); - for i = 1:N - zi = z(i); - Z = zi - NR; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BH(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - Z = zi + NR; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BH(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - Z = zi - 1; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BV(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - Z = zi + 1; - tag = C(Z); - if tag == -2 - path = traceback_b(Z,step+1); - return - elseif tag == -1 - if B(Z) == 0 - C(Z) = step+1; nextstep(step+1) = 1; - PZ(Z) = zi; - elseif BV(Z) - C(Z) = step+26; nextstep(step+26) = 1; - PZ(Z) = zi; - BRIDGE(Z) = true; - end - end - end + if step == 0 + bt8q = NdKt; + elseif IFEb(step) == 0 + continue + else + bt8q = find(URW0 == step); end + DiOr = numel(bt8q); + for Wbee = 1:DiOr + U9nT = bt8q(Wbee); + for Nfcy = 1:2 + z8UH = U9nT + JXN_(Nfcy) * ma8P; + UZ4K = URW0(z8UH); + if UZ4K == -2 + path = M7Vi(z8UH,step+1); + return + elseif UZ4K == -1 + if B(z8UH) == 0 + URW0(z8UH) = step+1; IFEb(step+1) = 1; + cECH(z8UH) = U9nT; + elseif UVzS(z8UH) + URW0(z8UH) = step+26; IFEb(step+26) = 1; + cECH(z8UH) = U9nT; + EOE4(z8UH) = true; + end + end + end + for Nfcy = 1:2 + z8UH = U9nT + JXN_(Nfcy); + UZ4K = URW0(z8UH); + if UZ4K == -2 + path = M7Vi(z8UH,step+1); + return + elseif UZ4K == -1 + if B(z8UH) == 0 + URW0(z8UH) = step+1; IFEb(step+1) = 1; + cECH(z8UH) = U9nT; + elseif x3jr(z8UH) + URW0(z8UH) = step+26; IFEb(step+26) = 1; + cECH(z8UH) = U9nT; + EOE4(z8UH) = true; + end + end + end + end + end path = zeros(0,4); end - - function path = DqbHRtn5ft(B,rowS,colS,FIg5RLlRYM,bX69T9QEhw,label,cutoff,maxpathlen) - % function path = traceback_a(r,c,pathLength) - % pR(r,c) = zR(i); - % pC(r,c) = zC(i); - % path = zeros(pathLength,4); - % for jjj = 1:pathLength - % path(jjj,1:2) = [r c]; - % preR = pR(r,c); - % preC = pC(r,c); - % path(jjj,3:4) = [preR preC]; - % r = preR; - % c = preC; - % end - % end - [NR NC] = size(B); - pR = zeros(NR,NC); - pC = zeros(NR,NC); - C = -ones(NR,NC); - C(rowS+(colS-1)*NR) = 0; - C(FIg5RLlRYM+(bX69T9QEhw-1)*NR) = -2; - znext = zeros(NR*NC,1); - cnext = zeros(NR*NC,1); + function path = BF2a(B,rowS,colS,PQg8,areu,JuCX,nZfY,bQjT) + [ma8P UHnc] = size(B); + HIeZ = zeros(ma8P,UHnc); + rUCa = zeros(ma8P,UHnc); + URW0 = -ones(ma8P,UHnc); + URW0(rowS+(colS-1)*ma8P) = 0; + URW0(PQg8+(areu-1)*ma8P) = -2; + i6HE = zeros(ma8P*UHnc,1); + nyuo = zeros(ma8P*UHnc,1); count = numel(rowS); - znext(1:count) = rowS; - cnext(1:count) = colS; - dR=[-1 1 0 0]; - dC=[0 0 -1 1]; - for step = 0:min(cutoff,maxpathlen) - if count < 1, break, end - N = count; - zR = znext; - zC = cnext; - count = 0; - for i = 1:N - Aa2p_xqlDq = zC(i); - zi = zR(i); - for s=1:4 - r = zi + dR(s); - c = Aa2p_xqlDq + dC(s); - Z = r + (c-1)*NR; - tag = C(Z); - if tag == -2 - %path = traceback_a(r,c,step+1); - pathLength=step+1; - pR(r,c) = zR(i); - pC(r,c) = zC(i); - path = zeros(pathLength,4); - for jjj = 1:pathLength - path(jjj,1:2) = [r c]; - preR = pR(r,c); - preC = pC(r,c); - path(jjj,3:4) = [preR preC]; - r = preR; - c = preC; - end - return - end - if tag == -1 && B(Z) == 0 - C(Z) = step+1; - pR(Z) = zi; - pC(Z) = Aa2p_xqlDq; - count = count + 1; znext(count) = r; cnext(count) = c; - end - end - end + i6HE(1:count) = rowS; + nyuo(1:count) = colS; + J0Mg=[-1 1 0 0]; + ah92=[0 0 -1 1]; + for step = 0:min(nZfY,bQjT) + if count < 1, break, end + DiOr = count; + ERAE = i6HE(1:DiOr); + W1aD = nyuo(1:DiOr); + count = 0; + for Wbee = 1:DiOr + gjUR = W1aD(Wbee); + U9nT = ERAE(Wbee); + for nsnP=1:4 + jaqu = U9nT + J0Mg(nsnP); + AMXi = gjUR + ah92(nsnP); + z8UH = jaqu + (AMXi-1)*ma8P; + UZ4K = URW0(z8UH); + if UZ4K == -2 + xi1R=step+1; + HIeZ(jaqu,AMXi) = ERAE(Wbee); + rUCa(jaqu,AMXi) = W1aD(Wbee); + path = zeros(xi1R,4); + for OV6E = 1:xi1R + path(OV6E,1:2) = [jaqu AMXi]; + xcHW = HIeZ(jaqu,AMXi); + vZbB = rUCa(jaqu,AMXi); + path(OV6E,3:4) = [xcHW vZbB]; + jaqu = xcHW; + AMXi = vZbB; end + return + end + if UZ4K == -1 && B(z8UH) == 0 + URW0(z8UH) = step+1; + HIeZ(z8UH) = U9nT; + rUCa(z8UH) = gjUR; + count = count + 1; i6HE(count) = jaqu; nyuo(count) = AMXi; + end + end + end + end path = []; - end+ end