Pagini recente » Cod sursa (job #2679809) | Cod sursa (job #376159) | Cod sursa (job #3218488) | Cod sursa (job #1650738) | Cod sursa (job #2317226)
#include <fstream>
#include <cstring>
#define DIM 1010
#define x first
#define y second
using namespace std;
ifstream fin("barbar.in");
ofstream fout("barbar.out");
int r,c,i,j,a[DIM][DIM],istart,jstart,istop,jstop,iv,jv,k,st,dr,mid,d[DIM][DIM],ok,p,u;
int di[]={-1,1,0,0};
int dj[]={0,0,-1,1};
pair<int,int> v[DIM];
char ch[DIM][DIM];
int main() {
fin>>r>>c;
for (i=1;i<=r;i++)
for (j=1;j<=c;j++) {
fin>>ch[i][j];
if (ch[i][j]=='I') {
ch[i][j]='.';
istart=i;
jstart=j;
}
if (ch[i][j]=='O') {
ch[i][j]='.';
istop=i;
jstop=j;
}
if (ch[i][j]=='D') {
ch[i][j]='.';
a[i][j]=1;
u++;
v[u].x=i; v[u].y=j;
}
}
p=1;
while (p<=u) {
i=v[p].x; j=v[p].y;
for (int dir=0;dir<4;dir++) {
iv=i+di[dir];
jv=j+dj[dir];
if (iv>=1&&iv<=r&&jv>=1&&jv<=c&&ch[iv][jv]=='.'&&a[iv][jv]==0) {
u++;
v[u].x=iv; v[u].y=jv;
a[iv][jv]=1+a[i][j];
}
}
p++;
}
st=1, dr=a[v[u].x][v[u].y];
while (st<dr) { //caut binar numai celule cu distanta pana la dragoni >=mid, de la istart,jstart la istop,jstop
mid=(st+dr)/2; ok=0;
if (a[istart][jstart]<mid)
ok=0;
else {
memset(d,0,sizeof(d));
d[istart][jstart]=1;
v[1].x=istart; v[1].y=jstart;
p=u=1;
while (p<=u&&ok==0) {
i=v[p].x; j=v[p].y;
for (int dir=0;dir<4;dir++) {
iv=i+di[dir];
jv=j+dj[dir];
if (iv>=1&&iv<=r&&jv>=1&&jv<=c&&a[iv][jv]>=mid&&d[iv][jv]==0) {
u++;
v[u].x=iv; v[u].y=jv;
d[iv][jv]=1;
if (iv==istop&&jv==jstop) {
ok=1; break;
}
}
}
p++;
}
}
if (ok==1)
st=mid+1;
else
dr=mid-1;
}
fout<<dr-1;
return 0;
}