Pagini recente » Cod sursa (job #3268286) | Cod sursa (job #2923378) | Cod sursa (job #2358173) | Cod sursa (job #2716000) | Cod sursa (job #1813171)
#include <fstream>
#include <deque>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int a[102][102],dl[]={1,1,1,0,-1,-1,-1,0},dc[]={-1,0,1,1,1,0,-1,-1},b[102][102],v[102][102],n,m;
int sf,inc,nrmin=10201,L,C,l,c;
struct coada
{int lin,col;};
coada cr[10201],cj[10201];
void citire()
{
char x;
int i=1,j=1;
f>>noskipws>>x;
while(f>>noskipws>>x)
if(x=='\n')
{i++;j=1;}
else
{
if(x=='X')
a[i][j]=-1;
else if(x=='J')
{
a[i][j]=1;
cj[1].lin=i;
cj[1].col=j;
v[i][j]=1;
}
else if(x=='R')
{
a[i][j]=1;
cr[1].lin=i;
cr[1].col=j;
b[i][j]=1;
}
j++;
}
}
void bordare()
{
for(int i=0;i<=n+1;i++)
a[i][0]=a[i][m+1]=-1;
for(int i=0;i<=m+1;i++)
a[0][i]=a[n+1][i]=-1;
}
void lee ()
{
inc=sf=1;
while(inc<=sf)
{
l=cr[inc].lin;c=cr[inc].col;
for(int k=0;k<8;k++)
if(a[l+dl[k]][c+dc[k]]==0&&b[l+dl[k]][c+dc[k]]==0)
{
b[l+dl[k]][c+dc[k]]=b[l][c]+1;
sf++;
cr[sf].lin=l+dl[k];
cr[sf].col=c+dc[k];
}
inc++;
}
inc=sf=1;
while(inc<=sf)
{
l=cj[inc].lin;c=cj[inc].col;
for(int k=0;k<8;k++)
if(a[l+dl[k]][c+dc[k]]==0&&v[l+dl[k]][c+dc[k]]==0)
{
v[l+dl[k]][c+dc[k]]=v[l][c]+1;
sf++;
cj[sf].lin=l+dl[k];
cj[sf].col=c+dc[k];
}
inc++;
}
}
int main()
{
f>>n>>m;
citire();
bordare();
lee();
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(b[i][j]==v[i][j])
if(v[i][j]<nrmin&&v[i][j]!=0)
{
L=i;
C=j;
nrmin=v[i][j];
}
g<<nrmin<<" "<<L<<" "<<C;
return 0;
}