Pagini recente » Cod sursa (job #399543) | Cod sursa (job #690503) | Cod sursa (job #1666595) | Cod sursa (job #432625) | Cod sursa (job #2065817)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
const int N=102;
const int dl[]={-1,-1,-1,0,1,1,1,0};
const int dc[]={-1,0,1,1,1,0,-1,-1};
struct comp{
short int l,c;
};
comp q[N*N];
int a[N][N];
int b[N][N];
int main()
{
string idk;
int n,m,i,j,p,u,timp=2147483647,x,y;
comp R,J,curent,vecin;
in>>n>>m;
for(i=0;i<=n+1;i++)
{
a[i][0]=-1;
a[i][m+1]=-1;
b[i][0]=-1;
b[i][m+1]=-1;
}
for(i=0;i<=m+1;i++)
{
a[0][i]=-1;
a[n+1][i]=-1;
b[0][i]=-1;
b[n+1][i]=-1;
}
getline(in,idk);
for(i=1;i<=n;i++)
{
getline(in,idk);
for(j=1;j<=m;j++)
{
if(idk[j-1]=='X')
a[i][j]=b[i][j]=-1;
else if(idk[j-1]=='R')
{
R.l=i;
R.c=j;
}
else if(idk[j-1]=='J')
{
J.l=i;
J.c=j;
}
}
}
p=0;u=-1;
q[++u]=R;
a[R.l][R.c]=1;
while(p<=u)
{
curent=q[p++];
for(i=0;i<8;i++)
{
vecin.l=curent.l+dl[i];
vecin.c=curent.c+dc[i];
if(a[vecin.l][vecin.c]==0||a[vecin.l][vecin.c]>a[curent.l][curent.c]+1)
{
q[++u]=vecin;
a[vecin.l][vecin.c]=1+a[curent.l][curent.c];
}
}
}
p=0;u=-1;
q[++u]=J;
b[J.l][J.c]=1;
while(p<=u)
{
curent=q[p++];
for(i=0;i<8;i++)
{
vecin.l=curent.l+dl[i];
vecin.c=curent.c+dc[i];
if(b[vecin.l][vecin.c]==0||b[vecin.l][vecin.c]>b[curent.l][curent.c]+1)
{
q[++u]=vecin;
b[vecin.l][vecin.c]=1+b[curent.l][curent.c];
}
}
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]==b[i][j]&&a[i][j]!=-1&&a[i][j]<timp)
{
x=i;
y=j;
timp=a[i][j];
}
out<<timp<<" "<<x<<" "<<y;
return 0;
}