#730894 (C++17) No.1812 Uribo Road

提出ソース

結果

問題	No.1812 Uribo Road
ユーザー	haruki_K
提出日時	2022-01-14 22:26:56
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	159 ms / 5,000 ms
コード長	7,637 bytes
コンパイル時間	3,518 ms
コンパイル使用メモリ	233,220 KB
実行使用メモリ	8,624 KB
最終ジャッジ日時	2024-11-20 11:59:36
合計ジャッジ時間	5,420 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	14 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	2 ms 6,820 KB
testcase_07	AC	3 ms 6,816 KB
testcase_08	AC	4 ms 6,816 KB
testcase_09	AC	5 ms 6,816 KB
testcase_10	AC	4 ms 6,816 KB
testcase_11	AC	3 ms 6,816 KB
testcase_12	AC	86 ms 6,980 KB
testcase_13	AC	41 ms 8,624 KB
testcase_14	AC	40 ms 8,548 KB
testcase_15	AC	37 ms 6,816 KB
testcase_16	AC	37 ms 6,816 KB
testcase_17	AC	110 ms 6,820 KB
testcase_18	AC	44 ms 6,820 KB
testcase_19	AC	158 ms 8,040 KB
testcase_20	AC	159 ms 7,244 KB
testcase_21	AC	131 ms 8,192 KB
testcase_22	AC	108 ms 8,208 KB
testcase_23	AC	12 ms 6,816 KB
testcase_24	AC	2 ms 6,820 KB
testcase_25	AC	15 ms 6,816 KB
testcase_26	AC	3 ms 6,820 KB
testcase_27	AC	25 ms 6,816 KB
testcase_28	AC	28 ms 6,816 KB
testcase_29	AC	2 ms 6,816 KB
testcase_30	AC	5 ms 6,820 KB
testcase_31	AC	97 ms 6,820 KB
testcase_32	AC	4 ms 6,816 KB
testcase_33	AC	34 ms 6,816 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
// <<<

struct edge { int to, cost, bit; };
// >>> dijkstra
#ifndef EDGE_INFO
#define EDGE_INFO
constexpr int dest(int v) { return v; }
template <class E, class = decltype(declval<E>().to)>
constexpr int dest(E const& e) { return e.to; }
constexpr int cost(int) { return 1; }
template <class E, class = decltype(declval<E>().cost)>
constexpr auto cost(E const& e) { return e.cost; }
template <class E> using cost_t = decltype(cost(declval<E>()));
#endif
vector<cost_t<edge>> dijkstra(vector<vector<edge>> const& g, int s, cost_t<edge> inf) {
    rep (x, g.size()) {
        for (auto const& e : g[x]) {
            assert(cost(e) >= 0);
        }
    }

    vector<cost_t<edge>> d(g.size(), inf);
    pque_min<pair<cost_t<edge>, int>> q;
    d[s] = 0;
    q.emplace(0, s);
    while (q.size()) {
        auto p = q.top(); q.pop();
        const int x = p.snd;
        if (d[x] < p.fst) continue;
        for (auto const& e : g[x]) {
            const int y = dest(e);
            if (chmin(d[y], d[x] + cost(e))) {
                q.emplace(d[y], y);
            }
        }
    }
    return d;
}
// <<<
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}

int32_t main() {
    int n, m, k; cin >> n >> m >> k;
    vector<int> r(k); cin >> r; --r;
    vector<vector<edge>> g(n);
    vector<int> a(m), b(m), c(m);
    rep (i, m) {
        cin >> a[i] >> b[i] >> c[i], --a[i], --b[i];
        g[a[i]].pb({b[i], c[i], 0});
        g[b[i]].pb({a[i], c[i], 0});
    }

    vector<int> vs = { 0, n-1 };
    for (int i : r) vs.eb(a[i]), vs.eb(b[i]);
    int N = sort_unique(vs);
    vector<vector<edge>> G(N);
    rep (i, N) {
        auto d = dijkstra(g, vs[i], INF);
        rep (j, N) G[i].pb({j, d[vs[j]], 0});
    }
    rep (j, k) {
        int i = r[j];
        int x = lbd(vs, a[i]);
        int y = lbd(vs, b[i]);
        G[x].pb({y, c[i], 1LL<<j});
        G[y].pb({x, c[i], 1LL<<j});
    }


    auto dist = make_v<int, 2>(1LL<<k, N, INF);
    dist[0][0] = 0;
    pque_min<tuple<int, int, int>> pq;
    pq.emplace(0, 0, 0);
    while (pq.size()) {
        auto [d, now, x] = pq.top(); pq.pop();
        if (dist[now][x] < d) continue;
        for (auto [y, c, bit] : G[x]) {
            int nxt = now | bit;
            if (chmin(dist[nxt][y], d + c)) {
                pq.emplace(d + c, nxt, y);
            }
        }
    }

    cout << dist[(1LL<<k)-1].back() << '\n';
}

yukicoder

結果

テストケース

ソースコード