Pagini recente » Cod sursa (job #1624521) | Cod sursa (job #749560) | Cod sursa (job #76892) | Cod sursa (job #2959346) | Cod sursa (job #2646414)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rj.in");
ofstream fout("rj.out");
int n,m,timp[102][102],timpj[102][102],ri,rj,ji,jj,coada[10002][2],dx[]={-1,-1,-1,0,1,1,1,0},dy[]={-1,0,1,1,1,0,-1,-1},solt=INT_MAX,solx=INT_MAX,soly=INT_MAX;
bool a[102][102]; //0-liber 1-ocupat
void lee ()
{
int p=1,u=1;
while (p<=u)
{
int x=coada[p][0],y=coada[p][1];
for (int i=0;i<8;i++)
{
int xx=x+dx[i],yy=y+dy[i];
if (xx>0&&xx<=n&&yy>0&&yy<=m&&a[xx][yy]==0&&timp[xx][yy]==0)
{
coada[++u][0]=xx;
coada[u][1]=yy;
timp[xx][yy]=timp[x][y]+1;
}
}
p++;
}
}
void lee2 ()
{
int p=1,u=1;
while (p<=u)
{
int x=coada[p][0],y=coada[p][1];
if (timp[x][y]==timpj[x][y])
{
if (timp[x][y]==solt)
{if ((x<solx)||(x==solx&&y<soly))
solx=x,soly=y;
}
else if (timp[x][y]<solt)
solt=timp[x][y],solx=x,soly=y;
}
for (int i=0;i<8;i++)
{
int xx=x+dx[i],yy=y+dy[i];
if (xx>0&&xx<=n&&yy>0&&yy<=m&&a[xx][yy]==0&&timpj[xx][yy]==0)
{
coada[++u][0]=xx;
coada[u][1]=yy;
timpj[xx][yy]=timpj[x][y]+1;
}
}
p++;
}
}
int main()
{
fin>>n>>m;
fin.get();
int i,j;
for (i=1;i<=n;i++)
{
char s[m+3];
fin.getline(s,m+1);
for (j=1;j<=m;j++)
if (s[j-1]=='X')
a[i][j]=1;
else if (s[j-1]=='R')
ri=i,rj=j;
else if (s[j-1]=='J')
ji=i,jj=j;
}
timp[ri][rj]=1;
coada[1][0]=ri;
coada[1][1]=rj;
lee ();
timpj[ji][jj]=1;
coada[1][0]=ji;
coada[1][1]=jj;
lee2();
fout<<solt<<' ' <<solx<<' ' <<soly<<'\n';
return 0;
}