This documentation is automatically generated by online-judge-tools/verification-helper
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#include "../../mincostflow/primaldual.cpp"
#undef call_from_test
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int v,e,f;
cin>>v>>e>>f;
PrimalDual<int, int> G(v);
for(int i=0;i<e;i++){
int u,v,c,d;
cin>>u>>v>>c>>d;
G.add_edge(u,v,c,d);
}
if(!G.build(0,v-1,f))
cout<<-1<<endl;
else
cout<<G.get_cost()<<endl;
return 0;
}
#line 1 "test/aoj/GRL_6_B.test.cpp"
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#line 1 "mincostflow/primaldual.cpp"
#line 3 "mincostflow/primaldual.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
// O(F E \log V)
template<typename Flow, typename Cost>
struct PrimalDual{
struct Edge{
int dst;
Flow cap;
Cost cost;
int rev;
Edge(int dst,Flow cap,Cost cost,int rev):
dst(dst),cap(cap),cost(cost),rev(rev){}
};
vector<vector<Edge>> G;
vector<Cost> h,dist;
vector<int> prevv,preve;
PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}
void add_edge(int u,int v,Flow cap,Cost cost){
int e=G[u].size();
int r=(u==v?e+1:G[v].size());
G[u].emplace_back(v,cap,cost,r);
G[v].emplace_back(u,0,-cost,e);
}
Cost residual_cost(int src,Edge &e){
return e.cost+h[src]-h[e.dst];
}
void dijkstra(int s){
struct P{
Cost first;
int second;
P(Cost first,int second):first(first),second(second){}
bool operator<(const P&a) const{return first>a.first;}
};
priority_queue<P> pq;
dist[s]=0;
pq.emplace(dist[s],s);
while(!pq.empty()){
P p=pq.top();pq.pop();
int v=p.second;
if(dist[v]<p.first) continue;
for(int i=0;i<(int)G[v].size();i++){
Edge &e=G[v][i];
if(e.cap==0) continue;
if(!(dist[v]+residual_cost(v,e)<dist[e.dst])) continue;
dist[e.dst]=dist[v]+e.cost+h[v]-h[e.dst];
prevv[e.dst]=v;
preve[e.dst]=i;
pq.emplace(dist[e.dst],e.dst);
}
}
}
Cost res;
bool build(int s,int t,Flow f,
function<void(decltype(h)&)> init=[](decltype(h) &p){
fill(p.begin(),p.end(),0);
}){
res=0;
init(h);
const Cost INF = numeric_limits<Cost>::max();
while(f>0){
fill(dist.begin(),dist.end(),INF);
dijkstra(s);
if(dist[t]==INF) return false;
for(int v=0;v<(int)h.size();v++)
if(dist[v]<INF) h[v]=h[v]+dist[v];
Flow d=f;
for(int v=t;v!=s;v=prevv[v])
d=min(d,G[prevv[v]][preve[v]].cap);
f-=d;
res=res+h[t]*d;
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 true;
}
Cost get_cost(){return res;}
};
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
signed main(){
return 0;
}
#endif
#line 8 "test/aoj/GRL_6_B.test.cpp"
#undef call_from_test
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int v,e,f;
cin>>v>>e>>f;
PrimalDual<int, int> G(v);
for(int i=0;i<e;i++){
int u,v,c,d;
cin>>u>>v>>c>>d;
G.add_edge(u,v,c,d);
}
if(!G.build(0,v-1,f))
cout<<-1<<endl;
else
cout<<G.get_cost()<<endl;
return 0;
}