Cod sursa(job #1877822)

Utilizator OanaOanaOana123Oana Andreea Todirica OanaOanaOana123 Data 13 februarie 2017 19:01:09
Problema Rj Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.51 kb
#include <iostream>
#define N 102
#include <fstream>
using namespace std;
struct coord { int x,y;};
coord c[N*N];
int a[N][N], b[N][N];
int xj, yj, xr,yr,n,m;
int dx[]={0,1, 0,-1, 1,1,-1,-1};
int dy[]={1,0,-1, 0,-1,1,-1, 1};
void citire()
{
    char c;
    ifstream fin ("rj.in");
    fin>>n>>m;
    fin.get();
    for( int i=1;i<=n;i++)
   {

   for( int j=1;j<=m;j++)
    {
        c=fin.get();
        if(c=='R')
        {
            xr=i;
            yr=j;
        }
        else
            if(c=='J')
        {
            xj=i;
            yj=j;

        }
        else
            if(c=='X')
        a[i][j]=b[i][j]=-1;


    }
    c=fin.get() ;
    }
}
int interior( int x, int y)
{
    if(x>0&&x<=n&&y>0&&y<=m)
        return 1;
    return 0;

}
void LEE ( int a[][N], int x, int y)
{
    int p, u, xv,yv,i;
    p=u=1;
    c[u].x=x;
    c[u].y=y;
    a[x][y]=1;
    while(p<=u)
{
    x=c[p].x;
    y=c[p++].y;
    for( int i=0;i<=7;i++)
    {
        xv=x+dx[i];
        yv=y+dy[i];
        if(interior(xv,yv)&&a[xv][yv]==0)
        {
            c[++u].x=xv;
            c[u].y=yv;
            a[xv][yv]=a[x][y]+1;
        }
    }
}
}

int main()
{   int mini=N*N,x,y;
ofstream fout ("rj.out");
    citire();

    LEE(a,xr,yr);

    LEE(b,xj,yj);
    for( int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
if(a[i][j]==b[i][j]&&a[i][j]<mini&&a[i][j]>0)
{
    mini=a[i][j];
    x=i;
    y=j;
}
fout<<x<< " "<<y<<endl<<mini;
        return 0;
}