Pagini recente » Cod sursa (job #2680993) | Cod sursa (job #564473) | Cod sursa (job #1148028) | Cod sursa (job #1375510) | Cod sursa (job #186209)
Cod sursa(job #186209)
#include <stdio.h>
#define SI 1000000
#define Nmax 1011
int b[Nmax][Nmax],a[Nmax][Nmax];
struct punct{int c1,c2;};
punct plec,sos;
short int va[Nmax*Nmax*10];
short int vb[Nmax*Nmax*10];
int nrv;
const int lin[]={0,1,0,-1};
const int col[]={1,0,-1,0};
int rez,R,C;
inline int minim(int x,int y)
{
if(x<y)
return x;
return y;
}
void read()
{
char ch;
freopen("barbar.in", "r",stdin);
freopen("barbar.out", "w",stdout);
scanf("%d%d", &R,&C);
for(int i=1;i<=R;++i)
{
scanf("%c", &ch);
for(int j=1;j<=C;++j)
{
scanf("%c", &ch);
if(ch=='I')
{
a[i][j]=SI;
plec.c1=i;
plec.c2=j;
}
if(ch=='O')
{
a[i][j]=SI;
sos.c1=i;
sos.c2=j;
}
if(ch=='.')
a[i][j]=SI;
if(ch=='*')
a[i][j]=-2;
if(ch=='D')
{
a[i][j]=0;
va[++nrv]=i;
vb[nrv]=j;
}
}
}
}
void lee(int x,int y)
{
for(int t=0;t<4;t++)
if((a[x+lin[t]][y+col[t]]>a[x][y]+1))
{
a[x+lin[t]][y+col[t]]=a[x][y]+1;
va[++nrv]=x+lin[t];
vb[nrv]=y+col[t];
}
}
void lee2(int x,int y)
{
for(int t=0;t<4;t++)
if((b[x+lin[t]][y+col[t]]<b[x][y] && (b[x+lin[t]][y+col[t]]==-1 || (b[x+lin[t]][y+col[t]]!=-1 && minim(a[x+lin[t]][y+col[t]],b[x][y])>b[x+lin[t]][y+col[t]]) )))
{
b[x+lin[t]][y+col[t]]=minim(a[x+lin[t]][y+col[t]],b[x][y]);
va[++nrv]=x+lin[t];
vb[nrv]=y+col[t];
}
}
void make_lee()
{
for(int i=1;i<=nrv;i++)
lee(va[i],vb[i]);
//printf("%d\n",nrv);
for(int i=1;i<=R;++i)
for(int j=1;j<=C;++j)
b[i][j]=-1;
b[plec.c1][plec.c2]=a[plec.c1][plec.c2];
va[1]=plec.c1;
vb[1]=plec.c2;
nrv=1;
for(int i=1;i<=nrv;i++)
lee2(va[i],vb[i]);
//printf("%d\n",nrv);
rez=b[sos.c1][sos.c2];
printf("%d\n",rez);
}
int main()
{
read();
make_lee();
return 0;
}