結果

問題 No.1545 [Cherry 2nd Tune N] Anthem
ユーザー theory_and_metheory_and_me
提出日時 2021-06-12 00:11:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 550 ms / 3,000 ms
コード長 4,684 bytes
コンパイル時間 2,873 ms
コンパイル使用メモリ 220,568 KB
実行使用メモリ 84,416 KB
最終ジャッジ日時 2024-05-08 20:58:01
合計ジャッジ時間 15,427 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 124 ms
33,792 KB
testcase_05 AC 550 ms
82,680 KB
testcase_06 AC 129 ms
31,124 KB
testcase_07 AC 102 ms
27,392 KB
testcase_08 AC 318 ms
54,488 KB
testcase_09 AC 64 ms
19,072 KB
testcase_10 AC 44 ms
11,392 KB
testcase_11 AC 231 ms
43,004 KB
testcase_12 AC 414 ms
68,480 KB
testcase_13 AC 73 ms
19,328 KB
testcase_14 AC 141 ms
36,200 KB
testcase_15 AC 17 ms
6,784 KB
testcase_16 AC 221 ms
50,432 KB
testcase_17 AC 29 ms
7,296 KB
testcase_18 AC 119 ms
18,944 KB
testcase_19 AC 167 ms
31,544 KB
testcase_20 AC 52 ms
17,792 KB
testcase_21 AC 276 ms
59,696 KB
testcase_22 AC 122 ms
30,052 KB
testcase_23 AC 90 ms
18,580 KB
testcase_24 AC 9 ms
7,040 KB
testcase_25 AC 12 ms
8,704 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 7 ms
5,376 KB
testcase_28 AC 15 ms
10,496 KB
testcase_29 AC 13 ms
9,600 KB
testcase_30 AC 10 ms
7,552 KB
testcase_31 AC 13 ms
8,192 KB
testcase_32 AC 6 ms
5,504 KB
testcase_33 AC 17 ms
10,240 KB
testcase_34 AC 14 ms
8,576 KB
testcase_35 AC 44 ms
26,240 KB
testcase_36 AC 32 ms
20,096 KB
testcase_37 AC 4 ms
5,376 KB
testcase_38 AC 17 ms
10,624 KB
testcase_39 AC 5 ms
5,376 KB
testcase_40 AC 8 ms
6,144 KB
testcase_41 AC 3 ms
5,376 KB
testcase_42 AC 12 ms
7,404 KB
testcase_43 AC 14 ms
8,576 KB
testcase_44 AC 4 ms
5,376 KB
testcase_45 AC 6 ms
8,064 KB
testcase_46 AC 17 ms
8,832 KB
testcase_47 AC 29 ms
13,696 KB
testcase_48 AC 40 ms
23,808 KB
testcase_49 AC 52 ms
21,632 KB
testcase_50 AC 98 ms
35,616 KB
testcase_51 AC 5 ms
5,376 KB
testcase_52 AC 129 ms
46,464 KB
testcase_53 AC 44 ms
20,096 KB
testcase_54 AC 8 ms
5,888 KB
testcase_55 AC 91 ms
36,248 KB
testcase_56 AC 5 ms
5,376 KB
testcase_57 AC 75 ms
28,288 KB
testcase_58 AC 52 ms
23,040 KB
testcase_59 AC 9 ms
6,016 KB
testcase_60 AC 10 ms
7,552 KB
testcase_61 AC 22 ms
10,624 KB
testcase_62 AC 57 ms
23,792 KB
testcase_63 AC 30 ms
13,056 KB
testcase_64 AC 252 ms
74,704 KB
testcase_65 AC 9 ms
5,760 KB
testcase_66 AC 169 ms
84,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

template< typename T >
tuple<vector<T>, vector<int>>  Dijkstra(WeightedGraph< T > &g, int s) {
  // const auto INF = numeric_limits< T >::max();
  vector< T > dist(g.size(), INF);

  using Pi = pair< T, int >;
  priority_queue< Pi, vector< Pi >, greater< Pi > > que;
  dist[s] = 0;
  que.emplace(dist[s], s);

  vector<int> prev(g.size(), -1);

  while(!que.empty()) {
    T cost;
    int idx;
    tie(cost, idx) = que.top();
    que.pop();
    if(dist[idx] < cost) continue;
    for(auto &e : g[idx]) {
      auto next_cost = cost + e.cost;
      if(dist[e.to] <= next_cost) continue;
      dist[e.to] = next_cost;
      que.emplace(dist[e.to], e.to);
      prev[e.to] = idx;
    }
  }

  return {dist, prev};
}

int main(){

    ll N, S, T, K;
    cin >> N >> S >> T >> K;
    S--, T--;
    V<ll> X(N);
    REP(i, N) cin >> X[i];
    ll M;
    cin >> M;
    V<ll> A(M), B(M), Y(M);
    REP(i, M) cin >> A[i] >> B[i] >> Y[i], A[i]--, B[i]--;

    ll L = K;

    auto encode = [&](ll pos, ll k){
        return k * N + pos;
    };

    WeightedGraph<ll> G(N * L);

    REP(i, M){
        REP(j, L-1){
            auto from = encode(A[i], j);
            auto to = encode(B[i], j+1);
            G[from].emplace_back(to, Y[i] + X[B[i]]);
        }
        auto from = encode(A[i], L-1);
        auto to = encode(B[i], L-1);
        G[from].emplace_back(to, Y[i] + X[B[i]]);
    }

    auto [dist, prev] = Dijkstra(G, encode(S, 0));


    ll mi = dist[encode(T, K-1)];
    ll idx = encode(T, K-1);

    if(mi == INF){
        cout << "Impossible\n";
        return 0;
    }

    cout << "Possible\n";
    vector<int> path;
    int now = idx;
    while(now != -1){
        path.push_back(now);
        now = prev[now];
    }
    reverse(ALL(path));

    cout << mi + X[S] << endl;
    
    // dump(path)
    cout << path.size() << endl;
    for(auto x: path){
        cout << x%N+1 << " ";
    }
    cout << endl;

    // for(auto x: path){
    //     cout << x/N spa x%N << endl;
    // }

    return 0;
}
0