Pagini recente » Cod sursa (job #3292885) | Cod sursa (job #3175220) | Cod sursa (job #1134175) | Cod sursa (job #1274944) | Cod sursa (job #1384056)
#include <iostream>
#include <time.h>
#include <fstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main()
{
int v[105][105],w[105][105],n,m,pa,pb,da,db;
char q[150];
ifstream fin("rj.in");
ofstream fout("rj.out");
fin>>n>>m;
fin.getline(q,105);
for(int a=0;a<=n+1;a++)
v[a][0]=v[a][m+1]=-1,
w[a][0]=w[a][m+1]=-1;
for(int a=0;a<=m+1;a++)
v[0][a]=v[n+1][a]=-1,
w[0][a]=w[n+1][a]=-1;
for(int a=1;a<=n;a++)
{
fin.getline(q,105);
for(int b=0;b<m;b++)
{
if(q[b]=='X')
v[a][b+1]=-1,
w[a][b+1]=-1;
else
if(q[b]=='R')
v[a][b+1]=0,da=a,db=b+1;
else if(q[b]=='J')
pa=a,pb=1+b,v[a][b+1]=99999999;
else {
v[a][b+1]=99999999;
w[a][b+1]=99999999;}
}
}
w[pa][pb]=0;
w[da][db]=99999999;
int dx[]={-1,-1,-1,0,0,1,1,1};
int dy[]={-1,0,1,-1,1,-1,0,1};
int ok;
int qa,qb,c=99999999;
do
{
ok=0;
for(register int a=n;a>=1;a--)
for(register int b=1;b<=m;b++)
if(v[a][b]>=0)
{
for(int c=0;c<8;c++)
if(v[a+dx[c]][b+dy[c]]>=0)
{
if(v[a][b]+1<v[a+dx[c]][b+dy[c]])
v[a+dx[c]][b+dy[c]]=v[a][b]+1,ok=1;
if(w[a][b]+1<w[a+dx[c]][b+dy[c]])
w[a+dx[c]][b+dy[c]]=w[a][b]+1,ok=1;
}
if(v[a][b]==w[a][b] and v[a][b]<c)
c=v[a][b],qa=a,qb=b;
}
}while(ok==1);
fout<<c+1<<" "<<qa<<" "<<qb;
}