結果

問題 No.971 いたずらっ子
ユーザー commycommy
提出日時 2022-09-21 00:51:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,648 ms / 2,000 ms
コード長 7,962 bytes
コンパイル時間 1,366 ms
コンパイル使用メモリ 116,880 KB
実行使用メモリ 362,568 KB
最終ジャッジ日時 2023-08-23 19:45:39
合計ジャッジ時間 14,928 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,648 ms
362,420 KB
testcase_01 AC 1,625 ms
362,560 KB
testcase_02 AC 1,180 ms
272,556 KB
testcase_03 AC 1,533 ms
362,568 KB
testcase_04 AC 1,399 ms
341,504 KB
testcase_05 AC 1,222 ms
362,384 KB
testcase_06 AC 925 ms
281,228 KB
testcase_07 AC 12 ms
5,928 KB
testcase_08 AC 362 ms
97,304 KB
testcase_09 AC 349 ms
92,876 KB
testcase_10 AC 9 ms
6,236 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 3 ms
4,376 KB
testcase_15 AC 2 ms
4,376 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 2 ms
4,380 KB
testcase_24 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

#include <limits>
#include <cmath>
#include <queue>
#include <deque>
enum class CostType {
    NoEdge,
    One,
    ZeroOne,
    Plus,
    PlusMinus,
};

template<typename Cost = long long, typename Vertex = int>
class Graph {
    using Edge = pair<Cost, Vertex>;
    using ShortestInfo = pair<vector<Cost>, vector<Vertex>>;

    vector<vector<Edge>> g;
    CostType cost_type;

    ShortestInfo no_edge(Vertex s) {
        auto costs = vector<Cost>(g.size(), Inf);
        auto prev = vector<Vertex>(g.size(), None);
        costs[s] = 0;
        return make_pair(move(costs), move(prev));
    }

    ShortestInfo bfs01(Vertex s) {
        auto [costs, prev] = no_edge(s);
        deque<Edge> deq;
        deq.emplace_back(0, s);
        while (deq.size()) {
            auto [c, v] = deq.front();
            deq.pop_front();
            if (costs[v] < c) continue;
            for (auto &&[nc, nv] : adjacent(v)) {
                if (costs[nv] > c + nc) {
                    costs[nv] = c + nc;
                    if (nc == 0) {
                        deq.emplace_front(c, nv);
                    } else {
                        deq.emplace_back(c + 1, nv);
                    }
                    prev[nv] = v;
                }
            }
        }
        return make_pair(move(costs), move(prev));
    }

    ShortestInfo bfs(Vertex s) {
        auto [costs, prev] = no_edge(s);
        queue<Edge> que;
        que.emplace(0, s);
        while (que.size()) {
            auto [c, v] = que.front();
            que.pop();
            if (costs[v] < c) continue;
            for (auto &&[nc, nv] : adjacent(v)) {
                if (costs[nv] > c + nc) {
                    costs[nv] = c + nc;
                    que.emplace(c + nc, nv);
                    prev[nv] = v;
                }
            }
        }
        return make_pair(move(costs), move(prev));
    }

    ShortestInfo dijkstra(Vertex s) {
        auto [costs, prev] = no_edge(s);
        priority_queue<Edge, vector<Edge>, greater<Edge>> pq;
        pq.emplace(0, s);
        while (pq.size()) {
            auto [c, v] = pq.top();
            pq.pop();
            if (costs[v] < c) continue;
            for (auto &&[nc, nv] : adjacent(v)) {
                if (costs[nv] > c + nc) {
                    costs[nv] = c + nc;
                    pq.emplace(c + nc, nv);
                    prev[nv] = v;
                }
            }
        }
        return make_pair(move(costs), move(prev));
    }

