Pagini recente » Cod sursa (job #2385519) | Cod sursa (job #259789) | Cod sursa (job #1965708) | Cod sursa (job #1537227) | Cod sursa (job #877662)
Cod sursa(job #877662)
#include <stdio.h>
struct pozitii { int lin,col; } v,p,c[10000];
int mat[101][101];
int n,m,x1,x2,y1,y2,xxx,yyy;
const int dx[]={-1,0,1,0}, dy[]={0,1,0,-1};
void citire ()
{
int i,j;
char ceva;
scanf ("%d %d",&n,&m);
scanf ("%c",&ceva);
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
{
scanf ("%c",&ceva);
if (int(ceva)==10 && j==m)
ceva=' ';
if (int(ceva)==10)
scanf ("%c",&ceva);
if (int(ceva)==32) //" "
mat[i][j]=0;
else if (int(ceva)==88) //"X"
mat[i][j]=-1;
else if (int(ceva)==82) //"R"
{
mat[i][j]=1;
x1=i;y1=j;
}
else if (int(ceva)==74) //"J"
{
mat[i][j]=0;
x2=i;y2=j;
}
//printf ("%d ",(int)ceva);
}
//printf ("\n");
}
}
int matt()
{
int i,j,k,prim=0,ultim=0,nrpasi=0;
for (i=0;i<=m+1;i++)
mat[0][i]=mat[n+1][i]=-1;
for (i=0;i<=n+1;i++)
mat[i][0]=mat[i][m+1]=-1;
c[0].lin=x1;
c[0].col=y1;
while (mat[x2][y2]==0 && prim<=ultim)
{
p.lin=c[prim].lin;
p.col=c[prim].col;
prim++;
for (k=0;k<4;k++)
{
v.lin=p.lin+dx[k];
v.col=p.col+dy[k];
if (mat[v.lin][v.col]==0)
{
mat[v.lin][v.col]=mat[p.lin][p.col]+1;
ultim++;
c[ultim].lin=v.lin;
c[ultim].col=v.col;
if (v.lin == x2 && v.col == y2)
nrpasi=mat[v.lin][v.col];
}
}
}
return nrpasi;
}
int cauta (int x)
{
int i,j;
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
{
if (mat[i][j]==x)
{
xxx=i;yyy=j;
}
}
}
}
void afisare ()
{
int i,j;
//printf ("\n");
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
{
printf ("%d",mat[i][j]);
}
printf ("\n");
}
}
int main()
{
int x=0,xx=0;
freopen ("rj.in","r",stdin);
freopen ("rj.out","w",stdout);
citire();
//afisare();
x=matt();
//afisare();
if (x%2==1)
{
xx=(x+1)/2;
cauta(xx);
}
printf ("%d %d %d",mat[xxx][yyy]-1,xxx,yyy);
return 0;
}