Pagini recente » Cod sursa (job #95361) | Cod sursa (job #2374919) | Cod sursa (job #387277) | Cod sursa (job #729679) | Cod sursa (job #2285735)
#include <iostream>
#include<fstream>
#include <cstring>
using namespace std;
struct ura{
int l,c;
};
ura coada[30626];
int dirL[8]={-1,-1,0,1,1,1,0,-1},dirC[8]={0,1,1,1,0,-1,-1,-1},pmin=10002;
char s[105];
int rom[102][102],jul[102][102];
ifstream in("rj.in");
ofstream out("rj.out");
int main()
{
int n,m,i,lin,col,l,c,x,y,lr,cr,sf,inc,j,lj,cj,nr;
in>>n>>m;
in.get();
for(i=1;i<=n;i++){
in.get(s,105);
in.get();
nr=strlen(s);
for(j=0;j<nr;j++)
if(s[j]=='R')
{
lr=i;
cr=j+1;
}
else
if(s[j]=='J')
{
lj=i;
cj=j+1;
}
else
if(s[j]=='X')
{
rom[i][j+1]=-1;
jul[i][j+1]=-1;
}
}
for(i=0;i<=n+1;i++)
{
rom[i][0]=rom[i][m+1]=-1;
jul[i][0]=jul[i][m+1]=-1;
}
for(j=0;j<=m+1;j++)
{
rom[0][j]=rom[n+1][j]=-1;
jul[0][j]=jul[n+1][j]=-1;
}
coada[1].l=lr;
coada[1].c=cr;
rom[lr][cr]=1;
inc=sf=1;
while(inc<=sf)
{
for(i=0;i<8;i++)
{
lin=coada[inc].l+dirL[i];
col=coada[inc].c+dirC[i];
if(rom[lin][col]==0)
{
sf++;
coada[sf].l=lin;
coada[sf].c=col;
rom[lin][col]=rom[coada[inc].l][coada[inc].c]+1;
}
}
inc++;
}
inc=1;
sf=1;
coada[1].l=lj;
coada[1].c=cj;
jul[lj][cj]=1;
while(inc<=sf)
{
for(i=0;i<8;i++)
{
lin=coada[inc].l+dirL[i];
col=coada[inc].c+dirC[i];
if(jul[lin][col]==0)
{
sf++;
coada[sf].l=lin;
coada[sf].c=col;
jul[lin][col]=jul[coada[inc].l][coada[inc].c]+1;
}
}
inc++;
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(rom[i][j]==jul[i][j]&&rom[i][j]<pmin&&rom[i][j]>0){
pmin=rom[i][j];
lr=i;
cr=j;
}
out<<pmin<<" "<<lr<<" "<<cr;
return 0;
}