結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | keijak |
提出日時 | 2021-06-11 23:35:39 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 142 ms / 3,000 ms |
コード長 | 4,769 bytes |
コンパイル時間 | 2,618 ms |
コンパイル使用メモリ | 221,548 KB |
実行使用メモリ | 33,324 KB |
最終ジャッジ日時 | 2023-08-21 14:40:25 |
合計ジャッジ時間 | 14,740 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 48 ms
16,828 KB |
testcase_05 | AC | 119 ms
24,316 KB |
testcase_06 | AC | 54 ms
13,748 KB |
testcase_07 | AC | 71 ms
17,272 KB |
testcase_08 | AC | 92 ms
13,632 KB |
testcase_09 | AC | 45 ms
7,120 KB |
testcase_10 | AC | 57 ms
16,584 KB |
testcase_11 | AC | 62 ms
15,744 KB |
testcase_12 | AC | 100 ms
23,352 KB |
testcase_13 | AC | 36 ms
11,024 KB |
testcase_14 | AC | 42 ms
15,672 KB |
testcase_15 | AC | 16 ms
5,904 KB |
testcase_16 | AC | 55 ms
19,156 KB |
testcase_17 | AC | 29 ms
5,460 KB |
testcase_18 | AC | 119 ms
22,004 KB |
testcase_19 | AC | 61 ms
13,112 KB |
testcase_20 | AC | 26 ms
5,684 KB |
testcase_21 | AC | 76 ms
25,368 KB |
testcase_22 | AC | 80 ms
23,808 KB |
testcase_23 | AC | 76 ms
10,232 KB |
testcase_24 | AC | 5 ms
4,380 KB |
testcase_25 | AC | 4 ms
4,384 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 3 ms
4,380 KB |
testcase_28 | AC | 5 ms
4,384 KB |
testcase_29 | AC | 5 ms
4,380 KB |
testcase_30 | AC | 4 ms
4,380 KB |
testcase_31 | AC | 5 ms
4,384 KB |
testcase_32 | AC | 3 ms
4,380 KB |
testcase_33 | AC | 5 ms
4,384 KB |
testcase_34 | AC | 4 ms
4,380 KB |
testcase_35 | AC | 9 ms
4,380 KB |
testcase_36 | AC | 7 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,384 KB |
testcase_38 | AC | 5 ms
4,384 KB |
testcase_39 | AC | 3 ms
4,380 KB |
testcase_40 | AC | 3 ms
4,380 KB |
testcase_41 | AC | 2 ms
4,380 KB |
testcase_42 | AC | 4 ms
4,384 KB |
testcase_43 | AC | 4 ms
4,380 KB |
testcase_44 | AC | 3 ms
4,380 KB |
testcase_45 | AC | 3 ms
4,636 KB |
testcase_46 | AC | 4 ms
4,384 KB |
testcase_47 | AC | 6 ms
4,420 KB |
testcase_48 | AC | 10 ms
7,384 KB |
testcase_49 | AC | 10 ms
5,248 KB |
testcase_50 | AC | 24 ms
7,104 KB |
testcase_51 | AC | 3 ms
4,380 KB |
testcase_52 | AC | 25 ms
7,128 KB |
testcase_53 | AC | 9 ms
5,236 KB |
testcase_54 | AC | 2 ms
4,380 KB |
testcase_55 | AC | 16 ms
6,516 KB |
testcase_56 | AC | 3 ms
4,380 KB |
testcase_57 | AC | 18 ms
5,384 KB |
testcase_58 | AC | 9 ms
5,216 KB |
testcase_59 | AC | 3 ms
4,384 KB |
testcase_60 | AC | 4 ms
4,388 KB |
testcase_61 | AC | 5 ms
4,380 KB |
testcase_62 | AC | 10 ms
4,948 KB |
testcase_63 | AC | 8 ms
4,384 KB |
testcase_64 | AC | 142 ms
25,896 KB |
testcase_65 | AC | 4 ms
4,384 KB |
testcase_66 | AC | 75 ms
33,324 KB |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template <typename T> inline int ssize(const T &a) { return (int)std::size(a); } template <typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x : a) is >> x; return is; } template <typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template <typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template <typename T, typename = void> struct is_iterable : std::false_type {}; template <typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type {}; template <typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } #ifdef ENABLE_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; template <int sign = 1> struct Infinity { template <typename T> constexpr operator T() const { static_assert(sign == 1 or not std::is_unsigned_v<T>, "must be positive in an unsigned type"); if constexpr (std::numeric_limits<T>::has_infinity) { return T(sign) * std::numeric_limits<T>::infinity(); } else { return T(sign) * (std::numeric_limits<T>::max() / T(2)); } } constexpr Infinity<sign * -1> operator-() const { return {}; } template <typename T> friend bool operator==(const T &x, const Infinity &y) { return x == T(y); } template <typename T> friend bool operator!=(const T &x, const Infinity &y) { return x != T(y); } }; const Infinity<> INF; template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>; struct Edge { i64 cost; int to; }; struct State { i64 cost; int node; int count; }; bool operator>(const State &x, const State &y) { return x.cost > y.cost; } // Returns min distance from the source node to each node (if exists). void search(const vector<vector<Edge>> &g, int source, int goal, int K, i64 init_cost) { const int n = g.size(); auto mincost = vector(n, vector(K + 1, (i64)INF)); auto pre = vector(n, vector(K + 1, pair(-1, -1))); MinHeap<State> que; auto push = [&](i64 cost, int node, int count, const State &st) -> bool { chmin(count, K); if (chmin(mincost[node][count], cost)) { pre[node][count] = pair(st.node, st.count); que.push({cost, node, count}); return true; } return false; }; assert(push(init_cost, source, 1, State{-1, -1, -1})); while (not que.empty()) { State cur = que.top(); que.pop(); if (cur.cost != mincost[cur.node][cur.count]) continue; if (cur.node == goal and cur.count >= K) break; for (const auto &e : g[cur.node]) { auto new_cost = cur.cost + e.cost; push(new_cost, e.to, min(cur.count + 1, K), cur); } } if (mincost[goal][K] == (i64)INF) { cout << "Impossible" << endl; return; } vector<int> ans; int cur = goal, cnt = K; while (true) { ans.push_back(cur); auto [pnode, pcnt] = pre[cur][cnt]; // if (cur == source and cnt == 1) break; if (pnode == -1 and pcnt == -1) break; cur = pnode; cnt = pcnt; } reverse(ALL(ans)); for (auto &x : ans) ++x; cout << "Possible" << endl; cout << mincost[goal][K] << endl; cout << ans.size() << endl; print_seq(ans); } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); i64 N, S, T, K, M; cin >> N >> S >> T >> K; --S, --T; vector<i64> X(N); cin >> X >> M; vector<vector<Edge>> g(N); REP(i, M) { i64 A, B, Y; cin >> A >> B >> Y; --A, --B; g[A].push_back({Y + X[B], (int)B}); } search(g, S, T, K, X[S]); }