This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_A
#include "../../template/template.hpp"
#include "../../graph/flow/dinic.hpp"
int main() {
int V, E;
scanf("%d %d", &V, &E);
Dinic< int > g(V);
for(int i = 0; i < E; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
g.add_edge(a, b, c);
}
printf("%d\n", g.max_flow(0, V - 1));
}
#line 1 "test/verify/aoj-grl-6-a.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_A
#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-a.test.cpp"
#line 1 "graph/flow/dinic.hpp"
/**
* @brief Dinic(最大流)
*
*/
template <typename flow_t>
struct Dinic {
const flow_t INF;
struct edge {
int to;
flow_t cap;
int rev;
bool isrev;
int idx;
};
vector<vector<edge> > graph;
vector<int> min_cost, iter;
explicit Dinic(int V) : INF(numeric_limits<flow_t>::max()), graph(V) {}
void add_edge(int from, int to, flow_t cap, int idx = -1) {
graph[from].emplace_back(
(edge){to, cap, (int)graph[to].size(), false, idx});
graph[to].emplace_back(
(edge){from, 0, (int)graph[from].size() - 1, true, idx});
}
bool build_augment_path(int s, int t) {
min_cost.assign(graph.size(), -1);
queue<int> que;
min_cost[s] = 0;
que.push(s);
while (!que.empty() && min_cost[t] == -1) {
int p = que.front();
que.pop();
for (auto &e : graph[p]) {
if (e.cap > 0 && min_cost[e.to] == -1) {
min_cost[e.to] = min_cost[p] + 1;
que.push(e.to);
}
}
}
return min_cost[t] != -1;
}
flow_t find_min_dist_augment_path(int idx, const int t, flow_t flow) {
if (idx == t) return flow;
for (int &i = iter[idx]; i < (int)graph[idx].size(); i++) {
edge &e = graph[idx][i];
if (e.cap > 0 && min_cost[idx] < min_cost[e.to]) {
flow_t d = find_min_dist_augment_path(e.to, t, min(flow, e.cap));
if (d > 0) {
e.cap -= d;
graph[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
flow_t max_flow(int s, int t) {
flow_t flow = 0;
while (build_augment_path(s, t)) {
iter.assign(graph.size(), 0);
flow_t f;
while ((f = find_min_dist_augment_path(s, t, INF)) > 0) flow += f;
}
return flow;
}
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 << "/"
<< e.cap + rev_e.cap << ")" << endl;
}
}
}
vector<bool> min_cut(int s) {
vector<bool> used(graph.size());
queue<int> que;
que.emplace(s);
used[s] = true;
while (not que.empty()) {
int p = que.front();
que.pop();
for (auto &e : graph[p]) {
if (e.cap > 0 and not used[e.to]) {
used[e.to] = true;
que.emplace(e.to);
}
}
}
return used;
}
};
#line 6 "test/verify/aoj-grl-6-a.test.cpp"
int main() {
int V, E;
scanf("%d %d", &V, &E);
Dinic< int > g(V);
for(int i = 0; i < E; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
g.add_edge(a, b, c);
}
printf("%d\n", g.max_flow(0, V - 1));
}
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++ | 02_corner_03.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 | 6 ms | 4 MB |
g++ | 03_random_07.in | AC | 6 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 | 6 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 | 6 ms | 4 MB |
g++ | 05_large_01.in | AC | 6 ms | 4 MB |
g++ | 05_large_02.in | AC | 6 ms | 4 MB |
g++ | 05_large_03.in | AC | 6 ms | 4 MB |
g++ | 05_large_04.in | AC | 6 ms | 4 MB |
g++ | 05_large_05.in | AC | 6 ms | 4 MB |
g++ | 06_biased_00.in | AC | 6 ms | 4 MB |
g++ | 06_biased_01.in | AC | 6 ms | 4 MB |
g++ | 06_biased_02.in | AC | 6 ms | 4 MB |
g++ | 06_biased_03.in | AC | 6 ms | 4 MB |
g++ | 06_biased_04.in | AC | 6 ms | 4 MB |
g++ | 06_biased_05.in | AC | 6 ms | 4 MB |
g++ | 06_biased_06.in | AC | 6 ms | 4 MB |
g++ | 06_biased_07.in | AC | 6 ms | 4 MB |
g++ | 06_biased_08.in | AC | 6 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++ | 02_corner_03.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 | 6 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 | 6 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 | 6 ms | 4 MB |
clang++ | 05_large_01.in | AC | 6 ms | 4 MB |
clang++ | 05_large_02.in | AC | 6 ms | 4 MB |
clang++ | 05_large_03.in | AC | 6 ms | 4 MB |
clang++ | 05_large_04.in | AC | 6 ms | 4 MB |
clang++ | 05_large_05.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_00.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_01.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_02.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_03.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_04.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_05.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_06.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_07.in | AC | 6 ms | 4 MB |
clang++ | 06_biased_08.in | AC | 6 ms | 4 MB |