Pagini recente » Cod sursa (job #1813769) | Autentificare | Cod sursa (job #1723456) | Cod sursa (job #2308672) | Cod sursa (job #891018)
Cod sursa(job #891018)
#include <fstream>
using namespace std;
ofstream out("rj.out");
const int dx[]={-1,-1,0,1,1,1,0,-1};
const int dy[]={0,1,1,1,0,-1,-1,-1};
int n,m,xr,yr,xj,yj,mR[100][100],mJ[100][100];
int x[10000], y[10000];
int first, last, pas;
void citire()
{
int i,j;
char sir[101];
ifstream in("rj.in");
in>>n>>m;
in.get();
for(i=0;i<n;i++)
{
in.getline(sir,101,'\n');
for(j=0;j<m;j++)
{
if(sir[j]=='R'){ xr=i; yr=j; mR[i][j]=1;}
if(sir[j]=='J'){ xj=i; yj=j; mJ[i][j]=1;}
if(sir[j]=='X'){ mR[i][j]=1; mJ[i][j]=1;}
}
}
in.close();
}
int bune(int ii,int jj)
{
return((ii>=0)&&(ii<n)&&(jj>=0)&&(jj<m));
}
void leecR()
{
int ii,jj,k,pas;
while(first<=last)
{
for(k=0;k<8;k++)
{
ii=x[first]+dx[k];
jj=y[first]+dy[k];
if(bune(ii,jj))
{
pas=mR[x[first]][y[first]];
if( (mR[ii][jj]==0) || (mR[ii][jj]>pas+1) )
{
pas=pas+1;
mR[ii][jj]=pas;
last++;
x[last]=ii;
y[last]=jj;
}
}
}
first++;
}
}
void leecJ()
{
int ii,jj,k;
while(first<=last)
{
for(k=0;k<8;k++)
{
ii=x[first]+dx[k];
jj=y[first]+dy[k];
if(bune(ii,jj))
{
pas=mJ[x[first]][y[first]];
if( (mJ[ii][jj]==0) ||(mJ[ii][jj]>pas+1) )
{
pas=pas+1;
mJ[ii][jj]=pas;
last++;
x[last]=ii;
y[last]=jj;
}
}
}
first++;
}
}
int main()
{
int i,j,min,xf,yf;
citire();
x[0]=xr;
y[0]=yr;
first=0;
last=0;
leecR();
x[0]=xj;
y[0]=yj;
first=0;
last=0;
leecJ();
/*
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if(mat[i][j]>max) { max=mat[i][j]; xretinut=i; yretinut=j; }
gasit=1;
for(i=0;i<n&&gasit;i++)
for(j=0;j<m&&gasit;j++)
if(mat[i][j]==min){gasit=0; xretinut=i; yretinut=j;}
*/
min=100*100;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if (mR[i][j]>1)
if(mR[i][j]==mJ[i][j])
if(mR[i][j]<min)
{
min=mR[i][j];
xf=i;
yf=j;
}
/*
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
out<<mJ[i][j]<<" ";
out<<endl;
}
*/
out<<min<<" "<<xf+1<<" "<<yf+1;
out.close();
return 0;
}