#504156 (C++17) No.424 立体迷路

• 問題: No.424 立体迷路
• ユーザー: tanimani364
• 提出日時: 2020-06-27 17:18:20
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 25 ms / 2,000 ms
• コード長: 2,355 bytes
• コンパイル時間: 2,021 ms
• コンパイル使用メモリ: 207,160 KB
• 最終ジャッジ日時: 2025-01-11 12:53:58
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 5
other	AC * 21

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
ll gcd(ll n, ll m)
{
    ll tmp;
    while (m != 0)
    {
        tmp = n % m;
        n = m;
        m = tmp;
    }
    return n;
}
ll lcm(ll n, ll m)
{
    return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
vector<vector<int>> grid_bfs(int h,int w,int x,int y,vector<string> &maze,char obstacle='#') {
  const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };//4方向移動
  const int init=1e7;
  vector<vector<int>>d(h,vector<int>(w,init));
  d[x][y]=0;
  queue<pair<int, int>>q;
    pair<int, int>p;
  q.emplace(x,y);
    while (!q.empty()) {
        p = q.front();
        q.pop();
        for (int i = 0; i < 4; ++i) {
            int nx = p.first+dx[i]; int ny = p.second+dy[i];
            if (0 <= nx && nx < h && 0 <= ny && ny < w && maze[nx][ny] != obstacle && d[nx][ny] == init) {
                if(abs(maze[nx][ny]-maze[p.first][p.second])>1)continue;
                q.push(make_pair(nx, ny));
                d[nx][ny] = d[p.first][p.second] + 1;
            }
        }
        for (int i = 0; i < 4; ++i) {
            int nx = p.first+dx[i]*2; int ny = p.second+dy[i]*2;
            if (0 <= nx && nx < h && 0 <= ny && ny < w && maze[nx][ny] != obstacle && d[nx][ny] == init) {
                if(abs(maze[nx][ny]-maze[p.first][p.second])>0)continue;
                if(maze[p.first+dx[i]][p.second+dy[i]]>=maze[p.first][p.second])continue;
                q.push(make_pair(nx, ny));
                d[nx][ny] = d[p.first][p.second] + 1;
            }
        }
    }
  return d;//initを含むことに注意
}
void solve()
{
    int h,w;
    cin>>h>>w;
    int sx,sy,gx,gy;
    cin>>sx>>sy>>gx>>gy;
    sx--;sy--;gx--;gy--;
    vector<string>s(h);
    rep(i,h)cin>>s[i];
    auto d=grid_bfs(h,w,sx,sy,s);
    if(d[gx][gy]==1e7){
        cout<<"NO\n";
    }
    else cout<<"YES\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX