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_B.test.cpp

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B"

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

using namespace mmrz;

void mmrz::solve(){
	int v, e, f;
	cin >> v >> e >> f;
	primal_dual<int> mcf(v);
	rep(i, e){
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		mcf.add_edge(a, b, c, d);
	}
	auto ret = mcf.min_cost_flow(0, v-1, f);
	if(ret.first){
		cout << ret.second << '\n';
	}else{
		cout << "-1\n";
	}
}
#line 1 "verify/aoj/grl/6_B.test.cpp"
#define PROBLEM "https://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 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/primal_dual.hpp"

#line 8 "graph/primal_dual.hpp"

template<typename T>
struct primal_dual{
	struct edge {
		int to;
		T cap, cost, rev;
		T max_cap;
	};
	int V;
	T infty;
	std::vector<std::vector<edge>> G;
	std::vector<T> h, dist;
	std::vector<int> prevv, preve;
	std::vector<bool> used_edge;

	primal_dual(int _V) : V(_V), infty(std::numeric_limits<T>::max()/2) {
		G.resize(V);
		h.resize(V);
		dist.resize(V);
		prevv.resize(V);
		preve.resize(V);
		used_edge.resize(V);
	}

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

	std::pair<bool, T> min_cost_flow(int s, int t, T f){
		T res = 0;
		while(f > 0){
			std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<std::pair<T, int>>> que;
			dist.assign(V, infty);
			dist[s] = 0;
			que.push({0, s});
			while(not que.empty()){
				auto [cst, v] = que.top();
				que.pop();
				if(dist[v] < cst)continue;
				for(int i = 0;i < (int)G[v].size();i++){
					auto &e = G[v][i];
					if(e.cap > 0 && dist[e.to] > dist[v]+e.cost+h[v]-h[e.to]){
						dist[e.to] = dist[v]+e.cost+h[v]-h[e.to];
						prevv[e.to] = v;
						preve[e.to] = i;
						que.push({dist[e.to], e.to});
					}
				}
			}
			if(dist[t] == infty){
				return make_pair(false, res);
			}
			for(int v = 0;v < V;v++){
				if(not used_edge[v])continue;
				h[v] += dist[v];
			}
			T d = f;
			for(int v = t;v != s;v = prevv[v]){
				d = min(d, G[prevv[v]][preve[v]].cap);
			}
			f -= d;
			res += d*h[t];
			for(int v = t;v != s;v = prevv[v]){
				edge &e = G[prevv[v]][preve[v]];
				e.cap -= d;
				G[v][e.rev].cap += d;
			}
		}
		return make_pair(true, res);
	}
};
#line 5 "verify/aoj/grl/6_B.test.cpp"

using namespace mmrz;

void mmrz::solve(){
	int v, e, f;
	cin >> v >> e >> f;
	primal_dual<int> mcf(v);
	rep(i, e){
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		mcf.add_edge(a, b, c, d);
	}
	auto ret = mcf.min_cost_flow(0, v-1, f);
	if(ret.first){
		cout << ret.second << '\n';
	}else{
		cout << "-1\n";
	}
}
Back to top page