Cod sursa(job #395373)

Utilizator Anonymous1010Chilivercu Cristian Anonymous1010 Data 12 februarie 2010 22:09:21
Problema Rj Scor 0
Compilator c Status done
Runda Arhiva de probleme Marime 1.46 kb
#include<stdio.h>
#include<values.h>
#define N 102

int a[N][N],b[N][N],i,j,i1,j1,i2,j2,n,m;
char ch;

void coada(int aux,int bux,int v[N][N])
{
	int c[10000][2],ii,jj,k;
	int di[8]={1,1,1,0,0,-1,-1,-1};
	int dj[8]={0,1,-1,1,-1,1,0,-1};

	c[1][0]=aux;
	c[1][1]=bux;
    v[aux][bux]=1;

	j=1;
	k=1;

	for(;j<=k;j++)
	{
		ii=v[j][0];
		jj=v[j][1];

		for(i=0;i<=7;i++)
			if(v[ii+di[i]][jj+dj[i]]==0)
			{
				v[ii+di[i]][jj+dj[i]]=v[ii][jj]+1;
				k++;
				c[k][0]=ii+di[i];
				c[k][1]=jj+dj[i];

			}
	}
}

void rezolva()
{
	int min,x,y;

	min=32000;

	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			if(a[i][j]==b[i][j]&&a[i][j]>0&&min>a[i][j])
			{
				min=a[i][j];
				x=i;
				y=j;
			}

	printf("%d %d %d",min,x,y);
}

int main()
{
	freopen("rj.in","r",stdin);
	freopen("rj.out","w",stdout);

	scanf("%d %d\n",&n,&m);


	for(i=1;i<=n;i++)
	{

		for(j=1;j<=m;j++)
		{
			scanf("%c",&ch);

			if(ch=='R')
			{
				i1=i;
				j1=j;
			}
			else
			{
				if(ch=='J')
				{
					i2=i;
					j2=j;
				}
				else
				{
					if(ch=='X')
					{
						a[i][j]=-1;
						b[i][j]=-1;
					}
					else
					{
						a[i][j]=0;
						b[i][j]=0;
					}
				}
			}
		}

		scanf("%c",&ch);
	}

	for(i=0;i<=n+1;i++)
		a[i][0]=-1,a[i][m+1]=-1,b[i][0]=-1,b[i][m+1]=-1;
	for(i=0;i<=m+1;i++)
		a[0][i]=-1,a[n+1][i]=-1,b[0][i]=-1,b[n+1][i]=-1;

	coada(i1,j1,a);
	coada(i2,j2,b);

	rezolva();

	return 0;
}