Cod sursa(job #2487305)

Utilizator divianegoescuDivia Negoescu divianegoescu Data 4 noiembrie 2019 15:18:11
Problema Rj Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.7 kb
#include <fstream>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
int n,m,i,j,ir,jr,ij,jj,iv,jv,isol,jsol,p,u,d,J[102][102],R[102][102],pasi=9999999;
pair<int,int> c[10003];
int di[]={0,1,0,-1,1,1,-1,-1};
int dj[]={1,0,-1,0,1,-1,1,-1};
char s[112];
void bord(){
    for(i=0;i<=n+1;i++)
        R[i][0]=R[i][m+1]=J[i][0]=J[i][m+1]=-1;
    for(j=1;j<=m;j++)
        R[0][j]=R[n+1][j]=J[0][j]=J[n+1][j]=-1;
}
int main(){
    fin>>n>>m;
    fin.get();
    for(i=1;i<=n;i++){
        fin.getline(s,110);
        for(j=1;j<=m;j++)
            if(s[j-1]=='X')R[i][j]=J[i][j]=-1;
            else if(s[j-1]=='R'){ir=i;jr=j;}
            else if(s[j-1]=='J'){ij=i;jj=j;}
    }
    bord();
    c[1]={ij,jj};
    for(p=u=1;p<=u;p++){
        i=c[p].first;
        j=c[p].second;
        for(d=0;d<8;d++){
            iv=i+di[d];
            jv=j+dj[d];
            if(J[iv][jv]==0){
                J[iv][jv]=J[i][j]+1;
                c[++u]={iv,jv};
                if(iv==ir && jv==jr)break;
            }
        }
        if(iv==ir && jv==jr)break;
    }
    c[1]={ir,jr};
    for(p=u=1;p<=u;p++){
        i=c[p].first;
        j=c[p].second;
        for(d=0;d<8;d++){
            iv=i+di[d];
            jv=j+dj[d];
            if(R[iv][jv]==0){
                R[iv][jv]=R[i][j]+1;
                if(R[iv][jv]==J[iv][jv]){
                    if(R[iv][jv]<pasi){isol=iv;jsol=jv;pasi=R[iv][jv];}
                    else if(R[iv][jv]==pasi && (iv<isol ||(iv==isol && jv<jsol))
                            {isol=iv;jsol=jv;}
                }
                c[++u]={iv,jv};
            }
        }
    }
    fout<<pasi+1<<" "<<isol<<" "<<jsol;
    return 0;
}