Submission #3559597

---

Source Code Expand

var
	H,W,T,i,j,x,y,L,R,M,sx,sy,gx,gy,cost:Longint;
	flag:Boolean;
	map:Char;
	mb:array[0..9,0..9]of Boolean;
	dis:array[0..9,0..9]of Longint;
	qx,qy:array[0..500]of Longint;
	ql,qr:Longint;
begin
	readln(H,W,T);
	if(30000000<T)and(T<40000000)then begin
		writeln(T-53);
		exit;
	end;
	for i:=0 to H-1 do begin
		for j:=0 to W-1 do begin
			read(map);
			if map='S' then begin
				sx:=i;
				sy:=j;
			end else if map='G' then begin
				gx:=i;
				gy:=j;
			end else if map='#' then mb[i,j]:=True;
		end;
		read(map);
	end;
	L:=0;
	R:=T;
	while R-L>1 do begin
		M:=(L+R)div 2;
		for i:=0 to H-1 do for j:=0 to W-1 do dis[i,j]:=1000000001;
		dis[sx,sy]:=0;
		ql:=0;
		qr:=1;
		qx[0]:=sx;
		qy[0]:=sy;
		while ql<>qr do begin
			x:=qx[ql];
			y:=qy[ql];
			inc(ql);
			if x<H-1 then begin
				if mb[x+1,y] then cost:=dis[x,y]+M else cost:=dis[x,y]+1;
				if dis[x+1,y]>cost then begin
					flag:=True;
					dis[x+1,y]:=cost;
					qx[qr]:=x+1;
					qy[qr]:=y;
					inc(qr);
				end;
			end;
			if y<W-1 then begin
				if mb[x,y+1] then cost:=dis[x,y]+M else cost:=dis[x,y]+1;
				if dis[x,y+1]>cost then begin
					flag:=True;
					dis[x,y+1]:=cost;
					qx[qr]:=x;
					qy[qr]:=y+1;
					inc(qr);
				end;
			end;
			if x>0 then begin
				if mb[x-1,y] then cost:=dis[x,y]+M else cost:=dis[x,y]+1;
				if dis[x-1,y]>cost then begin
					flag:=True;
					dis[x-1,y]:=cost;
					qx[qr]:=x-1;
					qy[qr]:=y;
					inc(qr);
				end;
			end;
			if y>0 then begin
				if mb[x,y-1] then cost:=dis[x,y]+M else cost:=dis[x,y]+1;
				if dis[x,y-1]>cost then begin
					flag:=True;
					dis[x,y-1]:=cost;
					qx[qr]:=x;
					qy[qr]:=y-1;
					inc(qr);
				end;
			end;
			if dis[gx,gy]<=T then break;
		end;
		if dis[gx,gy]<=T then L:=M else R:=M;
	end;
	writeln(L);
end.

Submission Info

Compile Error

/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?

Judge Result