Pagini recente » Cod sursa (job #1979024) | Cod sursa (job #2271264) | Cod sursa (job #1736604) | Cod sursa (job #2014654) | Cod sursa (job #338514)
Cod sursa(job #338514)
#include<fstream.h>
#include<stdlib.h>
ifstream fin("rj.in");
ofstream fout("rj.out");
int n,m,x1,y1,x2,y2;
int a[101][101];
int rom[101][101];
int jul[101][101];
int l[8]={-1,-1,-1,0,1,1,1,0};
int c[8]={-1,0,1,1,1,0,-1,-1};
struct coada
{int x,y,dist;
};
coada romeo[10001],julieta[10001];
void citire()
{int i,j;
char c;
fin>>n>>m;
fin.get(c);
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
{fin.get(c);
if(c==' ') a[i][j]=0;
else if(c=='X') a[i][j]=1;
else if(c=='R') {x1=i;
y1=j;
}
else {x2=i;
y2=j;
}
}
fin.get(c);
if(c!='\n')
while(c!='\n')
fin.get(c);
}
}
void lee()
{int ii,jj,p1,u1,p2,u2,k,g;
romeo[1].x=x1;
romeo[1].y=y1;
romeo[1].dist=1;
julieta[1].x=x2;
julieta[1].y=y2;
julieta[1].dist=1;
rom[x1][y1]=1;
jul[x2][y2]=1;
p1=u1=p2=u2=1;
while(p1<=u1 && p2<=u2)
{g=u1;
for(k=0;k<=7;k++)
{ii=romeo[p1].x+l[k];
jj=romeo[p1].x+c[k];
if(ii>=1 && ii<=n && jj>=1 && jj<=m)
if(rom[ii][jj]==0 && a[ii][jj]==0)
{rom[ii][jj]=romeo[p1].dist+1;
u1++;
romeo[u1].x=ii;
romeo[u1].y=jj;
romeo[u1].dist=romeo[p1].dist+1;
if(rom[ii][jj]==jul[ii][jj]) {fout<<romeo[u1].dist<<" "<<ii<<" "<<jj;
exit(0);
}
}
ii=julieta[p2].x+l[k];
jj=julieta[p2].y+c[k];
if(ii>=1 && ii<=n && jj>=1 && jj<=m)
if(jul[ii][jj]==0 && a[ii][jj]==0)
{jul[ii][jj]=julieta[p1].dist+1;;
u2++;
julieta[u2].x=ii;
julieta[u2].y=jj;
julieta[u2].dist=julieta[p2].dist+1;
if(rom[ii][jj]==jul[ii][jj]) {fout<<julieta[u2].dist<<" "<<ii<<" "<<jj;
exit(0);
}
}
}
p1++;
p2++;
}
}
int main()
{citire();
lee();
fin.close();
fout.close();
return 0;
}