网络流

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxN=1010,maxM=1000010;
int last[maxN],tov[maxM],next[maxM],len[maxM],
n,m,tot,i,x,y,z,s,t,gap[maxN],cur[maxN],ans,b[maxN];
void insert(int x,int y,int z){
    tov[++tot]=y,len[tot]=z,next[tot]=last[x],last[x]=tot;
}
int min(int a,int b){
    return (a<b)?a:b;
}
int flow(int x,int flo){
    if (x==t) return flo;
    int use=0,i,tmp;
    for (i=cur[x];i;i=next[i]){
        cur[x]=i;
        if (len[i] && b[tov[i]]+1==b[x]){
            tmp=flow(tov[i],min(flo-use,len[i]));
            use+=tmp,len[i]-=tmp,len[i^1]+=tmp;
            if (flo==use) return use;
        }
    }
    cur[x]=last[x];
    if (!(--gap[b[x]])) b[s]=n;
    ++gap[++b[x]];
    return use;
}
int main(){
    freopen("a.in","r",stdin);
    scanf("%d%d",&m,&n),tot=1;
    for (i=1;i<=m;i++)
        scanf("%d%d%d",&x,&y,&z),insert(x,y,z),insert(y,x,0);
    s=1,t=gap[0]=n;
    while (b[s]<n) 
        ans+=flow(s,1<<30);
    printf("%d",ans);
}