#666064 (C++17) No.1545 [Cherry 2nd Tune N] Anthem

提出ソース

結果

問題	No.1545 [Cherry 2nd Tune N] Anthem
ユーザー	haruki_K
提出日時	2021-06-11 23:58:11
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	MLE
実行時間	-
コード長	6,747 bytes
コンパイル時間	2,670 ms
コンパイル使用メモリ	229,308 KB
実行使用メモリ	814,708 KB
最終ジャッジ日時	2024-12-15 04:01:01
合計ジャッジ時間	76,434 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	45 ms 16,896 KB
testcase_05	MLE	-
testcase_06	AC	59 ms 13,952 KB
testcase_07	AC	67 ms 17,280 KB
testcase_08	MLE	-
testcase_09	MLE	-
testcase_10	AC	57 ms 16,384 KB
testcase_11	MLE	-
testcase_12	MLE	-
testcase_13	MLE	-
testcase_14	MLE	-
testcase_15	AC	20 ms 6,692 KB
testcase_16	MLE	-
testcase_17	AC	31 ms 6,688 KB
testcase_18	AC	165 ms 22,528 KB
testcase_19	MLE	-
testcase_20	MLE	-
testcase_21	MLE	-
testcase_22	MLE	-
testcase_23	AC	90 ms 10,496 KB
testcase_24	MLE	-
testcase_25	MLE	-
testcase_26	MLE	-
testcase_27	MLE	-
testcase_28	MLE	-
testcase_29	MLE	-
testcase_30	MLE	-
testcase_31	MLE	-
testcase_32	MLE	-
testcase_33	MLE	-
testcase_34	MLE	-
testcase_35	MLE	-
testcase_36	MLE	-
testcase_37	MLE	-
testcase_38	MLE	-
testcase_39	MLE	-
testcase_40	MLE	-
testcase_41	MLE	-
testcase_42	MLE	-
testcase_43	MLE	-
testcase_44	AC	5 ms 6,692 KB
testcase_45	AC	3 ms 6,688 KB
testcase_46	MLE	-
testcase_47	MLE	-
testcase_48	MLE	-
testcase_49	MLE	-
testcase_50	MLE	-
testcase_51	MLE	-
testcase_52	MLE	-
testcase_53	MLE	-
testcase_54	MLE	-
testcase_55	MLE	-
testcase_56	AC	5 ms 6,688 KB
testcase_57	AC	20 ms 6,692 KB
testcase_58	MLE	-
testcase_59	MLE	-
testcase_60	AC	6 ms 6,692 KB
testcase_61	MLE	-
testcase_62	MLE	-
testcase_63	WA	-
testcase_64	AC	151 ms 24,860 KB
testcase_65	AC	5 ms 6,692 KB
testcase_66	MLE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#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) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
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 > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)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(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class T> vector<T> &operator--(vector<T> &v) { for (T &x : v) --x; return v; }
template <class T> vector<T> &operator++(vector<T> &v) { for (T &x : v) ++x; return v; }
// <<<

int32_t main() {
    int n, s, t, k; cin >> n >> s >> t >> k; --s, --t;
    vector<int> a(n); cin >> a;
    struct edge { int to, cost; };
    vector<vector<edge>> g(n);
    int m; cin >> m;
    rep (i, m) {
        int x, y; cin >> x >> y; --x, --y;
        int c; cin >> c;
        g[x].pb({y, c});
    }

    auto dp = make_v<int, 2>(n, k+1, INF);
    auto par = make_v<pair<i32, i32>, 2>(n, k+1, pair(-1, -1));
    dp[s][1] = a[s];
    pque_min<tuple<int, i32, i32>> pq;
    pq.emplace(a[s], s, 1);
    while (pq.size()) {
        auto [d, x, cnt] = pq.top(); pq.pop();
        if (dp[x][cnt] < d) continue;
        auto push = [&](int nx, int cost) {
            int ncnt = min<int>(k, cnt+1);
            if (chmin(dp[nx][ncnt], d + cost)) {
                pq.emplace(d + cost, nx, ncnt);
                par[nx][ncnt] = pair(x, ncnt);
            }
        };
        for (auto [y, cost] : g[x]) {
            push(y, cost + a[y]);
        }
    }
    dump(as_mat(dp));
    dump(as_mat(par));

    if (dp[t][k] < INF) {
        cout << "Possible" << '\n';
        cout << dp[t][k] << '\n';

        vector<int> ans;
        int x = t, cnt = k;
        ans.eb(x);
        while (true) {
            tie(x, cnt) = par[x][cnt];
            ans.eb(x);
            if (sz(ans) >= k and x == s) {
                break;
            }
        }
        reverse(all(ans));

        cout << ans.size() << '\n';
        cout << ++ans << '\n';

    } else {
        cout << "Impossible" << '\n';
    }

}

yukicoder

結果

テストケース

ソースコード