Cod sursa(job #294341)
Utilizator | Data | 2 aprilie 2009 14:25:25 | |
---|---|---|---|
Problema | Rj | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 2.31 kb |
program alex;
const b:array[1..8]of -1..1=(-1,-1,0,1,1,1,0,-1);
d:array[1..8]of -1..1=(0,1,1,1,0,-1,-1,-1);
var a:array[1..101,1..101]of longint;
f:text;
q:string;
e:boolean;
m,n,i,j,x,y,l,c,k,h,w,nr,t,r:longint;
begin
assign(f,'rj.in');reset(f);
readln(f,m,n);
for i:=1 to m do
begin
readln(f,q);
j:=0;
for h:=1 to length(q) do
case q[h] of
' ':begin
j:=j+1;
a[i,j]:=-1;
end;
'X':begin
j:=j+1;
a[i,j]:=-2;
end;
'R':begin
j:=j+1;
x:=i;
y:=j;
end;
'J':begin
j:=j+1;
l:=i;
c:=j;
end;
end;
if length(q)<n then for h:=length(q)+1 to n do
begin
j:=j+1;
a[i,j]:=-1;
end;
end;
close(f);
a[x,y]:=1;
a[l,c]:=1;
k:=1;
repeat
e:=false;
for i:=1 to m do
begin
for j:=1 to n do
begin
if a[i,j]=k then begin
for h:=1 to 8 do
if a[i+b[h],j+d[h]]=-1 then begin
a[i+b[h],j+d[h]]:=k+1;
e:=true;
end
else if k+1=a[i+b[h],j+d[h]] then begin
w:=1;
nr:=k+1;
t:=i+b[h];
r:=j+d[h];
break;
end;
end;
if w=1 then break;
end;
if w=1 then break;
end;
k:=k+1;
until(e=false)or(w=1);
assign(f,'rj.out');rewrite(f);
writeln(f,nr,' ',t,' ',r);
close(f);
end.