Pagini recente » Cod sursa (job #554228) | Cod sursa (job #174506) | Cod sursa (job #1028652) | Cod sursa (job #1174482) | Cod sursa (job #1138557)
#include <fstream>
using namespace std;
int mat[110][110],i,j,r1,j1,r2,j2,n,m,st,dr,xx,yy,zz;
int dx[]={0,-1,-1,-1,0,0,1,1,1};
int dy[]={0,-1,0,1,-1,1,-1,0,1};
char x,a[110];
struct qu
{
int x,y,mark;
}coada[10010];
void bordare()
{
int i,j;
for (i=0;i<=n+1;i++)
{
mat[i][0]=-1;
mat[i][m+1]=-1;
}
for (i=0;i<=m+1;i++)
{
mat[0][i]=-1;
mat[n+1][i]=-1;
}
}
int main()
{
ifstream f("rj.in");
ofstream g("rj.out");
f>>n>>m;
f.get();
for (i=1;i<=n;i++)
{
f.getline(a,101);
for (j=0;j<m;j++)
{
if (a[j]=='X') mat[i][j+1]=-1;
if (a[j]=='R') {r1=i;r2=j+1;}
if (a[j]=='J') {j1=i;j2=j+1;}
}
}
bordare();
coada[1].x=r1;
coada[1].y=r2;
coada[1].mark=1;
st=1;dr=1;
while (st<=dr)
{
if (mat[coada[st].x][coada[st].y]==0)
{
mat[coada[st].x][coada[st].y]=coada[st].mark;
for (i=1;i<=8;i++)
if (mat[coada[st].x+dx[i]][coada[st].y+dy[i]]==0)
{
coada[++dr].x=coada[st].x+dx[i];
coada[dr].y=coada[st].y+dy[i];
coada[dr].mark=coada[st].mark+1;
}
}
st++;
}
coada[1].x=j1;
coada[1].y=j2;
coada[1].mark=1;
st=1;dr=1;
while (st<=dr)
{
if (mat[coada[st].x][coada[st].y]!=-1)
{
if (mat[coada[st].x][coada[st].y]==coada[st].mark)
{
xx=coada[st].x;
yy=coada[st].y;
zz=coada[st].mark;
break;
}
mat[coada[st].x][coada[st].y]=coada[st].mark;
for (i=1;i<=8;i++)
if (mat[coada[st].x+dx[i]][coada[st].y+dy[i]]!=-1)
{
coada[++dr].x=coada[st].x+dx[i];
coada[dr].y=coada[st].y+dy[i];
coada[dr].mark=coada[st].mark+1;
}
}
st++;
}
g<<xx<<" "<<yy<<" "<<zz;
return 0;
}