#691958 (C++17) No.1638 Robot Maze

• 問題: No.1638 Robot Maze
• ユーザー: sash0
• 提出日時: 2021-08-22 23:24:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 6 ms / 2,000 ms
• コード長: 3,254 bytes
• コンパイル時間: 4,613 ms
• コンパイル使用メモリ: 238,868 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-06 23:00:50
• 合計ジャッジ時間: 4,524 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	5 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	4 ms; 5,248 KB
testcase_15	AC	4 ms; 5,248 KB
testcase_16	AC	3 ms; 5,248 KB
testcase_17	AC	3 ms; 5,248 KB
testcase_18	AC	3 ms; 5,248 KB
testcase_19	AC	3 ms; 5,248 KB
testcase_20	AC	3 ms; 5,248 KB
testcase_21	AC	3 ms; 5,248 KB
testcase_22	AC	3 ms; 5,248 KB
testcase_23	AC	4 ms; 5,248 KB
testcase_24	AC	4 ms; 5,248 KB
testcase_25	AC	3 ms; 5,248 KB
testcase_26	AC	4 ms; 5,248 KB
testcase_27	AC	3 ms; 5,248 KB
testcase_28	AC	3 ms; 5,248 KB
testcase_29	AC	4 ms; 5,248 KB
testcase_30	AC	3 ms; 5,248 KB
testcase_31	AC	2 ms; 5,248 KB
testcase_32	AC	5 ms; 5,248 KB
testcase_33	AC	6 ms; 5,248 KB
testcase_34	AC	6 ms; 5,248 KB
testcase_35	AC	5 ms; 5,248 KB
testcase_36	AC	6 ms; 5,248 KB
testcase_37	AC	6 ms; 5,248 KB
testcase_38	AC	5 ms; 5,248 KB
testcase_39	AC	5 ms; 5,248 KB
testcase_40	AC	5 ms; 5,248 KB
testcase_41	AC	5 ms; 5,248 KB
testcase_42	AC	6 ms; 5,248 KB
testcase_43	AC	6 ms; 5,248 KB
testcase_44	AC	6 ms; 5,248 KB
testcase_45	AC	6 ms; 5,248 KB
testcase_46	AC	6 ms; 5,248 KB
testcase_47	AC	5 ms; 5,248 KB
testcase_48	AC	6 ms; 5,248 KB
testcase_49	AC	6 ms; 5,248 KB
testcase_50	AC	5 ms; 5,248 KB
testcase_51	AC	6 ms; 5,248 KB

ソースコード

// clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcountll
#define ffs __builtin_ffsll
#define ctz __builtin_ctzll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define all(a) (a).begin(), (a).end()

using namespace std;
using namespace __gnu_pbds;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using pll = pair<ll,ll>;
template <typename T> using vec = vector<T>;
using vi = vec<int>;
using vl = vec<ll>;
template <typename T> using que = queue<T>;
template <typename T> using deq = deque<T>;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename K, typename V> using ordered_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename T> T id(T b) {return b;};
template <typename T> void chmax(T &x, T y) {if (x < y) x = y;}
template <typename T> void chmin(T &x, T y) {if (x > y) x = y;}
template <typename S, typename K> bool contains(S &s, K k) { return s.find(k) != s.end(); }
template <typename T> bool getf(T flag, size_t i) { return (flag>>i) & 1; }
template <typename T> T setf(T flag, size_t i) { return flag | (T(1)<<i); }
template <typename T> T unsetf(T flag, size_t i) { return flag & ~(T(1)<<i); }
void fastio() { ios_base::sync_with_stdio(false); cin.tie(nullptr); }
constexpr ll TEN(int n) { if (n == 0) return 1LL; else return 10LL*TEN(n-1); }
// clang-format on

int main() {
    fastio();

    int h, w, u, d, r, l, p;
    ll k;

    cin >> h >> w >> u >> d >> r >> l >> k >> p;
    int xs, ys, xt, yt;
    cin >> xs >> ys >> xt >> yt;
    xs--, ys--, xt--, yt--;
    vec<string> grid(h);
    forn(i, h) cin >> grid[i];

    const ll INF = TEN(16);

    auto idx = [&](int i, int j) {
        return i * w + j;
    };

    const int n = h * w;

    vi di = { -1, 0, 1, 0 };
    vi dj = { 0, 1, 0, -1 };

    auto ok = [&](int i, int j) {
        return 0 <= i and i < h and 0 <= j and j < w and grid[i][j] != '#';
    };

    vi cost = { u, r, d, l };

    vec<vec<pil>> g(n);
    forn(i, h) {
        forn(j, w) {
            forn(k, 4) {
                int newi = i + di[k];
                int newj = j + dj[k];
                if (ok(newi, newj)) {
                    int c = cost[k];

                    if (grid[newi][newj] == '@') c += p;

                    g[idx(i, j)].emplace_back(idx(newi, newj), c);
                }
            }
        }
    }

    priority_queue<pli, vector<pli>, greater<pli>> q;
    q.emplace(0, idx(xs, ys));

    vl dist(n, INF);

    while (!q.empty()) {
        auto [c, u] = q.top();
        q.pop();

        if (dist[u] < c) continue;

        for (auto [v, ec] : g[u]) {

            if (c + ec >= dist[v]) continue;

            dist[v] = c + ec;
            q.emplace(dist[v], v);
        }
    }

    cout << (dist[idx(xt, yt)] <= k ? "Yes" : "No") << endl;

    return 0;
}