mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/aoj/grl/6_A___ford_fulkerson.test.cpp

Depends on

Code

# define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/6/GRL_6_A"

#include "./../../../template/template.hpp"
#include "./../../../graph/ford_fulkerson.hpp"

using namespace mmrz;

void mmrz::solve(){
    int n, m;
    cin >> n >> m;
    ford_fulkerson<int> f(n);
    while(m--){
        int a, b, c;
        cin >> a >> b >> c;
        f.add_edge(a, b, c);
    }
    cout << f.calc(0, n-1) << '\n';
}
#line 1 "verify/aoj/grl/6_A___ford_fulkerson.test.cpp"
# define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/6/GRL_6_A"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "graph/ford_fulkerson.hpp"

#line 5 "graph/ford_fulkerson.hpp"

template<typename T>
struct ford_fulkerson {

	struct edge{
		int to;
		T cap;
		T rev;
	};

	int n;
	std::vector<std::vector<edge>> G;
	std::vector<bool> used;

	ford_fulkerson(int _v) : n(_v), G(n), used(n) {}

	void add_edge(int from, int to, T cap){
		G[from].push_back((edge){to, cap, (T)G[to].size()});
		G[to].push_back((edge){from, 0, (T)(G[from].size() - 1)});
	}

	T dfs(int v, int t, T f){
		if(v == t)return f;
		used[v] = true;
		for(int i = 0;i < (int)G[v].size();i++){
			edge &e = G[v][i];
			if(!used[e.to] && e.cap > 0){
				T d = dfs(e.to, t, min(f, e.cap));
				if(d > 0){
					e.cap -= d;
					G[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}

	T calc(int s, int t){
		T flow = 0;
		for(;;){
			for(int i = 0;i < n;i++)used[i] = false;
			T f = dfs(s, t, std::numeric_limits<T>::max());
			if(f == 0)return flow;
			flow += f;
		}
	}
};
#line 5 "verify/aoj/grl/6_A___ford_fulkerson.test.cpp"

using namespace mmrz;

void mmrz::solve(){
    int n, m;
    cin >> n >> m;
    ford_fulkerson<int> f(n);
    while(m--){
        int a, b, c;
        cin >> a >> b >> c;
        f.add_edge(a, b, c);
    }
    cout << f.calc(0, n-1) << '\n';
}
Back to top page