Cod sursa(job #733938)

Utilizator robertpoeRobert Poenaru robertpoe Data 13 aprilie 2012 10:51:42
Problema Rj Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.29 kb
#include<fstream>
#include<cstdio>
using namespace std;
ifstream f("rj.in");
ofstream g("rj.out");
typedef struct
{
	int x,y;
}PUNCT;
int dx[]={0, 1, 0, -1, -1, 1, -1, 1};
int dy[]={1, 0, -1, 0, -1, 1,  1,-1};
int n,m,xr,yr,xj,yj;
int r[102][102],j[102][102];
char l[102][102];
int interior (int x,int y)
{
	return(x>=1&&x<=n&&y>=1&&y<=m);
}
void citire()
{
	int i,j;
	char c;
	f>>n>>m;
	f.get(c);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			f.get(c);
			l[i][j]=c;
			if(l[i][j]=='R')
			{
				xr=i;
				yr=j;
				l[i][j]=' ';
			}
			if(l[i][j]=='J')
			{
				xj=i;
				yj=j;
				l[i][j]=' ';
			}
		}
		f.get(c);
	}
}
int lee(int x,int y,int z[102][102])
{
	PUNCT c[10000];
	int p=1,u=1,xv,yv,i,j;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)z[i][j]=0;
	}
	c[u].x=x;
	c[u].y=y;
	z[x][y]=1;
	while(p<=u)
	{
		x=c[p].x;
		y=c[p++].y;
		for(i=0;i<=7;i++)
		{
			xv=x+dx[i];
			yv=y+dy[i];
			if(l[xv][yv]==' '&&z[xv][yv]==0)
			{
				z[xv][yv]=z[x][y]+1;
				c[++u].x=xv;
				c[u].y=yv;
			}
		}
	}
}
int main()
{
	int tmin=102*102+1,xmin=0,ymin=0,i,k;
	citire();
	lee(xr,yr,r);
	lee(xj,yj,j);
	for(i=1;i<=n;i++)
		for(k=1;k<=m;k++)
		{
			if(r[i][k]==j[i][k])
			{
				if(r[i][k]<tmin&&r[i][k]!=0)
				{
					tmin=j[i][k];xmin=i;ymin=k;
				}
			}
		}
		g<<tmin<<" "<<xmin<<" "<<ymin;
		return 0;
}