Cod sursa(job #2491087)

Utilizator LeCapataIustinian Serban LeCapata Data 11 noiembrie 2019 19:46:13
Problema Rj Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.66 kb
//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];
int mat2[105][105];

pair<int, int> coada[10050], coada2[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]=mat2[i][j+1]=-1;
            else if(x[j]==' ')
                mat[i][j+1]=mat2[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);
                mat2[i][j+1]=1;
            }

        }
    }
}

void captusire(int mat[][105])
{
    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(mat);
    captusire(mat2);

    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;
            }
        }
    }

    int prim2=1, ultim2=1;
    coada2[1]=coordJ;

    while(prim2<=ultim2 && mat2[coordR.first][coordR.second]==0)
    {
        int okx=coada2[prim2].first;
        int oky=coada2[prim2].second;
        prim2++;

        for(int i=0; i<8; i++)
        {
            int x2=okx+dx[i];
            int y2=oky+dy[i];

            if(mat2[x2][y2]==0)
            {
                mat2[x2][y2]=mat2[okx][oky]+1;
                ultim2++;
                pair<int, int> newcoord=make_pair(x2,y2);
                coada2[ultim2]=newcoord;
            }
        }
    }

    for(int i=1, j=ultim2; i<=ultim, j>=1; i++, j--)
        if(mat[coada[i].first][coada[i].second]==mat2[coada2[j].first][coada2[j].second])
        {
            out<<mat[coada[i].first][coada[i].second]<<" ";
            out<<coada[i].first<<" "<<coada[i].second;
            break;
        }


    in.close();
    out.close();
    return 0;
}