费用流

//hdu3667
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MAXN = 100 + 5;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll MAXM = 50000 + 5;//边数，要开成两倍

ll fst[MAXN], ecnt, from[MAXM], to[MAXM], len[MAXM], cap[MAXM], nxt[MAXM];

void add(ll u, ll v, ll c, ll w) {
    ecnt++;
    from[ecnt] = u;
    to[ecnt] = v;
    cap[ecnt] = c;
    len[ecnt] = w;
    nxt[ecnt] = fst[u];
    fst[u] = ecnt;
}

ll d[MAXN], p[MAXN], a[MAXN];
bool inq[MAXN];

bool spfa(ll s, ll t, ll &flow, ll &cost, ll lim) {
    memset(d, 0x3f, sizeof(d));
    memset(inq, 0, sizeof(inq));
    //memset(p, 0, sizeof(p));
    queue<ll> q;
    q.push(s);
    d[s] = 0;
    inq[s] = true;
    p[s] = 0;
    a[s] = INF;
    while (!q.empty()) {
        ll u = q.front();
        q.pop();
        inq[u] = false;
        for (ll i = fst[u]; i; i = nxt[i]) {
            ll v = to[i];
            if (cap[i] > 0 && d[v] > d[u] + len[i]) {
                d[v] = d[u] + len[i];
                p[v] = i;
                a[v] = min(a[u], cap[i]);
                if (!inq[v]) {
                    q.push(v);
                    inq[v] = true;
                }
            }
        }
    }
    if (d[t] == INF)return false;
    if (flow + a[t] > lim) {
        ll aa = lim - flow;
        flow += aa;
        cost += aa * d[t];
        for (ll u = t; u != s; u = from[p[u]]) {
            cap[p[u]] -= aa;
            cap[p[u] ^ 1] += aa;
        }
        return false;
    }
    flow += a[t];
    cost += a[t] * d[t];
    for (ll u = t; u != s; u = from[p[u]]) {
        cap[p[u]] -= a[t];
        cap[p[u] ^ 1] += a[t];
    }
    return true;
}

int main() {
    ll n, m, k;
    while (scanf("%lld%lld%lld", &n, &m, &k) == 3) {
        ecnt = 1;
        memset(fst, 0, sizeof(fst));
        //使用前注意n是点的个数
        for (ll i = 1; i <= m; i++) {
            ll u, v, a, c;
            scanf("%lld%lld%lld%lld", &u, &v, &a, &c);
            for (ll j = 1; j <= c; j++) {
                add(u, v, 1, a * (2 * j - 1));
                add(v, u, 0, -a * (2 * j - 1));
            }

        }
        ll flow = 0, cost = 0;
        while (spfa(1, n, flow, cost, k));
        if (flow != k) {
            printf("-1\n");
        } else {
            printf("%lld\n", cost);
        }
    }
    return 0;
}