Pagini recente » Clasament dupa rating | Monitorul de evaluare | Cod sursa (job #201750) | Monitorul de evaluare | Cod sursa (job #1594552)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
struct poz
{
int x,y,dis,pers;
};
ifstream f("rj.in");
ofstream g("rj.out");
int dx[10]={0,-1,-1,-1,0,1,1,1,0},dy[10]={0,-1,0,1,1,1,0,-1,-1};
int map[102][102];
int inc=1,fin=2;
poz s[10001]; //stiva din lee
char citire[101];
int main()
{
int x,y;
f>>x>>y;
f.get();
for(int i=1;i<=x;i++)
{
f.getline(citire,101);
for(int j=0;j<strlen(citire);j++)
{
if(citire[j]=='R')
{
s[1].x=i;
s[1].y=j+1;
s[1].dis=1;
s[1].pers=2;
}
if(citire[j]=='J')
{
s[2].x=i;
s[2].y=j+1;
s[2].dis=1;
s[2].pers=3;
}
if(citire[j]==' ')
{
map[i][j+1]=1;
}
}
for(int j=strlen(citire)+1;j<=y;j++)
{
map[i][j]=1;
}
}
while(inc<=fin)
{
if((s[inc].pers==3) && (map[s[inc].x][s[inc].y]==2))
{
fin=-1;
g<<s[inc].dis<<" "<<s[inc].x<<" "<<s[inc].y;
}
map[s[inc].x][s[inc].y]=s[inc].pers;
for(int i=1;i<=8;i++)
{
if (map[s[inc].x+dx[i]][s[inc].y+dy[i]]==1)
{
fin++;
s[fin].x=s[inc].x+dx[i];
s[fin].y=s[inc].y+dy[i];
s[fin].pers=s[inc].pers;
s[fin].dis=s[inc].dis+1;
}
}
inc++;
}
return 0;
}