結果
問題 | No.2328 Build Walls |
ユーザー |
👑 |
提出日時 | 2023-05-28 15:53:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 446 ms / 3,000 ms |
コード長 | 17,134 bytes |
コンパイル時間 | 2,496 ms |
コンパイル使用メモリ | 227,744 KB |
最終ジャッジ日時 | 2025-02-13 14:24:46 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
// line 1 "answer.cpp"#if !__INCLUDE_LEVEL__#include __FILE__int main() {ll h,w;input(h,w);h -= 2;auto a = vv<int>(h,w);input(a);vi from, to; vl cost;BoardHelper bh({h,w});rep(i, h) rep(j, w) {if (a[i][j] == -1) continue;rep(dx, -1, 2) rep(dy, -1, 2) {if (dx == 0 && dy == 0) continue;if (!bh.in_board(i+dx,j+dy)) continue;if (a[i+dx][j+dy] == -1) continue;from.push_back(bh.to_1d(i,j));to.push_back(bh.to_1d(i+dx,j+dy));cost.push_back(a[i+dx][j+dy]);}}rep(i, h) {from.push_back(h*w);to.push_back(bh.to_1d(i, 0));cost.push_back(a[i][0]);from.push_back(bh.to_1d(i, w-1));to.push_back(h*w+1);cost.push_back(0);}Graph g(h*w+2, from, to, cost);debug(g);vl minc;vi prev;dijkstra(g, h*w, minc, prev, INFL);if (minc.back() == INFL) print(-1);else print(minc.back());}#else// line 2 "/Users/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp"#include <bits/stdc++.h>#ifndef LOCAL_TEST#pragma GCC target ("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#endif // LOCAL_TESTusing namespace std;// 型名の短縮using ll = long long;using pii = pair<int, int>; using pll = pair<ll, ll>;using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3,vector<T>(h4, val)))); }template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;// 定数の定義constexpr double PI = 3.14159265358979323;constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;float EPS = 1e-8; double EPSL = 1e-16;template<typename T> bool eq(const T x, const T y) { return x == y; }template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }constexpr int MODINT998244353 = 998244353;constexpr int MODINT1000000007 = 1000000007;// 入出力高速化struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;// 汎用マクロの定義#define all(a) (a).begin(), (a).end()#define sz(x) ((ll)(x).size())#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s);i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define repe(a, v) for(auto& a : (v)) // v の全要素(変更可能)#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };int No(bool b=true) {return Yes(!b);};int NO(bool b=true) {return YES(!b);};template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }// modでのpowll powm(ll a, ll n, ll mod=INFL) {ll res = 1;while (n > 0) {if (n & 1) res = (res * a) % mod;if (n > 1) a = (a * a) % mod;n >>= 1;}return res;}// 整数Sqrtll sqrtll(ll x) {assert(x >= 0);ll rev = sqrt(x);while(rev * rev > x) --rev;while((rev+1) * (rev+1)<=x) ++rev;return rev;}template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら trueを返す)template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら trueを返す)int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数/*** @brief std.hpp* @docs docs/std/std.md*/// line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/graph/graph.hpp"template <class Cost> struct Graph{public:struct Edge {int to;Cost cost;Edge() {};Edge(int _to, Cost _cost) : to(_to), cost(_cost) {};};struct AdjacencyListRange{using iterator = typename std::vector<Edge>::const_iterator;iterator begi, endi;iterator begin() const { return begi; }iterator end() const { return endi; }int size() const { return (int)distance(begi, endi); }const Edge& operator[](int i) const { return begi[i]; }};private:public:vector<Edge> E;vector<int> I;int n;Graph() : n(0) {}Graph(int _n) : n(_n) {}Graph(int _n, const vector<int>& from, vector<int>& to, vector<Cost>& cost, bool rev = false) : n(_n) {vector<int> buf(n+1, 0);for(int i=0; i<(int)from.size(); i++){++buf[from[i]];if (rev) ++buf[to[i]];}for(int i=1; i<=_n; i++) buf[i] += buf[i-1];E.resize(buf[n]);for(int i=(int)from.size()-1; i>=0; i--){int u = from[i];int v = to[i];Cost c = cost[i];E[--buf[u]] = Edge(v, c);if(rev) E[--buf[v]] = Edge(u, c);}I = move(buf);}AdjacencyListRange operator[](int u) const {return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };}int num_vertices() const { return n; }int size() const { return num_vertices(); }int num_edges() const { return E.size(); }Graph<Cost> reversed_edges() const {Graph<Cost> res;int _n = res.n = n;vi buf(n+1, 0);for(auto v : E) ++buf[v.to];for(int i=1; i<=n; i++) buf[i] += buf[i-1];res.E.resize(buf[n]);for(int u=0; u<n; u++) for(auto v : operator[](u)) res.E[--buf[v.to]] = {u, v.cost};res.I = std::move(buf);return res;}};template <class T> ostream& operator<<(ostream& os, Graph<T> g) {bool first = true;rep(i, g.n) repe(e, g[i]) {if (first) first = false;else os << endl;os << i << "->" << e.to << ": " << e.cost;}return os;}/*** @brief graph.hpp* @docs docs/graph/graph.md*/// line 4 "/Users/seekworser/.cpp_lib/competitive_library/competitive/graph/dijkstra.hpp"template<class Cost> void dijkstra(const Graph<Cost>& G, int start, vector<Cost> &min_cost, vector<int> &prev, Cost inf=INF, Cost identity=0){priority_queue<pair<Cost, int>, vector<pair<Cost, int>>, greater<pair<Cost, int>>> que;min_cost = vector<Cost>(G.n, inf);min_cost[start] = identity;prev = vector<int>(G.n);que.emplace(identity, start);while(que.size()){Cost d = que.top().first;int u = que.top().second;que.pop();if (min_cost[u] < d) continue;for(auto e : G[u]){int v = e.to;Cost cost_to = d + e.cost;if(min_cost[v] > cost_to) {min_cost[v] = cost_to;que.emplace(cost_to, v);prev[v] = u;}}}return;}/*** @brief dijkstra.hpp* @docs docs/graph/dijkstra.md*/// line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/helper/board_helper.hpp"const vector<pii> DXY = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};const vector<pii> DDXY = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};const vector<tuple<int, int, int>> DXYZ = {{-1, 0, 0}, {1, 0, 0}, {0, -1, 0}, {0, 1, 0}, {0, 0, -1}, {0, 0, 1}};class BoardHelper{private:ll oned_size;vector<ll> mul_for_dim;public:int dimension;vector<ll> board_size;BoardHelper (vector<ll> bs) : mul_for_dim(bs.size()), dimension(bs.size()), board_size(bs) {mul_for_dim[dimension-1] = 1;for (int i=dimension - 2; i >= 0; i--) {mul_for_dim[i] = mul_for_dim[i+1] * board_size[i+1];}oned_size = mul_for_dim[0] * board_size[0];}template<typename... Arg> ll to_1d(Arg... ind) {int count = 0;ll rev = 0;for (ll i : initializer_list<ll>{ind...}) {assert(count < dimension);assert(0 <= i && i < board_size[count]);rev += i * mul_for_dim[count];count++;}assert(count == dimension);return rev;}vector<ll> to_nd(ll ind) {assert(0 <= ind && ind < oned_size);vector<ll> rev;for (int i=0; i<dimension; i++) {rev.push_back(ind / mul_for_dim[i]);ind %= mul_for_dim[i];}return rev;}bool in_board(const vector<ll> &ind) {if (sz(ind) != dimension) return false;bool rev = true;for (int i=0; i<dimension; i++) {if (ind[i] < 0 || board_size[i] <= ind[i]) {rev = false;break;}}return rev;}template<typename... Arg> bool in_board(Arg... ind) {int count = 0;for (ll i : initializer_list<ll>{ind...}) {if (count >= dimension) return false;if (i < 0 || board_size[count] <= i) {return false;}count++;}return true;}};/*** @brief board_helper.hpp* @docs docs/helper/board_helper.md*/// line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp"// 演算子オーバーロード(プロトタイプ宣言)template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);template <class T> inline istream& operator>>(istream& is, vector<T>& v);template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);template <typename T> ostream &operator<<(ostream &os, const set<T> &st);template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);template <typename T> ostream &operator<<(ostream &os, queue<T> q);template <typename T> ostream &operator<<(ostream &os, deque<T> q);template <typename T> ostream &operator<<(ostream &os, stack<T> st);template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);// 演算子オーバーロードtemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; }return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << ""; } return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os<< *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) {os << pq.top() << " "; pq.pop(); } return os; }template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {cout << val << sep;print_sep_end(sep, end, remain...);return 0;};template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; };template <typename... T> void flush() { cout << flush; };template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug printtemplate <typename T> void input(T &a) { cin >> a; };template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };#ifdef LOCAL_TESTtemplate <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {int scope = 0;for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {cerr << name[i];if (name[i] == '(' || name[i] == '{') scope++;if (name[i] == ')' || name[i] == '}') scope--;}cerr << ":" << a << " ";debug_func(i + 1, name, b...);}template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {int scope = 0;for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {cerr << name[i];if (name[i] == '(' || name[i] == '{') scope++;if (name[i] == ')' || name[i] == '}') scope--;}cerr << ":" << a << " ";debug_func(i + 1, name, b...);}#endif#ifndef LOCAL_TESTtemplate <typename... T>void debug_func(T &...) {}template <typename... T>void debug_func(const T &...) {}#endif/*** @brief io.hpp* @docs docs/std/io.md*/// line 43 "answer.cpp"#endif