#665979 (C++17) No.1545 [Cherry 2nd Tune N] Anthem

提出ソース

結果

問題	No.1545 [Cherry 2nd Tune N] Anthem
ユーザー	scol_kp
提出日時	2021-06-11 23:27:33
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	177 ms / 3,000 ms
コード長	4,756 bytes
コンパイル時間	2,876 ms
コンパイル使用メモリ	227,552 KB
実行使用メモリ	43,520 KB
最終ジャッジ日時	2024-12-15 02:52:10
合計ジャッジ時間	14,115 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	2 ms 5,248 KB
testcase_04	AC	51 ms 19,968 KB
testcase_05	AC	173 ms 30,316 KB
testcase_06	AC	63 ms 16,000 KB
testcase_07	AC	71 ms 20,224 KB
testcase_08	AC	125 ms 16,164 KB
testcase_09	AC	47 ms 7,680 KB
testcase_10	AC	57 ms 17,664 KB
testcase_11	AC	91 ms 19,328 KB
testcase_12	AC	147 ms 28,288 KB
testcase_13	AC	42 ms 12,672 KB
testcase_14	AC	53 ms 19,072 KB
testcase_15	AC	17 ms 6,528 KB
testcase_16	AC	70 ms 24,192 KB
testcase_17	AC	29 ms 5,504 KB
testcase_18	AC	168 ms 24,320 KB
testcase_19	AC	76 ms 15,616 KB
testcase_20	AC	29 ms 6,144 KB
testcase_21	AC	88 ms 31,744 KB
testcase_22	AC	80 ms 26,624 KB
testcase_23	AC	86 ms 11,260 KB
testcase_24	AC	6 ms 5,248 KB
testcase_25	AC	4 ms 5,248 KB
testcase_26	AC	2 ms 5,248 KB
testcase_27	AC	4 ms 5,248 KB
testcase_28	AC	6 ms 5,248 KB
testcase_29	AC	5 ms 5,248 KB
testcase_30	AC	4 ms 5,248 KB
testcase_31	AC	5 ms 5,248 KB
testcase_32	AC	3 ms 5,248 KB
testcase_33	AC	6 ms 5,248 KB
testcase_34	AC	5 ms 5,248 KB
testcase_35	AC	11 ms 5,248 KB
testcase_36	AC	9 ms 5,248 KB
testcase_37	AC	3 ms 5,248 KB
testcase_38	AC	6 ms 5,248 KB
testcase_39	AC	3 ms 5,248 KB
testcase_40	AC	4 ms 5,248 KB
testcase_41	AC	3 ms 5,248 KB
testcase_42	AC	5 ms 5,248 KB
testcase_43	AC	5 ms 5,248 KB
testcase_44	AC	4 ms 5,248 KB
testcase_45	AC	4 ms 5,760 KB
testcase_46	AC	6 ms 5,248 KB
testcase_47	AC	8 ms 5,248 KB
testcase_48	AC	13 ms 9,660 KB
testcase_49	AC	13 ms 6,472 KB
testcase_50	AC	30 ms 9,252 KB
testcase_51	AC	3 ms 5,248 KB
testcase_52	AC	30 ms 9,000 KB
testcase_53	AC	11 ms 6,308 KB
testcase_54	AC	3 ms 5,248 KB
testcase_55	AC	20 ms 8,176 KB
testcase_56	AC	4 ms 5,248 KB
testcase_57	AC	22 ms 6,912 KB
testcase_58	AC	11 ms 6,236 KB
testcase_59	AC	4 ms 5,248 KB
testcase_60	AC	5 ms 5,248 KB
testcase_61	AC	6 ms 5,248 KB
testcase_62	AC	13 ms 6,144 KB
testcase_63	AC	9 ms 5,248 KB
testcase_64	AC	177 ms 32,100 KB
testcase_65	AC	6 ms 5,248 KB
testcase_66	AC	94 ms 43,520 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <std::ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
#if __cplusplus >= 201703L
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {
#else
        void operator()(const Args&... args) const {
#endif
            print(args...);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
#else
        void pvec(const T& vec, size_t sz) const {
#endif
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
#else
        void pmat(const T& mat, size_t h, size_t w) const {
#endif
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

template <typename T>
struct WeightedEdge {
    int to;
    T cost;
    constexpr WeightedEdge(int to, T cost = -1) noexcept : to(to), cost(cost) {}
};
template <typename T>
using WeightedGraph = std::vector<std::vector<WeightedEdge<T>>>;

void solve() {
    ll N, S, T, K;
    cin >> N >> S >> T >> K;
    --S, --T;
    Vl X(N);
    for (ll i = 0; i < N; i++) {
        cin >> X[i];
    }
    ll M;
    cin >> M;
    WeightedGraph<ll> g(N);
    for (ll i = 0; i < M; i++) {
        ll a, b, y;
        cin >> a >> b >> y;
        --a, --b;
        g[a].emplace_back(b, X[b] + y);
    }
    vector dp(N, Vl(K + 1, L_INF));
    vector pre(N, vector(K + 1, Pll{-1, -1}));
    using Tup = tuple<ll, ll, ll>;
    priority_queue<Tup, vector<Tup>, greater<Tup>> pq;
    dp[S][1] = X[S];
    pq.emplace(X[S], S, 1);
    while (!pq.empty()) {
        auto [cost, u, k] = pq.top();
        pq.pop();
        if (dp[u][k] < cost) continue;
        for (auto [to, c] : g[u]) {
            ll nc = cost + c;
            ll nk = min(k + 1, K);
            if (dp[to][nk] > nc) {
                dp[to][nk] = nc;
                pre[to][nk] = {u, k};
                pq.emplace(nc, to, nk);
            }
        }
    }
    if (dp[T][K] == L_INF) {
        prints()("Impossible");
        return;
    }
    Vl path;
    {
        ll u_cur = T, k_cur = K;
        while (u_cur != -1) {
            path.emplace_back(u_cur);
            tie(u_cur, k_cur) = pre[u_cur][k_cur];
        }
    }
    reverse(path.begin(), path.end());
    prints()("Possible");
    prints()(dp[T][K]);
    prints()(path.size());
    for (auto u : path) {
        cout << u + 1 << " ";
    }
    prints()();
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}

yukicoder

結果

テストケース

ソースコード