結果

問題 No.1301 Strange Graph Shortest Path
ユーザー haruki_Kharuki_K
提出日時 2020-11-27 22:55:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,598 bytes
コンパイル時間 2,458 ms
コンパイル使用メモリ 216,764 KB
実行使用メモリ 14,708 KB
最終ジャッジ日時 2024-07-26 20:10:57
合計ジャッジ時間 7,362 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 WA -
testcase_03 AC 71 ms
11,752 KB
testcase_04 AC 111 ms
14,624 KB
testcase_05 AC 70 ms
11,868 KB
testcase_06 AC 97 ms
13,492 KB
testcase_07 AC 91 ms
13,092 KB
testcase_08 AC 69 ms
11,772 KB
testcase_09 AC 91 ms
13,252 KB
testcase_10 WA -
testcase_11 AC 95 ms
13,564 KB
testcase_12 AC 100 ms
13,916 KB
testcase_13 AC 83 ms
13,140 KB
testcase_14 AC 85 ms
12,952 KB
testcase_15 AC 86 ms
12,800 KB
testcase_16 AC 116 ms
14,708 KB
testcase_17 AC 96 ms
13,660 KB
testcase_18 AC 86 ms
12,564 KB
testcase_19 AC 98 ms
13,684 KB
testcase_20 AC 98 ms
13,640 KB
testcase_21 AC 92 ms
13,352 KB
testcase_22 AC 107 ms
14,120 KB
testcase_23 AC 94 ms
13,200 KB
testcase_24 AC 107 ms
14,016 KB
testcase_25 AC 110 ms
14,436 KB
testcase_26 AC 90 ms
13,384 KB
testcase_27 AC 92 ms
13,608 KB
testcase_28 AC 71 ms
12,360 KB
testcase_29 WA -
testcase_30 AC 103 ms
14,216 KB
testcase_31 AC 108 ms
14,312 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 89 ms
14,652 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> 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 double ld
#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 mp make_pair
#define fst first
#define snd second
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 > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = 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); }
const int dx[] = { 1,0,-1,0,1,-1,-1,1 };
const int dy[] = { 0,1,0,-1,1,1,-1,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<

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

    vector<int> prev_v(n, -1), prev_e(n, -1);
    int sum = 0;
    rep (_,2) {
        vector<int> dist(n, INF);
        pque_min<pair<int, int>> pq;
        dist[0] = 0;
        pq.emplace(0, 0);
        while (pq.size()) {
            auto [d, x] = pq.top(); pq.pop();
            if (dist[x] < d) continue;
            rep (i,g[x].size()) {
                auto e = g[x][i];
                if (chmin(dist[e.to], d + e.c)) {
                    prev_v[e.to] = x;
                    prev_e[e.to] = i;
                    pq.emplace(d + e.c, e.to);
                }
            }
        }
        dump(dist);
        sum += dist[n-1];

        int x = n-1;
        dump(x);
        do {
            int i = prev_e[x];
            x = prev_v[x];
            dump(x);
            swap(g[x][i].c, g[x][i].d);
        } while (x != 0);
    }

    cout << sum << endl;
}
0