Submission

Score: 0

User: 12345678

Problemset: ย่องเบาหลบกับระเบิด

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-22 20:23:23

#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;

int n, m, mp[nx][nx], dib[]={1, 1, 1, 0, 0, -1, -1, -1}, djb[]={1, 0, -1, 1, -1, 1, 0, -1}, di[]={1, 0, 0, -1}, dj[]={0, 1, -1, 0}, vs[nx][nx], dist[nx][nx], res=INT_MAX;
queue<pair<int, int>> q;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) cin>>mp[i][j], mp[i][j]=!mp[i][j];
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (mp[i][j]==1)
            {
                for (int k=0; k<8; k++)
                {
                    int ni=i+dib[k], nj=j+djb[k];
                    if (ni<1||n<ni||nj<1||m<nj) continue;
                    if (mp[ni][nj]==0) mp[ni][nj]=2;
                }
            }
        }
    }
    for (int i=1; i<=n; i++) if (!mp[i][1]) q.push({i, 1});
    while (!q.empty())
    {
        auto [i, j]=q.front();
        q.pop();
        for (int k=0; k<4; k++)
        {
            int ni=i+di[k], nj=j+dj[k];
            if (ni<1||ni>n||nj<1||nj>m) continue;
            if (!mp[ni][nj]&&!vs[ni][nj]) vs[ni][nj]=1, dist[ni][nj]=dist[i][j]+1, q.push({ni, nj});
        }
    }
    for (int i=1; i<=n; i++) if (vs[i][m]) res=min(res, dist[i][m]);
    if (res==INT_MAX) cout<<-1;
    else cout<<res+1;
}