Pagini recente » Cod sursa (job #630917) | Cod sursa (job #611495) | Cod sursa (job #886770) | Cod sursa (job #222990) | Cod sursa (job #1813399)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rj.in"); ofstream g("rj.out");
struct {
short x,y;
}v_r[5002],v_j[5002];
string s;
short n,m,r[103][103],l[103][103],k2=1,k1=1,b1=1,b2=1,h,u,i,j,rez,i1,j1,z=1;
short d_l[9]={-1,-1,-1,0,0,1,1,1}, d_c[9]={-1,0,1,-1,1,-1,0,1};
int verifr(int h, int u)
{
if(r[h][u]==0 && h>=1 && h<=n && u>=1 && u<=m && l[h][u]==0) return 1;
else return 0;
}
int verifj(int h, int u)
{
if(l[h][u]==0 && h>=1 && h<=n && u>=1 && u<=m)
{
if(r[h][u]==l[i][j]+1) return 2;
else if(r[h][u]==0) return 1;
else return 0;
}
else return 0;
}
int main()
{
f>>n>>m; getline(f,s);
for(i=1;i<=n;++i)
{
getline(f,s);
for(j=0;j<m;++j)
{
if(s[j]=='R')
{
v_r[1].x=i;
v_r[1].y=j+1;
r[i][j+1]=1;
l[i][j+1]=1;
}
else if(s[j]=='J')
{
v_j[1].x=i;
v_j[1].y=j+1;
l[i][j+1]=1;
r[i][j+1]=1;
}
else if(s[j]=='X')
{
r[i][j+1]=-1;
l[i][j+1]=-1;
}
}
}
bool ok=false;
while(!ok)
{
while(r[v_r[b1].x][v_r[b1].y]==z)
{
i=v_r[b1].x;
j=v_r[b1].y;
for(int c=0;c<8;++c)
{
h=i+d_l[c];
u=j+d_c[c];
if(verifr(h,u))
{
++k1;
v_r[k1].x=h;
v_r[k1].y=u;
r[h][u]=r[i][j]+1;
}
}
++b1;
}
while(l[v_j[b2].x][v_j[b2].y]==z)
{
i=v_j[b2].x;
j=v_j[b2].y;
for(int c=0;c<8;++c)
{
h=i+d_l[c];
u=j+d_c[c];
if(verifj(h,u)==1)
{
++k2;
v_j[k2].x=h;
v_j[k2].y=u;
l[h][u]=l[i][j]+1;
}
else if(verifj(h,u)==2)
{
ok=true;
rez=r[h][u];
i1=h;
j1=u;
break;
}
}
if(ok) break;
++b2;
}
++z;
}
g<<rez<<' '<<i1<<' '<<j1;
return 0;
}