test/verify/aoj-grl-6-b.test.cpp

• View this file on GitHub
• Last update: 2024-04-27 01:27:28+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B

Depends on

• Primal Dual(最小費用流) (graph/flow/primal-dual.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B

#include "../../template/template.hpp"

#include "../../graph/flow/primal-dual.hpp"

int main() {
  int V, E, F;
  scanf("%d %d %d", &V, &E, &F);
  PrimalDual< int, int > g(V);
  for(int i = 0; i < E; i++) {
    int a, b, c, d;
    scanf("%d %d %d %d", &a, &b, &c, &d);
    g.add_edge(a, b, c, d);
  }
  printf("%d\n", g.min_cost_flow(0, V - 1, F));
}

#line 1 "test/verify/aoj-grl-6-b.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-grl-6-b.test.cpp"

#line 1 "graph/flow/primal-dual.hpp"
/**
 * @brief Primal Dual(最小費用流)
 *
 */
template <typename flow_t, typename cost_t>
struct PrimalDual {
  struct edge {
    int to;
    flow_t cap;
    cost_t cost;
    int rev;
    bool isrev;
  };

  vector<vector<edge> > graph;
  vector<cost_t> potential, min_cost;
  vector<int> prevv, preve;
  const cost_t INF;

  PrimalDual(int V) : graph(V), INF(numeric_limits<cost_t>::max()) {}

  void add_edge(int from, int to, flow_t cap, cost_t cost) {
    graph[from].emplace_back(
        (edge){to, cap, cost, (int)graph[to].size(), false});
    graph[to].emplace_back(
        (edge){from, 0, -cost, (int)graph[from].size() - 1, true});
  }

  cost_t min_cost_flow(int s, int t, flow_t f) {
    int V = (int)graph.size();
    cost_t ret = 0;
    using Pi = pair<cost_t, int>;
    priority_queue<Pi, vector<Pi>, greater<Pi> > que;
    potential.assign(V, 0);
    preve.assign(V, -1);
    prevv.assign(V, -1);

    while (f > 0) {
      min_cost.assign(V, INF);
      que.emplace(0, s);
      min_cost[s] = 0;
      while (!que.empty()) {
        Pi p = que.top();
        que.pop();
        if (min_cost[p.second] < p.first) continue;
        for (int i = 0; i < (int)graph[p.second].size(); i++) {
          edge &e = graph[p.second][i];
          cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] -
                            potential[e.to];
          if (e.cap > 0 && min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.emplace(min_cost[e.to], e.to);
          }
        }
      }
      if (min_cost[t] == INF) return -1;
      for (int v = 0; v < V; v++) potential[v] += min_cost[v];
      flow_t addflow = f;
      for (int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret += addflow * potential[t];
      for (int v = t; v != s; v = prevv[v]) {
        edge &e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }

  void output() {
    for (int i = 0; i < graph.size(); i++) {
      for (auto &e : graph[i]) {
        if (e.isrev) continue;
        auto &rev_e = graph[e.to][e.rev];
        cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/"
             << rev_e.cap + e.cap << ")" << endl;
      }
    }
  }
};
#line 6 "test/verify/aoj-grl-6-b.test.cpp"

int main() {
  int V, E, F;
  scanf("%d %d %d", &V, &E, &F);
  PrimalDual< int, int > g(V);
  for(int i = 0; i < E; i++) {
    int a, b, c, d;
    scanf("%d %d %d %d", &a, &b, &c, &d);
    g.add_edge(a, b, c, d);
  }
  printf("%d\n", g.min_cost_flow(0, V - 1, F));
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	4 MB
g++	01_small_00.in	AC	6 ms	4 MB
g++	01_small_01.in	AC	6 ms	4 MB
g++	01_small_02.in	AC	6 ms	4 MB
g++	01_small_03.in	AC	6 ms	4 MB
g++	02_corner_00.in	AC	6 ms	4 MB
g++	02_corner_01.in	AC	6 ms	4 MB
g++	02_corner_02.in	AC	6 ms	4 MB
g++	03_random_00.in	AC	6 ms	4 MB
g++	03_random_01.in	AC	6 ms	4 MB
g++	03_random_02.in	AC	6 ms	4 MB
g++	03_random_03.in	AC	6 ms	4 MB
g++	03_random_04.in	AC	6 ms	4 MB
g++	03_random_05.in	AC	6 ms	4 MB
g++	03_random_06.in	AC	7 ms	4 MB
g++	03_random_07.in	AC	7 ms	4 MB
g++	04_rand_00.in	AC	6 ms	4 MB
g++	04_rand_01.in	AC	6 ms	4 MB
g++	04_rand_02.in	AC	6 ms	4 MB
g++	04_rand_03.in	AC	7 ms	4 MB
g++	04_rand_04.in	AC	6 ms	4 MB
g++	04_rand_05.in	AC	6 ms	4 MB
g++	04_rand_06.in	AC	6 ms	4 MB
g++	04_rand_07.in	AC	6 ms	4 MB
g++	05_large_00.in	AC	7 ms	4 MB
g++	05_large_01.in	AC	7 ms	4 MB
g++	05_large_02.in	AC	7 ms	4 MB
g++	05_large_03.in	AC	6 ms	4 MB
g++	06_biased_00.in	AC	7 ms	4 MB
g++	06_biased_01.in	AC	7 ms	4 MB
g++	06_biased_02.in	AC	7 ms	4 MB
g++	06_biased_03.in	AC	7 ms	4 MB
clang++	00_sample_00.in	AC	6 ms	4 MB
clang++	01_small_00.in	AC	6 ms	4 MB
clang++	01_small_01.in	AC	6 ms	4 MB
clang++	01_small_02.in	AC	6 ms	4 MB
clang++	01_small_03.in	AC	6 ms	4 MB
clang++	02_corner_00.in	AC	6 ms	4 MB
clang++	02_corner_01.in	AC	6 ms	4 MB
clang++	02_corner_02.in	AC	6 ms	4 MB
clang++	03_random_00.in	AC	6 ms	4 MB
clang++	03_random_01.in	AC	6 ms	4 MB
clang++	03_random_02.in	AC	6 ms	4 MB
clang++	03_random_03.in	AC	6 ms	4 MB
clang++	03_random_04.in	AC	6 ms	4 MB
clang++	03_random_05.in	AC	7 ms	4 MB
clang++	03_random_06.in	AC	6 ms	4 MB
clang++	03_random_07.in	AC	6 ms	4 MB
clang++	04_rand_00.in	AC	6 ms	4 MB
clang++	04_rand_01.in	AC	6 ms	4 MB
clang++	04_rand_02.in	AC	6 ms	4 MB
clang++	04_rand_03.in	AC	6 ms	4 MB
clang++	04_rand_04.in	AC	7 ms	4 MB
clang++	04_rand_05.in	AC	7 ms	4 MB
clang++	04_rand_06.in	AC	6 ms	4 MB
clang++	04_rand_07.in	AC	6 ms	4 MB
clang++	05_large_00.in	AC	7 ms	4 MB
clang++	05_large_01.in	AC	7 ms	4 MB
clang++	05_large_02.in	AC	7 ms	4 MB
clang++	05_large_03.in	AC	7 ms	4 MB
clang++	06_biased_00.in	AC	7 ms	4 MB
clang++	06_biased_01.in	AC	7 ms	4 MB
clang++	06_biased_02.in	AC	7 ms	4 MB
clang++	06_biased_03.in	AC	7 ms	4 MB

Back to top page