結果
問題 | No.2328 Build Walls |
ユーザー |
![]() |
提出日時 | 2023-05-28 13:55:51 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 148 ms / 3,000 ms |
コード長 | 3,443 bytes |
コンパイル時間 | 1,588 ms |
コンパイル使用メモリ | 134,824 KB |
最終ジャッジ日時 | 2025-02-13 10:29:00 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#ifndef LOCAL#define FAST_IO#endif// ============#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cmath>#include <iomanip>#include <iostream>#include <list>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define OVERRIDE(a, b, c, d, ...) d#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)#define ALL(x) begin(x), end(x)using namespace std;using u32 = unsigned int;using u64 = unsigned long long;using i32 = signed int;using i64 = signed long long;using f64 = double;using f80 = long double;template <typename T>using Vec = vector<T>;template <typename T>bool chmin(T &x, const T &y) {if (x > y) {x = y;return true;}return false;}template <typename T>bool chmax(T &x, const T &y) {if (x < y) {x = y;return true;}return false;}template <typename T>Vec<tuple<i32, i32, T>> runlength(const Vec<T> &a) {if (a.empty()) {return Vec<tuple<i32, i32, T>>();}Vec<tuple<i32, i32, T>> ret;i32 prv = 0;REP(i, 1, a.size()) {if (a[i - 1] != a[i]) {ret.emplace_back(prv, i, a[i - 1]);prv = i;}}ret.emplace_back(prv, (i32)a.size(), a.back());return ret;}#ifdef INT128using u128 = __uint128_t;using i128 = __int128_t;istream &operator>>(istream &is, i128 &x) {i64 v;is >> v;x = v;return is;}ostream &operator<<(ostream &os, i128 x) {os << (i64)x;return os;}istream &operator>>(istream &is, u128 &x) {u64 v;is >> v;x = v;return is;}ostream &operator<<(ostream &os, u128 x) {os << (u64)x;return os;}#endif[[maybe_unused]] constexpr i32 INF = 1000000100;[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;struct SetUpIO {SetUpIO() {#ifdef FAST_IOios::sync_with_stdio(false);cin.tie(nullptr);#endifcout << fixed << setprecision(15);}} set_up_io;// ============#ifdef DEBUGF#else#define DBG(x) (void)0#endifint main() {i32 h, w;cin >> h >> w;h -= 2;Vec<Vec<i64>> a(h, Vec<i64>(w));REP(i, h) REP(j, w) {cin >> a[i][j];}Vec<Vec<i64>> dist(h, Vec<i64>(w, INF64));priority_queue<tuple<i64, i32, i32>, Vec<tuple<i64, i32, i32>>, greater<>> pq;REP(i, h) {if (a[i][0] != -1) {dist[i][0] = a[i][0];pq.emplace(a[i][0], i, 0);}}while (!pq.empty()) {auto [d, x, y] = pq.top();pq.pop();if (d > dist[x][y]) {continue;}REP(dx, -1, 2) REP(dy, -1, 2) {i32 tx = x + dx, ty = y + dy;if (0 <= tx && tx < h && 0 <= ty && ty < w && a[tx][ty] != -1 && chmin(dist[tx][ty], d + a[tx][ty])) {pq.emplace(dist[tx][ty], tx, ty);}}}DBG(dist);i64 ans = INF64;REP(i, h) {chmin(ans, dist[i][w - 1]);}if (ans == INF64) {cout << -1 << '\n';} else {cout << ans << '\n';}}