結果

問題 No.1316 Maximum Minimum Spanning Tree
ユーザー optopt
提出日時 2020-10-23 13:12:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 22 ms / 2,000 ms
コード長 5,863 bytes
コンパイル時間 2,355 ms
コンパイル使用メモリ 217,052 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-19 21:59:27
合計ジャッジ時間 4,608 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 14 ms
6,940 KB
testcase_08 AC 15 ms
6,944 KB
testcase_09 AC 20 ms
6,940 KB
testcase_10 AC 20 ms
6,944 KB
testcase_11 AC 5 ms
6,940 KB
testcase_12 AC 4 ms
6,940 KB
testcase_13 AC 4 ms
6,940 KB
testcase_14 AC 4 ms
6,944 KB
testcase_15 AC 18 ms
6,940 KB
testcase_16 AC 20 ms
6,944 KB
testcase_17 AC 19 ms
6,940 KB
testcase_18 AC 20 ms
6,944 KB
testcase_19 AC 3 ms
6,940 KB
testcase_20 AC 3 ms
6,940 KB
testcase_21 AC 3 ms
6,940 KB
testcase_22 AC 3 ms
6,940 KB
testcase_23 AC 3 ms
6,940 KB
testcase_24 AC 3 ms
6,940 KB
testcase_25 AC 3 ms
6,944 KB
testcase_26 AC 3 ms
6,944 KB
testcase_27 AC 3 ms
6,940 KB
testcase_28 AC 3 ms
6,944 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 2 ms
6,944 KB
testcase_31 AC 3 ms
6,944 KB
testcase_32 AC 3 ms
6,940 KB
testcase_33 AC 3 ms
6,944 KB
testcase_34 AC 3 ms
6,940 KB
testcase_35 AC 2 ms
6,944 KB
testcase_36 AC 3 ms
6,940 KB
testcase_37 AC 3 ms
6,944 KB
testcase_38 AC 3 ms
6,940 KB
testcase_39 AC 3 ms
6,944 KB
testcase_40 AC 3 ms
6,940 KB
testcase_41 AC 3 ms
6,940 KB
testcase_42 AC 3 ms
6,944 KB
testcase_43 AC 10 ms
6,940 KB
testcase_44 AC 9 ms
6,940 KB
testcase_45 AC 15 ms
6,940 KB
testcase_46 AC 14 ms
6,940 KB
testcase_47 AC 12 ms
6,944 KB
testcase_48 AC 12 ms
6,944 KB
testcase_49 AC 11 ms
6,940 KB
testcase_50 AC 12 ms
6,944 KB
testcase_51 AC 11 ms
6,940 KB
testcase_52 AC 11 ms
6,944 KB
testcase_53 AC 17 ms
6,944 KB
testcase_54 AC 18 ms
6,944 KB
testcase_55 AC 18 ms
6,940 KB
testcase_56 AC 18 ms
6,944 KB
testcase_57 AC 17 ms
6,944 KB
testcase_58 AC 17 ms
6,944 KB
testcase_59 AC 17 ms
6,944 KB
testcase_60 AC 18 ms
6,940 KB
testcase_61 AC 17 ms
6,940 KB
testcase_62 AC 19 ms
6,944 KB
testcase_63 AC 17 ms
6,940 KB
testcase_64 AC 18 ms
6,944 KB
testcase_65 AC 20 ms
6,940 KB
testcase_66 AC 21 ms
6,940 KB
testcase_67 AC 20 ms
6,944 KB
testcase_68 AC 18 ms
6,944 KB
testcase_69 AC 18 ms
6,940 KB
testcase_70 AC 19 ms
6,944 KB
testcase_71 AC 19 ms
6,940 KB
testcase_72 AC 20 ms
6,944 KB
testcase_73 AC 20 ms
6,940 KB
testcase_74 AC 22 ms
6,944 KB
testcase_75 AC 3 ms
6,944 KB
testcase_76 AC 3 ms
6,944 KB
testcase_77 AC 3 ms
6,940 KB
testcase_78 AC 19 ms
6,940 KB
testcase_79 AC 19 ms
6,940 KB
testcase_80 AC 19 ms
6,940 KB
testcase_81 AC 13 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

////////////////////////////////////////////////////////
// ↓ ACL ここから ↓
////////////////////////////////////////////////////////

#include <algorithm>

#include <vector>

namespace atcoder {

namespace internal {

template <class T> struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <limits>
#include <queue>
#include <vector>

namespace atcoder {

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

