結果

問題 No.2328 Build Walls
ユーザー tokusakuraitokusakurai
提出日時 2023-05-28 15:44:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 571 ms / 3,000 ms
コード長 6,875 bytes
コンパイル時間 2,309 ms
コンパイル使用メモリ 216,012 KB
実行使用メモリ 271,568 KB
最終ジャッジ日時 2023-08-27 12:50:14
合計ジャッジ時間 9,840 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,384 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 145 ms
56,884 KB
testcase_14 AC 132 ms
56,052 KB
testcase_15 AC 112 ms
40,996 KB
testcase_16 AC 22 ms
10,236 KB
testcase_17 AC 125 ms
42,932 KB
testcase_18 AC 5 ms
4,396 KB
testcase_19 AC 17 ms
8,500 KB
testcase_20 AC 11 ms
6,664 KB
testcase_21 AC 65 ms
27,048 KB
testcase_22 AC 213 ms
91,884 KB
testcase_23 AC 430 ms
149,524 KB
testcase_24 AC 418 ms
141,084 KB
testcase_25 AC 439 ms
147,700 KB
testcase_26 AC 378 ms
121,212 KB
testcase_27 AC 410 ms
136,032 KB
testcase_28 AC 87 ms
38,448 KB
testcase_29 AC 437 ms
149,300 KB
testcase_30 AC 272 ms
103,772 KB
testcase_31 AC 245 ms
91,392 KB
testcase_32 AC 415 ms
134,284 KB
testcase_33 AC 571 ms
271,568 KB
testcase_34 AC 282 ms
107,224 KB
testcase_35 AC 466 ms
172,256 KB
testcase_36 AC 2 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int popcount(int x) { return __builtin_popcount(x); }
int popcount(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <typename T, bool directed = false>
struct Dijkstra {
    struct edge {
        int to;
        T cost;
        int id;
        edge(int to, T cost, int id) : to(to), cost(cost), id(id) {}
    };

    vector<vector<edge>> es;
    vector<T> d;
    vector<int> pre_v, pre_e;
    const T zero_T, INF_T;
    const int n;
    int m;

    Dijkstra(int n, T zero_T = 0, T INF_T = numeric_limits<T>::max() / 2) : es(n), d(n), pre_v(n), pre_e(n), zero_T(zero_T), INF_T(INF_T), n(n), m(0) {}

    void add_edge(int from, int to, T cost) {
        es[from].emplace_back(to, cost, m);
        if (!directed) es[to].emplace_back(from, cost, m);
        m++;
    }

    T shortest_path(int s, int t = 0) {
        fill(begin(d), end(d), INF_T);
        using P = pair<T, int>;
        priority_queue<P, vector<P>, greater<P>> que;
        que.emplace(d[s] = zero_T, s);
        while (!que.empty()) {
            auto [p, i] = que.top();
            que.pop();
            if (p > d[i]) continue;
            for (auto &e : es[i]) {
                if (d[i] + e.cost < d[e.to]) {
                    pre_v[e.to] = i, pre_e[e.to] = e.id;
                    que.emplace(d[e.to] = d[i] + e.cost, e.to);
                }
            }
        }
        return d[t];
    }

    vector<int> restore_path(int s, int t, bool use_id = false) {
        if (d[t] == INF_T) return {};
        vector<int> ret;
        for (int now = t; now != s; now = pre_v[now]) ret.push_back(use_id ? pre_e[now] : now);
        if (!use_id) ret.push_back(s);
        reverse(begin(ret), end(ret));
        return ret;
    }
};

void solve() {
    int H, W;
    cin >> H >> W;

    vector<vector<ll>> a(H - 2, vector<ll>(W));
    rep(i, H - 2) rep(j, W) cin >> a[i][j];

    vector<ll> dp(H - 2, INF), ndp = dp;
    rep(i, H - 2) {
        if (a[i][0] != -1) dp[i] = a[i][0];
    }

    int K = (H - 2) * W;
    Dijkstra<ll, true> G(K + 2);
    int s = K, t = s + 1;

    rep(i, H - 2) {
        if (a[i][0] != -1) G.add_edge(s, W * i, a[i][0]);
        if (a[i][W - 1] != -1) G.add_edge(W * i + W - 1, t, 0);
    }

    rep(i, H - 2) rep(j, W) {
        rep2(di, -1, 2) rep2(dj, -1, 2) {
            int ni = i + di, nj = j + dj;
            if (ni < 0 || ni >= H - 2 || nj < 0 || nj >= W || a[ni][nj] == -1) continue;
            G.add_edge(i * W + j, ni * W + nj, a[ni][nj]);
        }
    }

    // rep(i, H - 2) {
    //     rep(j, W - 1) {
    //         int u = W * i + j, v = W * i + j + 1;
    //         if (a[i][j] != -1 && a[i][j + 1] != -1) {
    //             G.add_edge(u, v, a[i][j + 1]);
    //             G.add_edge(v, u, a[i][j]);
    //         }
    //     }
    // }
    // rep(j, W) {
    //     rep(i, H - 3) {
    //         int u = W * i + j, v = W * (i + 1) + j;
    //         if (a[i][j] != -1 && a[i + 1][j] != -1) {
    //             G.add_edge(u, v, a[i + 1][j]);
    //             G.add_edge(v, u, a[i][j]);
    //         }
    //     }
    // }

    ll ans = G.shortest_path(s, t);
    cout << (ans >= INF ? -1 : ans) << '\n';
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0