結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | tokusakurai |
提出日時 | 2021-06-11 21:49:57 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 366 ms / 3,000 ms |
コード長 | 3,109 bytes |
コンパイル時間 | 2,333 ms |
コンパイル使用メモリ | 215,032 KB |
実行使用メモリ | 88,920 KB |
最終ジャッジ日時 | 2023-08-21 12:10:32 |
合計ジャッジ時間 | 17,901 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 82 ms
31,360 KB |
testcase_05 | AC | 366 ms
88,920 KB |
testcase_06 | AC | 99 ms
30,908 KB |
testcase_07 | AC | 83 ms
24,376 KB |
testcase_08 | AC | 249 ms
67,104 KB |
testcase_09 | AC | 70 ms
21,484 KB |
testcase_10 | AC | 45 ms
8,912 KB |
testcase_11 | AC | 157 ms
44,004 KB |
testcase_12 | AC | 270 ms
72,060 KB |
testcase_13 | AC | 61 ms
18,492 KB |
testcase_14 | AC | 95 ms
33,528 KB |
testcase_15 | AC | 17 ms
6,020 KB |
testcase_16 | AC | 131 ms
46,284 KB |
testcase_17 | AC | 29 ms
6,420 KB |
testcase_18 | AC | 120 ms
14,608 KB |
testcase_19 | AC | 141 ms
32,964 KB |
testcase_20 | AC | 59 ms
21,932 KB |
testcase_21 | AC | 153 ms
52,412 KB |
testcase_22 | AC | 92 ms
24,828 KB |
testcase_23 | AC | 97 ms
18,200 KB |
testcase_24 | AC | 10 ms
8,292 KB |
testcase_25 | AC | 14 ms
10,916 KB |
testcase_26 | AC | 2 ms
4,376 KB |
testcase_27 | AC | 8 ms
6,024 KB |
testcase_28 | AC | 18 ms
13,852 KB |
testcase_29 | AC | 16 ms
12,300 KB |
testcase_30 | AC | 12 ms
8,856 KB |
testcase_31 | AC | 15 ms
10,064 KB |
testcase_32 | AC | 7 ms
6,304 KB |
testcase_33 | AC | 19 ms
13,740 KB |
testcase_34 | AC | 16 ms
11,036 KB |
testcase_35 | AC | 54 ms
37,204 KB |
testcase_36 | AC | 39 ms
28,072 KB |
testcase_37 | AC | 4 ms
4,712 KB |
testcase_38 | AC | 19 ms
13,608 KB |
testcase_39 | AC | 5 ms
5,172 KB |
testcase_40 | AC | 8 ms
7,104 KB |
testcase_41 | AC | 3 ms
4,376 KB |
testcase_42 | AC | 13 ms
9,016 KB |
testcase_43 | AC | 15 ms
10,904 KB |
testcase_44 | AC | 3 ms
4,384 KB |
testcase_45 | AC | 5 ms
6,792 KB |
testcase_46 | AC | 17 ms
10,372 KB |
testcase_47 | AC | 28 ms
15,816 KB |
testcase_48 | AC | 35 ms
22,428 KB |
testcase_49 | AC | 52 ms
26,032 KB |
testcase_50 | AC | 95 ms
41,396 KB |
testcase_51 | AC | 6 ms
5,140 KB |
testcase_52 | AC | 134 ms
58,484 KB |
testcase_53 | AC | 44 ms
23,648 KB |
testcase_54 | AC | 7 ms
6,260 KB |
testcase_55 | AC | 93 ms
44,700 KB |
testcase_56 | AC | 3 ms
4,380 KB |
testcase_57 | AC | 79 ms
34,912 KB |
testcase_58 | AC | 52 ms
28,296 KB |
testcase_59 | AC | 9 ms
6,640 KB |
testcase_60 | AC | 9 ms
7,496 KB |
testcase_61 | AC | 22 ms
12,712 KB |
testcase_62 | AC | 61 ms
29,412 KB |
testcase_63 | AC | 32 ms
15,916 KB |
testcase_64 | AC | 258 ms
81,952 KB |
testcase_65 | AC | 9 ms
5,964 KB |
testcase_66 | AC | 136 ms
70,984 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; vector<ll> a; int N, K; template<typename T, bool directed = false> struct Weighted_Graph{ struct edge{ int to; T cost; int id; edge(int to, T cost, int id) : to(to), cost(cost), id(id) {} }; vector<vector<edge>> es; const T INF_T; const int n; int m; vector<T> d; vector<int> pre_v; Weighted_Graph(int n) : es(n), INF_T(numeric_limits<T>::max()/2), n(n), m(0), d(n), pre_v(n) {} void add_edge(int from, int to, T cost){ es[from].emplace_back(to, cost, m); if(!directed) es[to].emplace_back(from, cost, m); m++; } T dijkstra(int s, int t = 0){ fill(begin(d), end(d), INF_T); using P = pair<T, int>; priority_queue<P, vector<P>, greater<P> > que; que.emplace(d[s] = 0, s); while(!que.empty()){ auto [p, i] = que.top(); que.pop(); if(p > d[i]) continue; for(auto &e: es[i]){ if(d[i]+e.cost < d[e.to]){ pre_v[e.to] = i, que.emplace(d[e.to] = d[i]+e.cost, e.to); } } } return d[t]; } vector<int> shortest_path(int s, int t){ //if(dijkstra(s, t) == INF_T) return {}; vector<int> ret; for(int now = t; now != s; now = pre_v[now]) ret.push_back(now); ret.push_back(s), reverse(begin(ret), end(ret)); return ret; } }; int main(){ int S, T; cin >> N >> S >> T >> K; S--, T--; Weighted_Graph<ll, true> G(N*K); a.resize(N); rep(i, N) cin >> a[i]; int M; cin >> M; rep(i, M){ int u, v; ll c; cin >> u >> v >> c; u--, v--; c += a[v]; rep(j, K-1){ G.add_edge(u*K+j, v*K+j+1, c); } G.add_edge(u*K+K-1, v*K+K-1, c); } ll ans = G.dijkstra(S*K, T*K+K-1); if(ans >= INF) {cout << "Impossible\n"; return 0;} //rep(i, N*K) cout << G.d[i] << ' '; cout << '\n'; cout << "Possible\n" << ans+a[S] << '\n'; vector<int> path = G.shortest_path(S*K, T*K+K-1); int n = sz(path); cout << n << '\n'; rep(i, n) cout << (path[i]/K)+1 << (i == n-1? '\n' : ' '); }