Pagini recente » Cod sursa (job #1716927) | Cod sursa (job #2906458) | Cod sursa (job #1989002) | Cod sursa (job #1471823) | Cod sursa (job #2090452)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
struct poz
{
int lin,col;
}c[100000],pr,pj,p,b,k;
int dl[]={-1,-1,0,1,1,1,0,-1};
int dc[]={0,1,1,1,0,-1,-1,-1};
int n,m,v[101][101],a[101][101],i,j,prim,ultim,mini=100000,of;char cc[105];
int main()
{
f>>n>>m;f.get();
for (i=1;i<=n;i++)
{
f.getline(cc,m);
of=strlen(cc);
for (j=0;j<of;j++)
{
if (cc[j]=='J')
{
pj.lin=i;
pj.col=j+1;
}
else
if (cc[j]=='R')
{
pr.lin=i;
pr.col=j+1;
}
else
if (cc[j]=='X')
{
v[i][j+1]=-1;
a[i][j+1]=-1;
}
}
}
for (i=0;i<=n;i++)
{
v[i][0]=v[i][m+1]=a[i][0]=a[i][m+1]=-1;
}
for (i=0;i<=m;i++)
{
v[0][i]=v[n+1][i]=a[0][i]=a[n+1][i]=-1;
}
prim=ultim=0;
c[prim]=pj;
v[pj.lin][pj.col]=1;
while (prim<=ultim)
{
p=c[prim];
prim++;
for (i=0;i<8;i++)
{
b.lin=p.lin+dl[i];
b.col=p.col+dc[i];
if (v[b.lin][b.col]==0)
{
v[b.lin][b.col]=v[p.lin][p.col]+1;
ultim++;
c[ultim]=b;
}
}
}
prim=ultim=0;
c[prim]=pr;
a[pr.lin][pr.col]=1;
while (prim<=ultim&&a[pj.lin][pj.col]==0)
{
p=c[prim];
prim++;
for (i=0;i<8;i++)
{
b.lin=p.lin+dl[i];
b.col=p.col+dc[i];
if (a[b.lin][b.col]==0)
{
a[b.lin][b.col]=a[p.lin][p.col]+1;
if (a[b.lin][b.col]==v[b.lin][b.col])
{
if (a[b.lin][b.col]<mini)
{
mini=a[b.lin][b.col];
k.lin=b.lin;
k.col=b.col;
}
}
ultim++;
c[ultim]=b;
}
}
}
g<<k.lin<<" "<<k.col<<" "<<mini;
return 0;
}