    int add_edge(int from, int to, Cap cap) {
        assert(0 <= from && from < _n);
        assert(0 <= to && to < _n);
        assert(0 <= cap);
        int m = int(pos.size());
        pos.push_back({from, int(g[from].size())});
        int from_id = int(g[from].size());
        int to_id = int(g[to].size());
        if (from == to) to_id++;
        g[from].push_back(_edge{to, to_id, cap});
        g[to].push_back(_edge{from, from_id, 0});
        return m;
    }

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

    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};
    }
    std::vector<edge> edges() {
        int m = int(pos.size());
        std::vector<edge> result;
        for (int i = 0; i < m; i++) {
            result.push_back(get_edge(i));
        }
        return result;
    }
    void change_edge(int i, Cap new_cap, Cap new_flow) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        assert(0 <= new_flow && new_flow <= new_cap);
        auto& _e = g[pos[i].first][pos[i].second];
        auto& _re = g[_e.to][_e.rev];
        _e.cap = new_cap - new_flow;
        _re.cap = new_flow;
    }

    Cap flow(int s, int t) {
        return flow(s, t, std::numeric_limits<Cap>::max());
    }
    Cap flow(int s, int t, Cap flow_limit) {
        assert(0 <= s && s < _n);
        assert(0 <= t && t < _n);
        assert(s != t);

        std::vector<int> level(_n), iter(_n);
        internal::simple_queue<int> que;

        auto bfs = [&]() {
            std::fill(level.begin(), level.end(), -1);
            level[s] = 0;
            que.clear();
            que.push(s);
            while (!que.empty()) {
                int v = que.front();
                que.pop();
                for (auto e : g[v]) {
                    if (e.cap == 0 || level[e.to] >= 0) continue;
                    level[e.to] = level[v] + 1;
                    if (e.to == t) return;
                    que.push(e.to);
                }
            }
        };
        auto dfs = [&](auto self, int v, Cap up) {
            if (v == s) return up;
            Cap res = 0;
            int level_v = level[v];
            for (int& i = iter[v]; i < int(g[v].size()); i++) {
                _edge& e = g[v][i];
                if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;
                Cap d =
                    self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
                if (d <= 0) continue;
                g[v][i].cap += d;
                g[e.to][e.rev].cap -= d;
                res += d;
                if (res == up) break;
            }
            return res;
        };

        Cap flow = 0;
        while (flow < flow_limit) {
            bfs();
            if (level[t] == -1) break;
            std::fill(iter.begin(), iter.end(), 0);
            while (flow < flow_limit) {
                Cap f = dfs(dfs, t, flow_limit - flow);
                if (!f) break;
                flow += f;
            }
        }
        return flow;
    }

    std::vector<bool> min_cut(int s) {
        std::vector<bool> visited(_n);
        internal::simple_queue<int> que;
        que.push(s);
        while (!que.empty()) {
            int p = que.front();
            que.pop();
            visited[p] = true;
            for (auto e : g[p]) {
                if (e.cap && !visited[e.to]) {
                    visited[e.to] = true;
                    que.push(e.to);
                }
            }
        }
        return visited;
    }

  private:
    int _n;
    struct _edge {
        int to, rev;
        Cap cap;
    };
    std::vector<std::pair<int, int>> pos;
    std::vector<std::vector<_edge>> g;
};

}  // namespace atcoder


////////////////////////////////////////////////////////
// ↑ ACL ここまで ↑
////////////////////////////////////////////////////////


using namespace std;
using ll = long long;

struct edge {
  int a, b;
  ll c, d, y;
};

int main() {
  ll n, m, D; cin >> n >> m >> D;
  vector<edge> E(m);
  for (auto &[a, b, c, d, y] : E) cin >> a >> b >> c >> d;
  sort(E.begin(), E.end(), [] (auto x, auto y) { return x.c < y.c; });

  int s = 0, t = n+1;
  ll ysum = 0, ans = 0;

  for (auto &[a, b, c, d, y] : E) {
    atcoder::mf_graph<ll> G(n+2);
    G.add_edge(s, a, 2*D*n);
    G.add_edge(s, b, 2*D*n);
    for (auto [a2, b2, c2, d2, y2] : E) {
      G.add_edge(a2, b2, y2);
      G.add_edge(b2, a2, y2);
      G.add_edge(s, a2, y2);
      G.add_edge(s, b2, y2);
    }
    for (int v = 1; v <= n; ++v) G.add_edge(v, t, 2*D);

    ll z = G.flow(s, t) / 2 - D - ysum;
    y = min(z, d);
    ysum += y;
    ans += c*y;
  }

  if (ysum < D*(n-1)) ans = -1;
  cout << ans << '\n';
}
0