Pagini recente » Cod sursa (job #2371250) | Cod sursa (job #526795) | Cod sursa (job #1362623) | Cod sursa (job #2792061) | Cod sursa (job #2490702)
//https://www.infoarena.ro/problema/rj
#include <fstream>
#include <queue>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
int n, m;
char x[256];
int mat[105][105];
pair<int, int> coada[10050];
pair<int, int> coordR, coordJ;
int dx[]={-1,-1,-1,0,0,1,1,1};
int dy[]={-1,0,1,-1,1,-1,0,1};
void citire()
{
for(int i=0; i<=n; i++)
{
in.getline(x,256);
for(int j=0; j<=m; j++)
{
if(x[j]=='X')
mat[i][j+1]=-1;
else if(x[j]==' ')
mat[i][j+1]=0;
else if(x[j]=='R')
{
coordR=make_pair(i,j+1);
mat[i][j+1]=1;
}
else if(x[j]=='J')
coordJ=make_pair(i,j+1);
}
}
}
void captusire()
{
for(int i=0; i<=n+1; i++)
mat[i][0]=mat[i][m+1]=-1;
for(int j=0; j<=m+1; j++)
mat[0][j]=mat[n+1][j]=-1;
}
int main()
{
in>>n>>m;
citire();
captusire();
int prim=1, ultim=1;
coada[1]=coordR;
while(prim<=ultim && mat[coordJ.first][coordJ.second]==0)
{
int okx=coada[prim].first;
int oky=coada[prim].second;
prim++;
for(int i=0; i<8; i++)
{
int x2=okx+dx[i];
int y2=oky+dy[i];
if(mat[x2][y2]==0)
{
mat[x2][y2]=mat[okx][oky]+1;
ultim++;
pair<int, int> newcoord=make_pair(x2,y2);
coada[ultim]=newcoord;
}
}
}
out<<(mat[coordJ.first][coordJ.second]+1)/2<<" ";
for(int i=1; i<=ultim; i++)
{
if(mat[coada[i].first][coada[i].second]==(mat[coordJ.first][coordJ.second]-1)/2+1)
{
out<<coada[i].first<<" "<<coada[i].second<<'\n';
break;
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
out<<mat[i][j]<<" ";
out<<'\n';
}
in.close();
out.close();
return 0;
}