Pagini recente » Cod sursa (job #2316011) | Cod sursa (job #1525901) | Cod sursa (job #1018791) | Cod sursa (job #516286) | Cod sursa (job #703719)
Cod sursa(job #703719)
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
short int n, m;
short int a[102][102], b[102][102];
short int r1,r2,j1,j2;
char x[102];
void lee(short int x, short int y, short int t[102][102], short int val);
int main()
{
f>>n>>m;
f.get();
for(int i=1;i<=n;i++){
f.getline(x,102);
for(int k=0;k<strlen(x);k++)
if(x[k]=='X'){
a[i][k+1]=-1;
b[i][k+1]=-1;}
else
if(x[k]=='R')
{r1=i;
r2=k+1;}
else
if(x[k]=='J')
{j1=i;
j2=k+1;}
}
a[r1][r2]=b[j1][j2]=1;
lee(r1,r2,a,1);
lee(j1,j2,b,1);
short int pozx, pozy;
int minim=999999;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(a[i][j]==b[i][j] && a[i][j]>0)
if(minim>a[i][j])
{
pozx=i;
pozy=j;
minim=a[i][j];
}
g<<pozx<<" "<<pozy<<" "<<minim-1;
return 0;
}
int eok(int x, int y)
{
if(x>0 && x<=n && y>0 && y<=n)
return 1;
return 0;
}
short int di[]={-1,0,1,0};
short int dj[]={0,1,0,-1};
void lee(short int x, short int y, short int t[102][102], short int val)
{
for(int i=0;i<4;i++)
if(eok(x+di[i],y+dj[i]))
if(t[x+di[i]][y+dj[i]]==0 || t[x+di[i]][y+dj[i]]>val+1)
{
t[x+di[i]][y+dj[i]]=val+1;
lee(x+di[i],y+dj[i],t,val+1);
}
}