Pagini recente » Cod sursa (job #1155147) | Cod sursa (job #1650663) | Cod sursa (job #848157) | Cod sursa (job #188002) | Cod sursa (job #2284938)
#include <iostream>
#include<fstream>
#include <cstring>
using namespace std;
struct ura{
int l,c;
};
ura coada[30626];
int dirL[4]={-1,0,1,0},dirC[4]={0,1,0,-1},pmin=10002;
char s;
int rom[101][101],jul[101][101];
ifstream in("tom.in");
ofstream out("tom.out");
int main()
{
int n,m,i,lin,col,l,c,x,y,lr,cr,sf,inc,j,lj,cj;
in>>n>>m;
in.get(s);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
in.get(s);
if(s==' '){
rom[i][j]=0;
jul[i][j]=0;
}
else if(s=='R'){
rom[i][j]=1;
lr=i;
cr=j;
}
else if(s=='J'){
jul[i][j]=1;
lj=i;
cj=j;
}
else{
rom[i][j]=-1;
jul[i][j]=-1;
}
}
in.get(s);
}
for(i=0;i<=n+1;i++)
for(j=0;j<=m+1;j++)
if(i==0||j==0||i==n+1||j==m+1){
rom[i][j]=-1;
jul[i][j]=-1;
}
coada[1].l=lr;
coada[1].c=cr;
rom[lr][cr]=1;
inc=sf=1;
while(inc<=sf)
{
for(i=0;i<8;i++)
{
lin=coada[inc].l+dirL[i];
col=coada[inc].c+dirC[i];
if(rom[lin][col]==0)
{
sf++;
coada[sf].l=lin;
coada[sf].c=col;
rom[lin][col]=rom[coada[inc].l][coada[inc].c]+1;
}
}
inc++;
}
inc=0;
sf=0;
coada[1].l=lj;
coada[1].c=cj;
jul[lj][cj]=1;
while(inc<=sf)
{
for(i=0;i<8;i++)
{
lin=coada[inc].l+dirL[i];
col=coada[inc].c+dirC[i];
if(jul[lin][col]==0)
{
sf++;
coada[sf].l=lin;
coada[sf].c=col;
jul[lin][col]=jul[coada[inc].l][coada[inc].c]+1;
}
}
inc++;
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(rom[i][j]==jul[i][j]&&rom[i][j]<pmin&&rom[i][j]>0){
pmin=rom[i][j];
lr=i;
cr=j;
}
out<<pmin<<" "<<lr<<" "<<cr<<" ";
return 0;
}