    ShortestInfo bellman_ford(Vertex s) {
        auto [costs, prev] = no_edge(s);
        for (size_t i = 0, n = g.size(); i < 2 * n; i++) {
            for (Vertex v = 0; v < static_cast<Vertex>(n); v++) {
                if (costs[v] == Inf) continue;
                for (auto &&[cost, nv] : adjacent(v)) {
                    if (costs[v] == -Inf || costs[v] + cost < costs[nv]) {
                        if (i >= n) {
                            costs[nv] = -Inf;
                        } else {
                            costs[nv] = costs[v] + cost;
                        }
                        prev[nv] = v;
                    }
                }
            }
        }
        return make_pair(move(costs), move(prev));
    }

    void update_cost_type(Cost cost) {
        CostType ct = CostType::NoEdge;
        if (signbit(cost)) {
            ct = CostType::PlusMinus;
        } else if (cost != 0 && cost != 1) {
            ct = CostType::Plus;
        } else if (cost == 0) {
            ct = CostType::ZeroOne;
        } else if (cost == 1) {
            ct = CostType::One;
        }
        cost_type = static_cast<CostType>(max(static_cast<int>(ct), static_cast<int>(cost_type)));
    }

public:
    Graph(size_t n) : g(n), cost_type(CostType::NoEdge) {}
    void add_edge(Vertex s, Vertex t, Cost cost) {
        update_cost_type(cost);
        g[s].emplace_back(cost, t);
    }
    const vector<Edge> &adjacent(Vertex v) const {
        return g[v];
    }
    size_t size() const {
        return g.size();
    }

    CostType get_cost_type() const {
        return cost_type;
    }

    ShortestInfo shortest(Vertex s) {
        switch (cost_type) {
            case CostType::ZeroOne:
                return bfs01(s);
            case CostType::One:
                return bfs(s);
            case CostType::Plus:
                return dijkstra(s);
            case CostType::PlusMinus:
                return bellman_ford(s);
            case CostType::NoEdge:
                return no_edge(s);
        }
        __builtin_unreachable();
    }

    constexpr static Cost Inf = numeric_limits<Cost>::max();
    constexpr static Vertex None = -1;
};

template<typename Cost = long long, typename Vertex = int>
class GridGraphWrapper : public Graph<Cost, Vertex> {
    vector<vector<Cost>> map;
    constexpr static int Dx[] = {0, 1};
    constexpr static int Dy[] = {1, 0};
    Vertex flatten(Vertex y, Vertex x) {
        return y * static_cast<Vertex>(map[0].size()) + x;
    }
    bool isin(Vertex y, Vertex x) {
        return 0 <= y && y < static_cast<Vertex>(map.size()) && 0 <= x && x < static_cast<Vertex>(map[y].size());
    }

public:
    GridGraphWrapper(size_t h, size_t w) : Graph<Cost, Vertex>(h * w), map(h, vector<Cost>(w, Block)) {}

    void set_cost(Vertex y, Vertex x, Cost c) {
        map[y][x] = c;
    }
    void build() {
        for (Vertex y = 0; y < static_cast<Vertex>(map.size()); y++) {
            for (Vertex x = 0; x < static_cast<Vertex>(map[y].size()); x++) {
                if (map[y][x] == Block) continue;
                Vertex id = flatten(y, x);
                for (size_t k = 0; k < ::size(Dx); k++) {
                    Vertex nx = x + Dx[k], ny = y + Dy[k];
                    if (isin(ny, nx) && map[ny][nx] != Block) {
                        Vertex nid = flatten(ny, nx);
                        this->add_edge(id, nid, map[ny][nx]);
                    }
                }
            }
        }
    }
    constexpr static Cost Block = Graph<Cost, Vertex>::Inf;
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    cin, h, w;
    GridGraphWrapper<> g(h, w);
    rep(i, 0, h) {
        rep(j, 0, w) {
            char c;
            cin, c;
            if (c == 'k') {
                g.set_cost(i, j, i + j + 1);
            } else {
                g.set_cost(i, j, 1);
            }
        }
    }
    g.build();
    auto [cost, prev] = g.shortest(0);
    print(cost[h * w - 1]);
    return 0;
}
0