Cod sursa(job #1647895)

Utilizator george.ursachiUrsachi George george.ursachi Data 10 martie 2016 22:39:49
Problema Rj Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.98 kb
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
int n,m,a[101][101],b[101][101],i,j,x1,y1,x2,y2,ci1[10003],cj1[10003],ci2[10003],cj2[10003],minim;
char x[101];
int cimin,cjmin;
int di[]={-1,-1,0,1,1,1,0,-1};
int dj[]={0,1,1,1,0,-1,-1,-1};
void leeR(){
    int p,u,i,j,inou,jnou,k;
    p=u=1;
    ci1[1]=x1;
    cj1[1]=y1;
    a[x1][y1]==1;
    while(p<=u){
        i=ci1[p];
        j=cj1[p];
        for(k=0;k<8;k++){
           inou=i+di[k];
           jnou=j+dj[k];
           if(a[inou][jnou]==0){
            a[inou][jnou]=a[i][j]+1;
            u++;
            ci1[u]=inou;
            cj1[u]=jnou;
           }
        }
    p++;
    }
}

void leeJ(){
    int p,u,i,j,inou,jnou,k;
    p=u=1;
    ci2[1]=x1;
    cj2[1]=y1;
    a[x1][y1]==1;
    while(p<=u){
        i=ci2[p];
        j=cj2[p];
        for(k=0;k<8;k++){
           inou=i+di[k];
           jnou=j+dj[k];
           if(a[inou][jnou]==0){
            a[inou][jnou]=a[i][j]+1;
            u++;
            ci2[u]=inou;
            cj2[u]=jnou;
           }
        }
    p++;
    }
}
int main()
{
    f>>n>>m;
    ///citire
    for(i=0;i<n;i++)
    {
        f.getline(x,101, '\n');
        for(j=0;j<m;j++)
        {
            if(x[j]=='R') { a[i+1][j+1]=1; x1=i+1; y1=j+1; b[i+1][j+1]=0;}
            if(x[j]=='J') { b[i+1][j+1]=1; x2=i+1;y2=j+1; a[i+1][j+1]=0;}
            if(x[j]=='X') {a[i+1][j+1]=-1;b[i+1][j+1]=-1;}
        }
    }
    ///bordare
    for(i=0;i<=n+1;i++) a[i][0]=b[i][0]=a[i][m+1]=b[i][m+1]=-1;
    for(j=0;j<=m+1;j++) a[0][j]=b[0][j]=a[n+1][j]=b[n+1][j]=-1;
    leeR();
    leeJ();
    minim=10003;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++){
                if(a[i][j]==b[i][j] && a[i][j]<minim && a[i][j]>0){
                    minim=a[i][j];
                    cimin=i;
                    cjmin=j;
                }
    }
    g<<cimin<<' '<<cjmin<<' '<<minim<<'\n';
    return 0;
}