結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | rniya |
提出日時 | 2021-06-11 21:43:12 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 143 ms / 3,000 ms |
コード長 | 5,687 bytes |
コンパイル時間 | 2,504 ms |
コンパイル使用メモリ | 223,220 KB |
実行使用メモリ | 27,400 KB |
最終ジャッジ日時 | 2023-08-21 11:59:30 |
合計ジャッジ時間 | 17,116 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 38 ms
12,476 KB |
testcase_05 | AC | 108 ms
19,332 KB |
testcase_06 | AC | 44 ms
10,172 KB |
testcase_07 | AC | 51 ms
12,484 KB |
testcase_08 | AC | 98 ms
10,724 KB |
testcase_09 | AC | 39 ms
5,616 KB |
testcase_10 | AC | 42 ms
10,040 KB |
testcase_11 | AC | 57 ms
12,372 KB |
testcase_12 | AC | 88 ms
17,388 KB |
testcase_13 | AC | 32 ms
8,260 KB |
testcase_14 | AC | 34 ms
12,176 KB |
testcase_15 | AC | 13 ms
5,044 KB |
testcase_16 | AC | 47 ms
15,620 KB |
testcase_17 | AC | 26 ms
4,576 KB |
testcase_18 | AC | 106 ms
13,536 KB |
testcase_19 | AC | 53 ms
10,012 KB |
testcase_20 | AC | 26 ms
4,880 KB |
testcase_21 | AC | 63 ms
19,696 KB |
testcase_22 | AC | 62 ms
15,700 KB |
testcase_23 | AC | 73 ms
7,628 KB |
testcase_24 | AC | 5 ms
4,380 KB |
testcase_25 | AC | 5 ms
4,376 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 4 ms
4,376 KB |
testcase_28 | AC | 5 ms
4,376 KB |
testcase_29 | AC | 5 ms
4,380 KB |
testcase_30 | AC | 4 ms
4,376 KB |
testcase_31 | AC | 5 ms
4,376 KB |
testcase_32 | AC | 3 ms
4,376 KB |
testcase_33 | AC | 6 ms
4,376 KB |
testcase_34 | AC | 5 ms
4,380 KB |
testcase_35 | AC | 10 ms
4,380 KB |
testcase_36 | AC | 9 ms
4,376 KB |
testcase_37 | AC | 3 ms
4,376 KB |
testcase_38 | AC | 6 ms
4,376 KB |
testcase_39 | AC | 3 ms
4,380 KB |
testcase_40 | AC | 3 ms
4,376 KB |
testcase_41 | AC | 2 ms
4,380 KB |
testcase_42 | AC | 5 ms
4,376 KB |
testcase_43 | AC | 5 ms
4,376 KB |
testcase_44 | AC | 4 ms
4,584 KB |
testcase_45 | AC | 5 ms
5,136 KB |
testcase_46 | AC | 5 ms
4,380 KB |
testcase_47 | AC | 8 ms
5,560 KB |
testcase_48 | AC | 14 ms
9,148 KB |
testcase_49 | AC | 14 ms
6,748 KB |
testcase_50 | AC | 31 ms
9,452 KB |
testcase_51 | AC | 2 ms
4,376 KB |
testcase_52 | AC | 33 ms
9,192 KB |
testcase_53 | AC | 12 ms
6,692 KB |
testcase_54 | AC | 3 ms
4,380 KB |
testcase_55 | AC | 22 ms
8,236 KB |
testcase_56 | AC | 5 ms
4,840 KB |
testcase_57 | AC | 23 ms
6,680 KB |
testcase_58 | AC | 13 ms
6,476 KB |
testcase_59 | AC | 4 ms
4,384 KB |
testcase_60 | AC | 5 ms
4,992 KB |
testcase_61 | AC | 7 ms
4,444 KB |
testcase_62 | AC | 14 ms
6,232 KB |
testcase_63 | AC | 10 ms
4,656 KB |
testcase_64 | AC | 143 ms
20,372 KB |
testcase_65 | AC | 5 ms
4,376 KB |
testcase_66 | AC | 58 ms
27,400 KB |
ソースコード
#define LOCAL #include <bits/stdc++.h> using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } void debug_out() { cerr << '\n'; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; int main() { cin.tie(0); ios::sync_with_stdio(false); int N, S, T, K; cin >> N >> S >> T >> K; S--, T--; vector<int> X(N); cin >> X; int M; cin >> M; vector<vector<pair<int, int>>> G(N); for (; M--;) { int A, B, Y; cin >> A >> B >> Y; A--, B--; G[A].emplace_back(B, Y + X[B]); } vector<vector<ll>> dp(K + 1, vector<ll>(N, IINF)); vector<vector<pair<int, int>>> pre(K + 1, vector<pair<int, int>>(N)); priority_queue<tuple<ll, int, int>> pq; auto update = [&](int nx, int ny, int x, int y, ll val) { // 状態 (x,y) から (nx,ny) に値 val で遷移 if (chmin(dp[nx][ny], val)) { pq.emplace(-dp[nx][ny], nx, ny); pre[nx][ny] = make_pair(x, y); } }; dp[1][S] = X[S]; pq.emplace(-dp[1][S], 1, S); while (!pq.empty()) { auto t = pq.top(); pq.pop(); ll val; int k, v; tie(val, k, v) = t; val *= -1; if (dp[k][v] < val) continue; for (auto& e : G[v]) { int u = e.first; update(min(K, k + 1), u, k, v, val + e.second); } } ll time = dp[K][T]; if (time == IINF) { cout << "Impossible" << '\n'; return 0; } cout << "Possible" << '\n'; cout << time << '\n'; vector<int> ans; ans.emplace_back(T); int x = K, y = T; while (!(x == 1 && y == S)) { auto p = pre[x][y]; x = p.first, y = p.second; ans.emplace_back(y); } reverse(ALL(ans)); cout << ans.size() << '\n'; for (int i = 0; i < ans.size(); i++) cout << ans[i] + 1 << (i + 1 == ans.size() ? '\n' : ' '); return 0; }