結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | sten_san |
提出日時 | 2021-06-11 22:04:01 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 145 ms / 3,000 ms |
コード長 | 2,586 bytes |
コンパイル時間 | 2,567 ms |
コンパイル使用メモリ | 221,204 KB |
実行使用メモリ | 32,960 KB |
最終ジャッジ日時 | 2023-08-21 12:30:23 |
合計ジャッジ時間 | 15,523 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 44 ms
15,944 KB |
testcase_05 | AC | 128 ms
22,464 KB |
testcase_06 | AC | 51 ms
12,988 KB |
testcase_07 | AC | 64 ms
16,192 KB |
testcase_08 | AC | 105 ms
11,712 KB |
testcase_09 | AC | 41 ms
5,760 KB |
testcase_10 | AC | 53 ms
15,676 KB |
testcase_11 | AC | 69 ms
14,868 KB |
testcase_12 | AC | 115 ms
21,704 KB |
testcase_13 | AC | 40 ms
10,380 KB |
testcase_14 | AC | 44 ms
15,188 KB |
testcase_15 | AC | 15 ms
5,948 KB |
testcase_16 | AC | 60 ms
18,436 KB |
testcase_17 | AC | 26 ms
4,660 KB |
testcase_18 | AC | 143 ms
20,772 KB |
testcase_19 | AC | 63 ms
12,128 KB |
testcase_20 | AC | 27 ms
5,020 KB |
testcase_21 | AC | 76 ms
24,180 KB |
testcase_22 | AC | 77 ms
22,664 KB |
testcase_23 | AC | 76 ms
8,388 KB |
testcase_24 | AC | 5 ms
4,380 KB |
testcase_25 | AC | 4 ms
4,376 KB |
testcase_26 | AC | 2 ms
4,376 KB |
testcase_27 | AC | 3 ms
4,380 KB |
testcase_28 | AC | 5 ms
4,380 KB |
testcase_29 | AC | 5 ms
4,376 KB |
testcase_30 | AC | 4 ms
4,376 KB |
testcase_31 | AC | 5 ms
4,380 KB |
testcase_32 | AC | 3 ms
4,376 KB |
testcase_33 | AC | 6 ms
4,384 KB |
testcase_34 | AC | 5 ms
4,376 KB |
testcase_35 | AC | 10 ms
4,380 KB |
testcase_36 | AC | 8 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,376 KB |
testcase_38 | AC | 6 ms
4,376 KB |
testcase_39 | AC | 3 ms
4,380 KB |
testcase_40 | AC | 4 ms
4,380 KB |
testcase_41 | AC | 2 ms
4,376 KB |
testcase_42 | AC | 4 ms
4,376 KB |
testcase_43 | AC | 5 ms
4,380 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 3 ms
4,572 KB |
testcase_46 | AC | 5 ms
4,376 KB |
testcase_47 | AC | 7 ms
4,392 KB |
testcase_48 | AC | 10 ms
7,324 KB |
testcase_49 | AC | 12 ms
5,188 KB |
testcase_50 | AC | 27 ms
7,156 KB |
testcase_51 | AC | 2 ms
4,380 KB |
testcase_52 | AC | 28 ms
7,064 KB |
testcase_53 | AC | 10 ms
5,144 KB |
testcase_54 | AC | 2 ms
4,376 KB |
testcase_55 | AC | 19 ms
6,484 KB |
testcase_56 | AC | 3 ms
4,380 KB |
testcase_57 | AC | 19 ms
5,416 KB |
testcase_58 | AC | 10 ms
5,128 KB |
testcase_59 | AC | 3 ms
4,380 KB |
testcase_60 | AC | 3 ms
4,376 KB |
testcase_61 | AC | 6 ms
4,384 KB |
testcase_62 | AC | 12 ms
4,876 KB |
testcase_63 | AC | 8 ms
4,380 KB |
testcase_64 | AC | 145 ms
23,672 KB |
testcase_65 | AC | 4 ms
4,376 KB |
testcase_66 | AC | 75 ms
32,960 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return std::vector(arg, init); else return std::vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } template <typename T> using pqueue = priority_queue<T, vector<T>, greater<T>>; int main() { constexpr int64_t inf = INT64_MAX / 4; constexpr auto inv = make_tuple(-1, -1); int n, s, t, k; cin >> n >> s >> t >> k; --s; --t; auto x = vec<int>(uns, n); for (auto &e : x) cin >> e; int m; cin >> m; auto g = vec<tuple<int, int>>(uns, n, 0); for (int i = 0; i < m; ++i) { int a, b, y; cin >> a >> b >> y; --a; --b; g[a].push_back({ b, x[b] + y }); } pqueue<tuple<int64_t, int, int>> que; auto dist = vec<int64_t>(inf, n, k + 1); auto prev = vec<tuple<int, int>>(inv, n, k + 1); que.push({ x[s], s, 1 }); dist[s][1] = x[s]; while (!empty(que)) { auto [d, v, c] = que.top(); que.pop(); if (dist[v][c] < d) { continue; } for (auto [u, w] : g[v]) { if (dist[u][min(k, c + 1)] <= d + w) { continue; } dist[u][min(k, c + 1)] = d + w; prev[u][min(k, c + 1)] = { v, c }; que.push({ dist[u][min(k, c + 1)], u, min(k, c + 1) }); } } if (dist[t][k] == inf) { cout << "Impossible" << endl; return 0; } auto path = [&] { auto path = vec<int>(uns, 0); int v = t, c = k; while (0 <= v && 0 <= c) { path.push_back(v); auto [pv, pc] = prev[v][c]; v = pv; c = pc; } reverse(begin(path), end(path)); return path; }(); cout << "Possible" << endl; cout << dist[t][k] << endl; cout << size(path) << endl; cout << path[0] + 1; for (int i = 1; i < size(path); ++i) { cout << ' ' << path[i] + 1; } cout << endl; }