Cod sursa(job #1879106)

Utilizator vladboss2323Ciorica Vlad vladboss2323 Data 14 februarie 2017 18:37:12
Problema Rj Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.17 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream in("rj.in");
ofstream out("rj.out");

const int N=102;
const int dl[]= {1,0,-1,0,1,1,-1,-1};
const int dc[]= {0,-1,0,1,1,-1,1,-1};

struct poz
{
    int l,c;
};
int n,m,R[N][N],J[N][N],p=0,u=-1;
char a[N][N];
poz q[N*N];

void lee(poz z,int d[N][N])
{
    int i,p=0,u=-1;
    q[++u]=z;
    poz x,y;
    d[z.l][z.c]=1;
    while(p<=u)
    {
        x=q[p++];
        for(i=0; i<8; i++)
        {
            y.l=x.l+dl[i];
            y.c=x.c+dc[i];
            if(d[y.l][y.c]==0)
            {
                q[++u]=y;
                d[y.l][y.c]=1+d[x.l][x.c];
            }

        }

    }
}
void afisare(int b[N][N])
{
    int i,j;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
            out<<b[i][j]<<" ";
        out<<endl;
    }
}
void bordare(int b[N][N])
{
    int i,j;
    for(j=0; j<=m+1; j++)
        b[0][j]=-2;
    for(i=0; i<=n+1; i++)
        b[i][0]=-2;
    for(j=0; j<=m+1; j++)
        b[n+1][j]=-2;
    for(i=0; i<=n+1; i++)
        b[i][m+1]=-2;
}
int main()
{
    int i,j,minim=100000,p,r;
    poz x,y,z;
    in>>n>>m;
    for(i=0; i<=n; i++)
        in.getline(1+a[i],101);
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
        {
            if(a[i][j]=='R')
            {
                x.l=i;
                x.c=j;
            }
            if(a[i][j]=='J')
            {
                y.l=i;
                y.c=j;
            }
            if(a[i][j]==' ')
            {
                R[i][j]=0;
                J[i][j]=0;
            }
            if(a[i][j]=='X')
            {
                R[i][j]=-1;
                J[i][j]=-1;
            }
        }
    bordare(R);
    bordare(J);
    //afisare(R);
    //afisare(J);
    lee(x,R);
    lee(y,J);
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
        {
            if(R[i][j]==J[i][j] && R[i][j]>0)
                if(R[i][j]<minim)
                {
                    minim=R[i][j];
                    p=i;
                    r=j;
                }
        }
    out<<minim<<" "<<p<<" "<<r;
    return 0;
}