Cod sursa(job #175441)

Utilizator drag0shSandulescu Dragos drag0sh Data 9 aprilie 2008 22:40:04
Problema Rj Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 3.05 kb
#include <stdio.h>
FILE *f=fopen("rj.in","r");
FILE *g=fopen("rj.out","w");
int n,m,ri,rj,jji,jjj,m1[101][101],m2[101][101],soli[10000],solj[10000];
int di[10]={0,1,-1,0, 0,1,-1, 1,-1};
int dj[10]={0,0, 0,1,-1,1,-1,-1, 1};
void citire(){
     int i,j;
     char c[102];
     fscanf(f,"%d %d",&n,&m);
     fgets(c,111,f);
     for(i=1;i<=n;i++){                       
     fgets(c,111,f);
          for(j=1;j<=m;j++){
                           if(c[j-1]=='X'){m1[i][j]=-1;m2[i][j]=-1;}
                                                else{
                                                     if(c[j-1]=='R'){ri=i;rj=j;}
                                                     if(c[j-1]=='J'){jji=i;jjj=j;}
                                                     }
                           }
     }
     }    
void bordare(){
     int i;
     for(i=0;i<=m+1;i++){m1[0][i]=-1;m1[n+1][i]=-1;m2[0][i]=-1;m2[n+1][i]=-1;}
     for(i=0;i<=n+1;i++){m1[i][0]=-1;m1[i][m+1]=-1;m2[i][0]=-1;m2[i][m+1]=-1;}
     }
void lee1(){
     m1[ri][rj]=1;
     int p,q,i,ii,jj;
     p=1;
     q=1;
     soli[1]=ri;
     solj[1]=rj;
     while(p<=q){
                 for(i=1;i<=8;i++){
                                   ii=soli[p]+di[i];
                                   jj=solj[p]+dj[i];
                                   if(m1[ii][jj]==0){q++;
                                                     soli[q]=ii;
                                                     solj[q]=jj;
                                                     m1[ii][jj]=m1[soli[p]][solj[p]]+1;
                                                  }
                                   }    
                                   
                 p++;
                 }
                                                     
                                   
}                 
void lee2(){
     m2[jji][jjj]=1;
     int p,q,i,ii,jj;
     p=1;
     q=1;
     soli[1]=jji;
     solj[1]=jjj;
     while(p<=q){
                 for(i=1;i<=8;i++){
                                   ii=soli[p]+di[i];
                                   jj=solj[p]+dj[i];
                                   if(m2[ii][jj]==0){q++;
                                                     soli[q]=ii;
                                                     solj[q]=jj;
                                                     m2[ii][jj]=m2[soli[p]][solj[p]]+1;
                                                  }
                                   }    
                                   
                 p++;
                 }
                                                     
                                   
}                 

int main(){
    citire();
    bordare();
    lee1();
     lee2();
    int tmin,pozi,pozj;
    tmin=30000;
    int i,j;
     for(i=1;i<=n;i++)
          for(j=1;j<=m;j++)
                            if(m1[i][j]==m2[i][j]&&m1[i][j]<tmin&&m1[i][j]>0){tmin=m1[i][j];pozi=i;pozj=j;}
     fprintf(g,"%d %d %d",tmin,pozi,pozj);
    
    
    fclose(f);
    fclose(g);
    return 0;
}