Cod sursa(job #930521)

Utilizator gapdanPopescu George gapdan Data 27 martie 2013 18:10:21
Problema Rj Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.02 kb
#include<fstream>
#include<cstring>
using namespace std;
fstream f("rj.in",ios::in);
fstream g("rj.out",ios::out);
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,1,0,-1,-1,1,1,-1};
int a[102][102],Nr[102][102],NR[102][102];
int poz1,poz2,n,m,i,j,lp1,lp2,cp1,cp2,y,x;
char t[1001];
struct coada
{
    int l,c;
}C[10000];
int main()
{
    f>>n>>m;
    f.get();
    for(i=1;i<=n;++i)
    {
        a[0][i]=-1;
        a[i][0]=-1;
        a[i][n+1]-1;
        a[n+1][i]=-1;
        f.getline(t,1001);
        for (j=1;j<=n;++j)
        {
            if (t[j-1]==' ') a[i][j]=0;
                else if (t[j-1]=='X') a[i][j]=1;
            if (t[j-1]=='R') {lp1=i;cp1=j;}
                else if (t[j-1]=='J') {lp2=i;cp2=j;}
                NR[i][j]=100000;
                Nr[i][j]=100000;
        }
    }
     int p, u, la, ca, i, lv, cv;
    C[1].l=lp1; C[1].c=cp1;
    Nr[lp1][cp1]=1;
    p=1; u=1;
    while (p<=u)
    {
       la=C[p].l;
       ca=C[p].c;
       for (i=0;i<8;i++)
        {
            lv=la+dx[i];
            cv=ca+dy[i];
            if (a[lv][cv]==0 &&  Nr[lv][cv]>Nr[la][ca]+1)
            {
                ++u;
                C[u].l=lv;
                C[u].c=cv;
                Nr[lv][cv]=1+Nr[la][ca];
            }
        }
        ++p;
    }
    C[1].l=lp2; C[1].c=cp2;
    la=0;ca=0;i=0;lv=0;cv=0;
    NR[lp2][cp2]=1;
    p=1;u=1;
    while (p<=u)
    {
       la=C[p].l;
       ca=C[p].c;
       for (i=0;i<8;i++)
        {
            lv=la + dx[i];
            cv=ca + dy[i];
            if (a[lv][cv] == 0 &&  NR[lv][cv]>NR[la][ca]+1)
            {
                ++u;
                C[u].l=lv;
                C[u].c=cv;
                NR[lv][cv]=1+NR[la][ca];
            }
        }
        ++p;
    }
    int Min=100000;
    for (i=1;i<=n;++i)
        for (j=1;j<=n;++j)
            if (Nr[i][j]==NR[i][j] && Nr[i][j]!=100000)
                if (Nr[i][j]<Min) {Min=Nr[i][j];poz1=i;poz2=j;}
    g<<Min<<' '<<poz1<<' '<<poz2;
    return 0;

}