結果

問題 No.1638 Robot Maze
ユーザー SumitacchanSumitacchan
提出日時 2021-08-06 21:32:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 8 ms / 2,000 ms
コード長 4,148 bytes
コンパイル時間 2,664 ms
コンパイル使用メモリ 218,072 KB
実行使用メモリ 5,300 KB
最終ジャッジ日時 2023-10-17 02:50:51
合計ジャッジ時間 4,471 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 7 ms
5,300 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 1 ms
4,348 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 2 ms
4,348 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 2 ms
4,348 KB
testcase_14 AC 6 ms
5,124 KB
testcase_15 AC 4 ms
5,036 KB
testcase_16 AC 4 ms
5,036 KB
testcase_17 AC 5 ms
5,036 KB
testcase_18 AC 4 ms
5,036 KB
testcase_19 AC 4 ms
5,036 KB
testcase_20 AC 4 ms
5,036 KB
testcase_21 AC 5 ms
5,080 KB
testcase_22 AC 4 ms
5,080 KB
testcase_23 AC 4 ms
5,080 KB
testcase_24 AC 4 ms
5,080 KB
testcase_25 AC 5 ms
5,080 KB
testcase_26 AC 5 ms
5,084 KB
testcase_27 AC 5 ms
5,084 KB
testcase_28 AC 5 ms
5,084 KB
testcase_29 AC 5 ms
5,084 KB
testcase_30 AC 2 ms
4,348 KB
testcase_31 AC 2 ms
4,348 KB
testcase_32 AC 6 ms
5,300 KB
testcase_33 AC 6 ms
5,300 KB
testcase_34 AC 7 ms
5,300 KB
testcase_35 AC 7 ms
5,300 KB
testcase_36 AC 7 ms
5,300 KB
testcase_37 AC 7 ms
5,300 KB
testcase_38 AC 7 ms
5,300 KB
testcase_39 AC 7 ms
5,300 KB
testcase_40 AC 7 ms
5,300 KB
testcase_41 AC 8 ms
5,300 KB
testcase_42 AC 7 ms
5,300 KB
testcase_43 AC 7 ms
5,300 KB
testcase_44 AC 8 ms
5,300 KB
testcase_45 AC 7 ms
5,300 KB
testcase_46 AC 7 ms
5,300 KB
testcase_47 AC 7 ms
5,300 KB
testcase_48 AC 7 ms
5,300 KB
testcase_49 AC 7 ms
5,300 KB
testcase_50 AC 6 ms
5,300 KB
testcase_51 AC 7 ms
5,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

template<typename T> 
struct edge{ int to; T cost; int id; };

template<typename T = long long>
struct Graph
{

    int N;
    vector<vector<edge<T>>> E;

    Graph(int N): N(N){
        E = vector<vector<edge<T>>>(N, vector<edge<T>>(0));
    }

    void add_Directed_edge(int from, int to, T cost = 1, int id = 0){
        E[from].push_back(edge<T>({ to, cost, id }));
    }

    void add_Undirected_edge(int v1, int v2, T cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    vector<T> dijkstra(int s, T T_INF = INF){
        using PTi = pair<T, int>;

        vector<T> d(N);
        priority_queue<PTi, vector<PTi>, greater<PTi>> que;
        fill(d.begin(), d.end(), T_INF);
        d[s] = 0;
        que.push(PTi(0, s));

        while(!que.empty()){
            PTi p = que.top(); que.pop();
            int v = p.second;
            if(d[v] < p.first) continue;

            for(auto e: E[v]){
                if(d[e.to] > d[v] + e.cost){
                    d[e.to] = d[v] + e.cost;
                    que.push(PTi(d[e.to], e.to));
                }
            }
        }
        return d;
    }

};

signed main(){

    int H, W; cin >> H >> W;
    int U, D, R, L, K, P; cin >> U >> D >> R >> L >> K >> P;
    int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;
    x0--; y0--; x1--; y1--;
    vector<string> C(H); cin >> C;

    Graph G(2 * H * W);
    REP(i, H) REP(j, W){
        int v = i * W + j;
        if(i > 0) G.add_Directed_edge(v, v - W + H * W, U);
        if(i < H - 1) G.add_Directed_edge(v, v + W + H * W, D);
        if(j > 0) G.add_Directed_edge(v, v - 1 + H * W, L);
        if(j < W - 1) G.add_Directed_edge(v, v + 1 + H * W, R);
    }
    REP(i, H) REP(j, W){
        int v = i * W + j;

        int cost = INF;
        if(C[i][j] == '.') cost = 0;
        else if(C[i][j] == '@') cost = P;

        if(cost < INF) G.add_Directed_edge(v + H * W, v, cost);
    }

    int ans = G.dijkstra(x0 * W + y0)[x1 * W + y1];
    chOut(ans <= K, "Yes", "No");

    return 0;
}
0