zkw费用流模板（适用二分图）

hdu 1853 ：

#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
typedef pair <int, int> pl;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 3020, M = 60060;
const int st = N-10, ed = N-9;

int n, m, cnt;
struct node{
    int v, w, c, f, nxt;
}e[M];
int head[N];
int cur[N];
int dis[N];
bool vis[N];
int cost, flow;
int a[50][50];

void init()
{
    cnt = 0;
    memset( head, -1, sizeof( head ) );
}

void add( int u, int v, int c, int w, int f = 0 )
{
    e[cnt].v = v;
    e[cnt].c = c;
    e[cnt].w = w;
    e[cnt].f = f;
    e[cnt].nxt = head[u];
    head[u] = cnt++;

    e[cnt].v = u;
    e[cnt].c = 0;
    e[cnt].f = 0;
    e[cnt].w = -w;
    e[cnt].nxt = head[v];
    head[v] = cnt++;
}

int aug( int u, int f )
{
    if( u == ed )
        return f;
    vis[u] = 1;
    for( int i = cur[u]; ~i; i = e[i].nxt ) {
        int v = e[i].v;
        if( e[i].c > e[i].f && !vis[v] && dis[u] == dis[v] + e[i].w ) {
            int tmp = aug( v, min( f, e[i].c - e[i].f ) );
            e[i].f += tmp;
            e[i^1].f -= tmp;
            cur[u] = i;
            if( tmp )
                return tmp;
        }
    }
    return 0;
}

bool modify_label()
{
    int d = inf;
    for( int u = 1; u < N; ++u ) {
        if( vis[u] ) {
            for( int i = head[u]; ~i; i = e[i].nxt ) {
                int v = e[i].v;
                if( e[i].c > e[i].f && !vis[v] ) {
                    d = min( d, dis[v] + e[i].w - dis[u] );
                }
            }
        }
    }
    if( d == inf )
        return 0;
    for( int i = 1; i < N; ++i ) {
        if( vis[i] ) {
            vis[i] = 0;
            dis[i] += d;
        }
    }
    return 1;
}

int MCMF()
{
    cost = flow = 0;
    for( int i = 1; i < N; ++i )
        dis[i] = 0;
    while( 1 ) {
        memcpy( cur, head, sizeof cur );
        while( 1 ) {
            memset( vis, 0, sizeof( vis ) );
            int tmp = aug( st, inf );
            if( !tmp )
                break;
            flow += tmp;
            cost += tmp * dis[st];
        }
        if( !modify_label() )
            break;
    }
    return cost;
}

int main()
{
    while( ~scanf("%d%d", &n, &m) ) {
        init();
        for( int i = 1; i <= n; ++i ) {
            add( st, i, 1, 0 );
            add( i+n, ed, 1, 0 );
        }
        while( m-- ) {
            int u, v, w;
            scanf("%d%d%d", &u, &v, &w);
            add( u, v+n, 1, w );
        }
        int ans = MCMF();
        if( flow != n )
            puts("-1");
        else
            printf("%d\n", ans);
    }
    return 0;
}