結果

問題 No.1812 Uribo Road
ユーザー sten_sansten_san
提出日時 2022-01-15 05:39:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 80 ms / 5,000 ms
コード長 4,523 bytes
コンパイル時間 2,833 ms
コンパイル使用メモリ 224,076 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-05-01 01:20:13
合計ジャッジ時間 4,034 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 3 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 3 ms
6,940 KB
testcase_09 AC 4 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 34 ms
6,940 KB
testcase_13 AC 12 ms
6,944 KB
testcase_14 AC 11 ms
6,944 KB
testcase_15 AC 27 ms
6,940 KB
testcase_16 AC 24 ms
6,944 KB
testcase_17 AC 69 ms
6,940 KB
testcase_18 AC 11 ms
6,940 KB
testcase_19 AC 80 ms
6,944 KB
testcase_20 AC 80 ms
6,944 KB
testcase_21 AC 63 ms
6,940 KB
testcase_22 AC 51 ms
6,940 KB
testcase_23 AC 3 ms
6,940 KB
testcase_24 AC 2 ms
6,944 KB
testcase_25 AC 11 ms
6,940 KB
testcase_26 AC 2 ms
6,944 KB
testcase_27 AC 10 ms
6,940 KB
testcase_28 AC 22 ms
6,944 KB
testcase_29 AC 1 ms
6,940 KB
testcase_30 AC 3 ms
6,940 KB
testcase_31 AC 38 ms
6,944 KB
testcase_32 AC 2 ms
6,940 KB
testcase_33 AC 16 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename T>
using pqueue = priority_queue<T, vector<T>, greater<T>>;

int main() {
    constexpr auto inf = INT_MAX / 2;

    int n, m, k; cin >> n >> m >> k;
    auto r = vec<int>(uns, k);
    for (auto &v : r) {
        cin >> v; --v;
    }

    auto g = vec<array<int, 2>>(uns, n, 0);
    auto e = vec<array<int, 3>>(uns, m);
    for (auto &[a, b, c] : e) {
        cin >> a >> b >> c; --a; --b;
        g[a].push_back({ b, c });
        g[b].push_back({ a, c });
    }

    auto dijkstra = [&](int beg) {
        pqueue<array<int, 2>> que;
        auto dist = vec<int>(inf, n);

        que.push({ 0, beg });
        dist[beg] = 0;
        while (!empty(que)) {
            auto [d, v] = que.top(); que.pop();

            if (dist[v] < d) {
                continue;
            }

            for (auto [u, c] : g[v]) {
                if (dist[u] <= d + c) {
                    continue;
                }

                dist[u] = d + c;
                que.push({ d + c, u });
            }
        }

        return dist;
    };

    auto v = vec<int>(uns, 0);
    for (auto i : r) {
        auto [a, b, _] = e[i];
        v.push_back(a);
        v.push_back(b);
    }
    v.push_back(0);
    v.push_back(n - 1);

    v = uniqued(sorted(move(v)));

    auto vtoi = vec<int>(uns, n);
    for (int i = 0; i < size(v); ++i) {
        vtoi[v[i]] = i;
    }

    auto dist = vec<int>(uns, size(v), size(v));
    for (int i = 0; i < size(v); ++i) {
        auto d = dijkstra(v[i]);
        for (int j = 0; j < size(v); ++j) {
            dist[i][j] = d[v[j]];
        }
    }

    auto dp = vec<int>(inf, 1 << k, size(v));

    dp[0][0] = 0;
    for (int i = 1; i < (1 << k); ++i) {
        for (int j = 0; j < k; ++j) {
            if (!(i & (1 << j))) {
                continue;
            }

            auto [a, b, c] = e[r[j]];

            a = vtoi[a];
            b = vtoi[b];

            for (int k = 0; k < size(v); ++k) {
                chmin(dp[i][a], dp[i ^ (1 << j)][k] + dist[k][b] + c);
                chmin(dp[i][b], dp[i ^ (1 << j)][k] + dist[k][a] + c);
            }
        }
    }

    int ans = inf;
    for (int i = 0; i < size(v); ++i) {
        chmin(ans, dp[(1 << k) - 1][i] + dist[i][size(v) - 1]);
    }

    cout << ans << endl;
}
0