Pagini recente » Cod sursa (job #2289321) | Cod sursa (job #264858) | Cod sursa (job #1733843) | Cod sursa (job #3253574) | Cod sursa (job #2079327)
#include <fstream>
using namespace std;
struct abc
{
short int x,y;
}c[10003];
short int v[103][103],n,OK,m,i,j,u,p,a,b,x,y,dx[]={0,1,-1,0,0,1,1,-1,-1},dy[]={0,0,0,1,-1,1,-1,1,-1},Min=10000,I,J;
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;
if(k[j]=='R')
{
v[i][j+1]=20001;
c[1].x=i;c[1].y=j+1;
}
if(k[j]=='J')
{
v[i][j+1]=10001;
c[2].x=i;c[2].y=j+1;
}
}
f.get();
}
for(i=0;i<=m+1;i=i+1)
{
v[0][i]=-1;
v[n+1][i]=-1;
}
for(i=1;i<=n;i=i+1)
{
v[i][0]=-1;
v[i][m+1]=-1;
}
p=1;u=2;
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;
}
else
{
if(v[x][y]>=10000&&v[x][y]<20000)
if(v[a][b]>=20000)
if(v[x][y]%10000+1==v[a][b]%10000)
{
Min=v[a][b]%10000;
I=a;J=b;OK=1;
break ;
}
}
}
p++;
if(OK==1)
break ;
}
g<<Min<<' '<<I<<' '<<J;
return 0;
}