Pagini recente » Cod sursa (job #301148) | Cod sursa (job #669980) | Cod sursa (job #636979) | Cod sursa (job #1725620) | Cod sursa (job #2083002)
#include <fstream>
using namespace std;
struct abc
{
short int x,y;
}c[10003];
short int n,OK,m,i,j,u,p,a,b,x,y,Min=10000,I,J;
short int v[103][103],w[103][103],dx[]={0,1,-1,0,0,1,1,-1,-1},dy[]={0,0,0,1,-1,1,-1,1,-1};
char k[101];
int main()
{
ifstream f("rj.in");
ofstream g("rj.out");
f>>n>>m;f.get();
for(i=1;i<=n;i=i+1)
{
f.get(k,m+1);
for(j=0;j<m;j=j+1)
{
if(k[j]=='X')
{
v[i][j+1]=-1;
w[i][j+1]=-1;
}
if(k[j]=='R')
{
v[i][j+1]=1;
c[1].x=i;c[1].y=j+1;
}
if(k[j]=='J')
{
w[i][j+1]=1;
I=i;J=j+1;
}
}
f.get();
}
for(i=0;i<=m+1;i=i+1)
{
v[0][i]=-1;
v[n+1][i]=-1;
w[0][i]=-1;
w[n+1][i]=-1;
}
for(i=1;i<=n;i=i+1)
{
v[i][0]=-1;
v[i][m+1]=-1;
w[i][0]=-1;
w[i][m+1]=-1;
}
p=1;u=1;
while(p<=u)
{
x=c[p].x;
y=c[p].y;
for(i=1;i<=8;i=i+1)
{
a=x+dx[i];
b=y+dy[i];
if(v[a][b]==0)
{
c[++u].x=a;
c[u].y=b;
v[a][b]=v[x][y]+1;
}
}
p++;
}
p=1;u=1;c[p].x=I;c[p].y=J;
while(p<=u)
{
x=c[p].x;
y=c[p].y;
for(i=1;i<=8;i=i+1)
{
a=x+dx[i];
b=y+dy[i];
if(w[a][b]==0)
{
c[++u].x=a;
c[u].y=b;
w[a][b]=w[x][y]+1;
}
}
p++;
}
for(i=1;i<=n;i=i+1)
for(j=1;j<=m;j=j+1)
if(v[i][j]>0 && v[i][j]==w[i][j])
if(v[i][j]<Min)
{
Min=v[i][j];
I=i;J=j;
}
g<<Min<<' '<<I<<' '<<J;
return 0;
}