Pagini recente » Cod sursa (job #548766) | Cod sursa (job #1151031) | Cod sursa (job #1150979) | Cod sursa (job #1113049) | Cod sursa (job #2171372)
#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream fin("rj.in");
ofstream fout("rj.out");
int n,m,a[1005][1005],i,j,ii,jj,pr,ul,nr,xr,yr,xj,yj,k,fr[1005];
int dl[]={-1,0,1,0};
int dc[]={0,1,0,-1};
char s[105];
struct op
{
int lin,col;
}coada[1000005];
int main()
{
fin>>n>>m;
ii=1;
jj=1;
fin.get();
for(j=1;j<=n;j++)
{
fin.getline(s,105);
for(i=0;i<strlen(s);i++)
{
if(s[i]==' ')
{
a[j][jj]=0;
}
if(s[i]=='X')
{
a[j][jj]=-1;
}
if(s[i]=='R')
{
a[j][jj]=0;
xr=j;
yr=jj;
}
if(s[i]=='J')
{
a[j][jj]=0;
xj=j;
yj=jj;
}
jj++;
}
ii++;
jj=1;
}
pr=1;
ul=2;
nr=2;
ii=0;
jj=0;
coada[1]={xr,yr};
coada[2]={xj,yj};
while(nr>0)
{
i=coada[pr].lin;
j=coada[pr].col;
for(k=0;k<4;k++)
{
ii=i+dl[k];
jj=j+dc[k];
if(ii>=1 && ii<=n && jj>=1 && jj<=m && a[ii][jj]==0)
{
a[ii][jj]=a[i][j]+1;
ul++;
nr++;
coada[ul]={ii,jj};
}
}
pr++;
nr--;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i][j]==0)
{
a[i][j]=-1;
}
}
}
a[xr][yr]=0;
a[xj][yj]=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i][j]!=-1 && a[i][j]!=0)
{
fr[a[i][j]]++;
}
}
}
for(i=1;i<=n*m;i++)
{
if(fr[i]==1)
{
fout<<i<<" ";
break;
}
}
for(k=1;k<=n;k++)
{
for(j=1;j<=m;j++)
{
if(a[k][j]==i)
{
fout<<k<<" "<<j;
}
}
}
return 0;
}