#354955 (C++17) No.845 最長の切符

提出ソース

結果

問題	No.845 最長の切符
ユーザー	Pachicobue
提出日時	2019-06-28 21:54:56
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,158 ms / 3,000 ms
コード長	6,879 bytes
コンパイル時間	2,421 ms
コンパイル使用メモリ	214,092 KB
実行使用メモリ	183,304 KB
最終ジャッジ日時	2024-07-02 04:41:27
合計ジャッジ時間	8,642 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	3 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,948 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	3 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	10 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	4 ms 6,944 KB
testcase_13	AC	3 ms 6,940 KB
testcase_14	AC	4 ms 6,940 KB
testcase_15	AC	146 ms 36,856 KB
testcase_16	AC	1,158 ms 183,304 KB
testcase_17	AC	166 ms 39,748 KB
testcase_18	AC	436 ms 82,856 KB
testcase_19	AC	58 ms 19,544 KB
testcase_20	AC	1,048 ms 169,756 KB
testcase_21	AC	716 ms 143,732 KB
testcase_22	AC	169 ms 39,748 KB
testcase_23	AC	24 ms 10,700 KB
testcase_24	AC	1,142 ms 182,408 KB
testcase_25	AC	2 ms 6,944 KB
testcase_26	AC	56 ms 79,100 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	156 ms 101,656 KB
testcase_29	AC	2 ms 6,944 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
template <typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template <typename T>
std::vector<T> readVec(const std::size_t l)
{
    std::vector<T> v(l);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template <typename T>
bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!=================================================!//
//!   .88888.                             dP        !//
//!  d8'   '88                            88        !//
//!  88        88d888b. .d8888b. 88d888b. 88d888b.  !//
//!  88   YP88 88'  '88 88'  '88 88'  '88 88'  '88  !//
//!  Y8.   .88 88       88.  .88 88.  .88 88    88  !//
//!   '88888'  dP       '88888P8 88Y888P' dP    dP  !//
//!                              88                 !//
//!                              dP                 !//
//!=================================================!//
struct Graph
{
    Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}
    void addEdge(const std::size_t from, const std::size_t to, const bool bi = false)
    {
        assert(from < V), assert(to < V);
        edge[from].push_back(to), rev_edge[to].push_back(from);
        if (bi) { addEdge(to, from, false); }
    }
    const std::vector<std::size_t>& operator[](const std::size_t i) const { return assert(i < V), edge[i]; }
    friend std::ostream& operator<<(std::ostream& os, const Graph& g)
    {
        os << "[\n";
        for (std::size_t i = 0; i < g.V; i++) {
            for (const std::size_t to : g.edge[i]) { os << i << "->" << to << "\n"; }
        }
        return (os << "]\n");
    }
    std::size_t V;
    std::vector<std::vector<std::size_t>> edge, rev_edge;
};
using Tree = Graph;
//!=================================================================!//
//!  d888888P                   .d88888b                      dP    !//
//!     88                      88.    "'                     88    !//
//!     88    .d8888b. 88d888b. 'Y88888b. .d8888b. 88d888b. d8888P  !//
//!     88    88'  '88 88'  '88       '8b 88'  '88 88'  '88   88    !//
//!     88    88.  .88 88.  .88 d8'   .8P 88.  .88 88         88    !//
//!     dP    '88888P' 88Y888P'  Y88888P  '88888P' dP         dP    !//
//!                    88                                           !//
//!                    dP                                           !//
//!=================================================================!//
std::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)
{
    std::vector<std::size_t> srt, used(g.V, 0);
    auto dfs = [&](auto&& self, const std::size_t s) -> bool {
        if (used[s] == 1) {
            return false;
        } else if (used[s] == 0) {
            used[s] = 1;
            for (const std::size_t to : g.edge[s]) {
                if (not self(self, to)) { return false; }
            }
            used[s] = 2, srt.push_back(s);
        }
        return true;
    };
    for (std::size_t i = 0; i < g.V; i++) {
        if (not dfs(dfs, i)) { return {false, srt}; }
    }
    std::reverse(srt.begin(), srt.end());
    return {true, srt};
}
int main()
{
    const int N = read<int>(), M = read<int>();
    const int MASK = 1 << N;
    Graph G(N * MASK);
    auto E = Vec(N, N, 0);
    for (int i = 0, a, b, c; i < M; i++) {
        std::cin >> a >> b >> c, a--, b--;
        chmax(E[a][b], c), chmax(E[b][a], c);
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (E[i][j] == 0) { continue; }
            for (int mask = 0; mask < MASK; mask++) {
                if ((mask & (1 << i)) == 0) { continue; }
                if (mask & (1 << j)) { continue; }
                G.addEdge(i * MASK + mask, j * MASK + mask + (1 << j));
            }
        }
    }
    const auto top = TopSort(G);
    assert(top.first);
    std::vector<int> L(N * MASK + 1, 0);
    for (const int v : top.second) {
        for (const int to : G[v]) { chmax(L[to], L[v] + E[v / MASK][to / MASK]); }
    }
    std::cout << *std::max_element(L.begin(), L.end()) << std::endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード