1a:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1e:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T53c,#include using namespace std; int main() { int n, m; cin >> n >> m; vector grid(n); for (auto &row : grid) cin >> row; int si=-1,sj=-1,fi=-1,fj=-1; for (int i=0;i>> dist(n, vector>(m, {-1,-1})); queue> q; dist[si][sj][0]=0; q.push({si,sj,0}); int di[]={-1,1,0,0}, dj[]={0,0,-1,1}; while(!q.empty()) { auto [ci,cj,cb]=q.front(); q.pop(); for (int d=0; d<4; d++) { int ni=ci+di[d], nj=cj+dj[d]; if (ni<0||ni>=n||nj<0||nj>=m) continue; if (grid[ni][nj]!='#') { if (dist[ni][nj][cb]==-1) { dist[ni][nj][cb]=dist[ci][cj][cb]+1; q.push({ni,nj,cb}); } } else if (cb==0) { if (dist[ni][nj][1]==-1) { dist[ni][nj][1]=dist[ci][cj][cb]+1; q.push({ni,nj,1}); } } } } int rez = -1; if (dist[fi][fj][0]!=-1) rez = dist[fi][fj][0]; if (dist[fi][fj][1]!=-1 && (rez==-1 || dist[fi][fj][1] using namespace std; int main() { int n, m; cin >> n >> m; vector grid(n); for (auto &row : grid) cin >> row; int si=-1,sj=-1,fi=-1,fj=-1; for (int i=0;i>> dist(n, vector>(m, {-1,-1})); queue> q; dist[si][sj][0]=0; q.push({si,sj,0}); int di[]={-1,1,0,0}, dj[]={0,0,-1,1}; while(!q.empty()) { auto [ci,cj,cb]=q.front(); q.pop(); for (int d=0; d<4; d++) { int ni=ci+di[d], nj=cj+dj[d]; if (ni<0||ni>=n||nj<0||nj>=m) continue; if (grid[ni][nj]!='#') { if (dist[ni][nj][cb]==-1) { dist[ni][nj][cb]=dist[ci][cj][cb]+1; q.push({ni,nj,cb}); } } else if (cb==0) { if (dist[ni][nj][1]==-1) { dist[ni][nj][1]=dist[ci][cj][cb]+1; q.push({ni,nj,1}); } } } } int rez = -1; if (dist[fi][fj][0]!=-1) rez = dist[fi][fj][0]; if (dist[fi][fj][1]!=-1 && (rez==-1 || dist[fi][fj][1]= n or nj < 0 or nj >= m: continue if grid[ni][nj] != "#": if dist[ni][nj][cb] == -1: dist[ni][nj][cb] = dist[ci][cj][cb] + 1 q.append((ni, nj, cb)) elif cb == 0: if dist[ni][nj][1] == -1: dist[ni][nj][1] = dist[ci][cj][cb] + 1 q.append((ni, nj, 1)) rez = -1 if dist[fi][fj][0] != -1: rez = dist[fi][fj][0] if dist[fi][fj][1] != -1 and (rez == -1 or di