結果

問題 No.20 砂漠のオアシス
ユーザー haruki_Kharuki_K
提出日時 2020-05-27 09:09:18
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 2,194 ms / 5,000 ms
コード長 5,122 bytes
コンパイル時間 1,943 ms
コンパイル使用メモリ 180,068 KB
実行使用メモリ 218,548 KB
最終ジャッジ日時 2023-08-03 05:55:20
合計ジャッジ時間 8,170 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 4 ms
4,380 KB
testcase_04 AC 10 ms
5,616 KB
testcase_05 AC 17 ms
5,400 KB
testcase_06 AC 163 ms
68,456 KB
testcase_07 AC 2,194 ms
218,548 KB
testcase_08 AC 493 ms
139,208 KB
testcase_09 AC 1,267 ms
160,092 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 19 ms
5,836 KB
testcase_13 AC 29 ms
7,772 KB
testcase_14 AC 126 ms
14,360 KB
testcase_15 AC 56 ms
9,228 KB
testcase_16 AC 233 ms
32,000 KB
testcase_17 AC 105 ms
17,468 KB
testcase_18 AC 219 ms
29,260 KB
testcase_19 AC 227 ms
32,720 KB
testcase_20 AC 10 ms
4,656 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: ラムダ関数内:
main.cpp:92:18: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ [-Wc++17-extensions]
   92 |             auto [x,y,V] = q.front(); q.pop();
      |                  ^

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };

int32_t main() {
    int N,V,Ox,Oy; cin >> N >> V >> Ox >> Oy; --Ox,--Oy; swap(Ox,Oy);
    auto L = make_v<int,2>(N,N); cin >> L;
    auto valid = [&](int x, int y) {
        return (0 <= x && x < N &&
                0 <= y && y < N);
    };

    auto bfs = [&](int sx, int sy, int V, int gx, int gy) -> int {
        auto d = make_v<int,3>(N,N,V+1,INF);
        queue<tuple<int,int,int>> q;
        d[sx][sy][V] = 0;
        q.emplace(sx,sy,V);
        while (q.size()) {
            auto [x,y,V] = q.front(); q.pop();
            rep (dir,4) {
                int nx = x+dx[dir];
                int ny = y+dy[dir];
                if (valid(nx,ny)) {
                    int nV = V-L[nx][ny];
                    if (nV > 0 && chmin(d[nx][ny][nV],d[x][y][V]+1)) {
                        q.emplace(nx,ny,nV);
                    }
                }
            }
        }
        int ma = 0;
        rep (i,V+1) if (d[gx][gy][i] < INF) chmax(ma,i);
        return ma;
    };

    if (bfs(0,0,V,N-1,N-1) > 0) quit("YES");
    if (Ox < 0 || Oy < 0) quit("NO");
    int v = bfs(0,0,V,Ox,Oy);
    if (v <= 0) quit("NO");
    if (bfs(Ox,Oy,2*v,N-1,N-1) > 0) quit("YES");
    quit("NO");
}
0