Cod sursa(job #1649951)

Utilizator edynator34Nechitoaia George-Edward edynator34 Data 11 martie 2016 15:53:29
Problema Rj Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.21 kb
#include <fstream>
#include <string.h>
using namespace std;
ifstream in("rj.in");
ofstream out("rj.out");
int a[105][105],ci[10010],cj[10010],timp,ifin,jfin,ci2[10010],cj2[10010],is,js,j,i,n,m,is2,js2,b[105][105];
char x[101];
int di[]={-1,-1,0,1,1,1,0,-1};
int dj[]={0,1,1,1,0,-1,-1,-1};
void afis(){
for(i=1;i<=n;i++)
{
    for(j=1;j<=m;j++)
        out<<a[i][j]<<' ';
    out<<endl;
}
out<<endl;
for(i=1;i<=n;i++)
{
    for(j=1;j<=m;j++)
        out<<b [i][j]<<' ';
    out<<endl;
}
}
void citire() {
 in>>n>>m;
    in.get();
    for(i=0;i<n;i++)
    {
        in.getline(x,101, '\n');
        for(j=0;j<m;j++)
        {
            if(x[j]=='R') { a[i+1][j+1]=1; is=i+1; js=j+1; b[i+1][j+1]=0;}
            if(x[j]=='J') { b[i+1][j+1]=1; is2=i+1;js2=j+1; a[i+1][j+1]=0;}
            if(x[j]=='X') {a[i+1][j+1]=-1;b[i+1][j+1]=-1;}
        }
    }
}

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

void leeR(){
    int p,u,i,j,inou,jnou,k;
    p=1;u=1;
    ci[1]=is;
    cj[1]=js;
    while(p<=u){
        i=ci[p];
        j=cj[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++;
            ci[u]=inou;
            cj[u]=jnou;
           }
        }
    p++;
    }
}

void leeJ(){
    int p,u,i,j,inou,jnou,k;
    p=1;u=1;
    ci2[1]=is2;
    cj2[1]=js2;
    while(p<=u){
        i=ci2[p];
        j=cj2[p];
        for(k=0;k<8;k++){
           inou=i+di[k];
           jnou=j+dj[k];
           if(b[inou][jnou]==0){
            b[inou][jnou]=b[i][j]+1;
            u++;
            ci2[u]=inou;
            cj2[u]=jnou;
           }
        }
    p++;
    }
}

void final(){
    timp=10010;
for(i=1;i<=n;i++){
{for(j=1;j<=m;j++)

    if(a[i][j]==b[i][j]&& timp>a[i][j] && a[i][j]>0) {timp=a[i][j];
                                                    ifin=i;
                                                    jfin=j;
    }

}}
out<<timp<<' '<<ifin<<' '<<jfin<<'\n';
}

int main(){
citire();
bordare();
leeR();
leeJ();
//afis();
final();

}