結果

問題 No.1301 Strange Graph Shortest Path
ユーザー KoDKoD
提出日時 2020-11-27 23:45:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 309 ms / 3,000 ms
コード長 6,165 bytes
コンパイル時間 1,255 ms
コンパイル使用メモリ 101,236 KB
実行使用メモリ 36,432 KB
最終ジャッジ日時 2024-07-26 19:52:08
合計ジャッジ時間 11,150 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 246 ms
35,952 KB
testcase_03 AC 211 ms
32,052 KB
testcase_04 AC 291 ms
34,856 KB
testcase_05 AC 239 ms
35,672 KB
testcase_06 AC 263 ms
32,468 KB
testcase_07 AC 247 ms
34,388 KB
testcase_08 AC 214 ms
32,472 KB
testcase_09 AC 224 ms
30,748 KB
testcase_10 AC 214 ms
31,988 KB
testcase_11 AC 255 ms
33,448 KB
testcase_12 AC 250 ms
33,324 KB
testcase_13 AC 238 ms
35,536 KB
testcase_14 AC 254 ms
30,812 KB
testcase_15 AC 229 ms
31,976 KB
testcase_16 AC 286 ms
34,836 KB
testcase_17 AC 268 ms
36,432 KB
testcase_18 AC 244 ms
33,136 KB
testcase_19 AC 243 ms
32,696 KB
testcase_20 AC 269 ms
31,432 KB
testcase_21 AC 261 ms
34,936 KB
testcase_22 AC 284 ms
32,276 KB
testcase_23 AC 244 ms
35,896 KB
testcase_24 AC 276 ms
32,128 KB
testcase_25 AC 275 ms
34,964 KB
testcase_26 AC 250 ms
33,464 KB
testcase_27 AC 240 ms
33,604 KB
testcase_28 AC 227 ms
35,164 KB
testcase_29 AC 309 ms
34,268 KB
testcase_30 AC 256 ms
34,624 KB
testcase_31 AC 271 ms
34,368 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 182 ms
29,680 KB
testcase_34 AC 245 ms
36,240 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <queue>
#line 1 "/Users/kodamankod/Desktop/ac-library/atcoder/mincostflow.hpp"



#line 6 "/Users/kodamankod/Desktop/ac-library/atcoder/mincostflow.hpp"
#include <limits>
#line 9 "/Users/kodamankod/Desktop/ac-library/atcoder/mincostflow.hpp"

namespace atcoder {

template <class Cap, class Cost> struct mcf_graph {
  public:
    mcf_graph() {}
    mcf_graph(int n) : _n(n), g(n) {}

    int add_edge(int from, int to, Cap cap, Cost cost) {
        assert(0 <= from && from < _n);
        assert(0 <= to && to < _n);
        int m = int(pos.size());
        pos.push_back({from, int(g[from].size())});
        g[from].push_back(_edge{to, int(g[to].size()), cap, cost});
        g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});
        return m;
    }

    struct edge {
        int from, to;
        Cap cap, flow;
        Cost cost;
    };

    edge get_edge(int i) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        auto _e = g[pos[i].first][pos[i].second];
        auto _re = g[_e.to][_e.rev];
        return edge{
            pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,
        };
    }
    std::vector<edge> edges() {
        int m = int(pos.size());
        std::vector<edge> result(m);
        for (int i = 0; i < m; i++) {
            result[i] = get_edge(i);
        }
        return result;
    }

    std::pair<Cap, Cost> flow(int s, int t) {
        return flow(s, t, std::numeric_limits<Cap>::max());
    }
    std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {
        return slope(s, t, flow_limit).back();
    }
    std::vector<std::pair<Cap, Cost>> slope(int s, int t) {
        return slope(s, t, std::numeric_limits<Cap>::max());
    }
    std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {
        assert(0 <= s && s < _n);
        assert(0 <= t && t < _n);
        assert(s != t);
        // variants (C = maxcost):
        // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0
        // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge
        std::vector<Cost> dual(_n, 0), dist(_n);
        std::vector<int> pv(_n), pe(_n);
        std::vector<bool> vis(_n);
        auto dual_ref = [&]() {
            std::fill(dist.begin(), dist.end(),
                      std::numeric_limits<Cost>::max());
            std::fill(pv.begin(), pv.end(), -1);
            std::fill(pe.begin(), pe.end(), -1);
            std::fill(vis.begin(), vis.end(), false);
            struct Q {
                Cost key;
                int to;
                bool operator<(Q r) const { return key > r.key; }
            };
            std::priority_queue<Q> que;
            dist[s] = 0;
            que.push(Q{0, s});
            while (!que.empty()) {
                int v = que.top().to;
                que.pop();
                if (vis[v]) continue;
                vis[v] = true;
                if (v == t) break;
                // dist[v] = shortest(s, v) + dual[s] - dual[v]
                // dist[v] >= 0 (all reduced cost are positive)
                // dist[v] <= (n-1)C
                for (int i = 0; i < int(g[v].size()); i++) {
                    auto e = g[v][i];
                    if (vis[e.to] || !e.cap) continue;
                    // |-dual[e.to] + dual[v]| <= (n-1)C
                    // cost <= C - -(n-1)C + 0 = nC
                    Cost cost = e.cost - dual[e.to] + dual[v];
                    if (dist[e.to] - dist[v] > cost) {
                        dist[e.to] = dist[v] + cost;
                        pv[e.to] = v;
                        pe[e.to] = i;
                        que.push(Q{dist[e.to], e.to});
                    }
                }
            }
            if (!vis[t]) {
                return false;
            }

            for (int v = 0; v < _n; v++) {
                if (!vis[v]) continue;
                // dual[v] = dual[v] - dist[t] + dist[v]
                //         = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])
                //         = - shortest(s, t) + dual[t] + shortest(s, v)
                //         = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C
                dual[v] -= dist[t] - dist[v];
            }
            return true;
        };
        Cap flow = 0;
        Cost cost = 0, prev_cost = -1;
        std::vector<std::pair<Cap, Cost>> result;
        result.push_back({flow, cost});
        while (flow < flow_limit) {
            if (!dual_ref()) break;
            Cap c = flow_limit - flow;
            for (int v = t; v != s; v = pv[v]) {
                c = std::min(c, g[pv[v]][pe[v]].cap);
            }
            for (int v = t; v != s; v = pv[v]) {
                auto& e = g[pv[v]][pe[v]];
                e.cap -= c;
                g[v][e.rev].cap += c;
            }
            Cost d = -dual[s];
            flow += c;
            cost += c * d;
            if (prev_cost == d) {
                result.pop_back();
            }
            result.push_back({flow, cost});
            prev_cost = cost;
        }
        return result;
    }

  private:
    int _n;

    struct _edge {
        int to, rev;
        Cap cap;
        Cost cost;
    };

    std::vector<std::pair<int, int>> pos;
    std::vector<std::vector<_edge>> g;
};

}  // namespace atcoder


#line 15 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  usize N, M;
  std::cin >> N >> M;
  atcoder::mcf_graph<i32, i64> net(N);
  while (M--) {
    usize u, v;
    i64 c, d;
    std::cin >> u >> v >> c >> d;
    u -= 1; v -= 1;
    net.add_edge(u, v, 1, c);
    net.add_edge(u, v, 1, d);
    net.add_edge(v, u, 1, c);
    net.add_edge(v, u, 1, d);
  }
  std::cout << net.flow(0, N - 1, 2).second << '\n';
  return 0;
}
0