Cod sursa(job #2640624)

Utilizator casian307Marincas Casian casian307 Data 7 august 2020 02:04:39
Problema Rj Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.22 kb
#include <fstream>
#include <cstring>
#include <iostream>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");

const int NMAX=105, dl[]={-1,0,1,0}, dc[]={0,1,0,-1};
struct pozitie{
    int x,y;
}coada[NMAX*NMAX];
pozitie Romeo, Julieta;
int n,m;
int intalnirex,intalnirey;
char matrice[NMAX][NMAX]; int rezolvare[NMAX][NMAX];
void citire()
{
    char s[NMAX];
    f>>n>>m; f.get();
    for(int i=0;i<n;i++)
    {
        f.getline(s,NMAX);
        for(int j=0;j<m;j++)
            matrice[i][j]=s[j];
    }
}
void afisare()
{
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
            cout<<rezolvare[i][j];
        cout<<'\n';
    }
}
void crMatrice()
{
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
          {
            if(matrice[i][j]=='X')
                rezolvare[i][j]=-1;
            if(matrice[i][j]=='R')
            {
                Romeo.x=i;
                Romeo.y=j;
                rezolvare[i][j]=1;
            }
            if(matrice[i][j]=='J')
            {
                Julieta.x=i;
                Julieta.y=j;
          }
        }
    }
}
bool ok(pozitie a)
{
    return (a.x>=0&&a.x<n&&a.y>=0&&a.y<m);
}
void Lee()
{
    pozitie container,vecin;
    coada[1]=Romeo;
    int prim,ultim;
    prim=ultim=1;
    while(prim<=ultim)
    {
        container=coada[prim];
        prim++;
        for(int i=0;i<4;i++)
        {
            vecin.x=container.x+dl[i];
            vecin.y=container.y+dc[i];
            if(ok(vecin))
            {
                if(rezolvare[vecin.x][vecin.y]==0)
                  {
                      rezolvare[vecin.x][vecin.y]=rezolvare[container.x][container.y]+1;
                      coada[++ultim]=vecin;
                  }
            }

        }
    }
}
void gasirePctIntalnire(int timp)
{
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            if(rezolvare[i][j]==timp+1)
    {
        intalnirex=i;
        intalnirey=j;
    }
}
int main()
{
    citire();
    crMatrice();
    Lee();
   // afisare();
    int tmin=rezolvare[Julieta.x][Julieta.y]/2;
    gasirePctIntalnire(tmin);
    g<<tmin<<' '<<intalnirex+1<<' '<<intalnirey+1;


}