結果

問題 No.2328 Build Walls
ユーザー hamathhamath
提出日時 2023-05-28 14:33:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 181 ms / 3,000 ms
コード長 6,046 bytes
コンパイル時間 3,158 ms
コンパイル使用メモリ 234,636 KB
実行使用メモリ 18,432 KB
最終ジャッジ日時 2024-06-08 05:44:23
合計ジャッジ時間 6,424 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 34 ms
11,264 KB
testcase_14 AC 52 ms
7,168 KB
testcase_15 AC 44 ms
7,040 KB
testcase_16 AC 8 ms
5,376 KB
testcase_17 AC 45 ms
8,320 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 6 ms
5,376 KB
testcase_20 AC 5 ms
5,376 KB
testcase_21 AC 28 ms
10,496 KB
testcase_22 AC 80 ms
9,088 KB
testcase_23 AC 178 ms
18,432 KB
testcase_24 AC 173 ms
18,432 KB
testcase_25 AC 178 ms
18,304 KB
testcase_26 AC 145 ms
18,304 KB
testcase_27 AC 165 ms
18,432 KB
testcase_28 AC 61 ms
18,304 KB
testcase_29 AC 181 ms
18,432 KB
testcase_30 AC 65 ms
18,304 KB
testcase_31 AC 64 ms
18,304 KB
testcase_32 AC 164 ms
18,304 KB
testcase_33 AC 179 ms
18,432 KB
testcase_34 AC 66 ms
18,304 KB
testcase_35 AC 172 ms
18,304 KB
testcase_36 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/functional:59,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:71,
                 from main.cpp:9:
In copy constructor 'std::function<_Res(_ArgTypes ...)>::function(const std::function<_Res(_ArgTypes ...)>&) [with _Res = bool; _ArgTypes = {std::pair<long long int, long long int>, std::pair<long long int, long long int>}]',
    inlined from 'std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<long long int, long long int>; _Sequence = std::vector<std::pair<long long int, long long int> >; _Compare = std::function<bool(std::pair<long long int, long long int>, std::pair<long long int, long long int>)>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_queue.h:566:28,
    inlined from 'void dijkstra(const std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)' at main.cpp:85:6:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h:391:17: warning: '<anonymous>' may be used uninitialized [-Wmaybe-uninitialized]
  391 |             __x._M_manager(_M_functor, __x._M_functor, __clone_functor);
      |             ~~~~^~~~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h: In function 'void dijkstra(const std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)':
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h:267:7: note: by argument 2 of type 'const std::_Any_data&' to 'static bool std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_manager(std::_Any_data&, const std::_Any_data&, std::_Manager_operation) [with _Res = bool; _Functor = dijkstra(const std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)::<lambda(P, P)>; _ArgTypes = {std::pair<long long i

ソースコード

diff # 

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#endif

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<VP> VVP;
typedef vector<Vec> VV;
typedef vector<Vi> VVi;
typedef vector<Vc> VVc;
typedef vector<VV> VVV;
typedef vector<VVV> VVVV;
#define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__))
#define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__))
#define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__)))
#define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__)))))

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 4'000'000'000'000'000'010LL;
const ll MOD=998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#define SUM(a) accumulate(ALL(a),0LL)
#define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>auto lb(vector<T> &X, T x){return lower_bound(ALL(X),x) - X.begin();}
template<class T>auto ub(vector<T> &X, T x){return upper_bound(ALL(X),x) - X.begin();}
ll popcnt(ll x){return __builtin_popcount(x);}
ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}
ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;};
ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;};

template<typename T1, typename T2>istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {bool f = false;for(const auto &d: v) {if(f) os<<" ";f = true;os<<d;}return os;}
template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template<class T, class U>ostream &operator<<(ostream &os, const map<T, U> &s) {bool f = false;os<<endl;for(auto p: s) {if(f) os<<endl;f = true;os<<p.first<<": "<<p.second;}return os<<endl;}
void out() { cout << endl; }
template <class Head, class... Tail> void out(const Head &head, const Tail &...tail) {cout << head;if(sizeof...(tail)) cout << ' ';out(tail...);}

#ifdef LOCAL
template<typename T>ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {int len=vv.size();for(int i=0; i<len; ++i) {if(i==0)s<<endl;s<<i<<":"<<vv[i];if(i!=len-1)s<<endl;}return s;}
struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};
template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}
#define dbg(...)do {cerr << #__VA_ARGS__ << ":  ";dbg0(__VA_ARGS__);cerr << endl;} while (false);
#else
#define dbg(...)
#endif

void dijkstra(const vector<VP> &g, ll start, Vec &dist) {
    priority_queue<P, vector<P>, function<bool(P, P)>> q([](P a, P b)->ll {
        return a.second > b.second;
    });
    dist[start] = 0;
    q.push(mp(start, 0));
    while (!q.empty()) {
        auto[now, d] = q.top();
        q.pop();
        if(dist[now] < d) continue;
        for(auto[nx, nd]: g[now]) {
            if(chmin(dist[nx], d+nd)) {
                q.emplace(nx, d+nd);
            }
        }
    }
}

int solve(){
    ll h,w;
    cin>>h>>w;
    h-=2;
    VV g(h,Vec(w));
    cin>>g;
    Vec dy = {0,1,0,-1,1,1,-1,-1};
    Vec dx = {1,0,-1,0,1,-1,1,-1};
    /*
     * 0 ,1,3,4,6
     */
    w += 2;
    VV weight(h,Vec(w));
    VV dist(h,Vec(w,INF));
    rep(j,w-2){
        rep(i,h){
            weight[i][j+1] = g[i][j];
        }
    }
    dbg(weight);
    auto in = [&](ll y, ll x) {
        return y >= 0 && y < h && x >= 0 && x < w;
    };
    auto idx = [&](ll y, ll x) { return y*w+x; };
    priority_queue<P, vector<P>, function<bool(P, P)>> q([](P a, P b)->ll {
        return a.second > b.second;
    });
    dist[0][0] = 0;
    q.emplace(mp(idx(0,0), 0));
    while (!q.empty()) {
        auto[now, d] = q.top();
        ll i = now / w;
        ll j = now % w;
        q.pop();
        if(dist[i][j] < d) continue;
        rep(k,8){
            ll ni = i + dy[k];
            ll nj = j + dx[k];
            if(!in(ni,nj))continue;
            if(weight[ni][nj] == -1)continue;
            if(chmin(dist[ni][nj], d + weight[ni][nj])){
                q.emplace(mp(idx(ni,nj),dist[ni][nj]));
            }
        }
    }
    ll ans = INF;
    rep(i,h){
        chmin(ans, dist[i][w-1]);
    }
    dbg(dist);
    outminusone(ans);
    return  0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(20);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}
0