codevs 1993 草地排水 USACO

/*Dinic*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define maxn 210
#define inf 0x7fffffff
using namespace std;
int n,m,num,head[maxn],cur[maxn],dis[maxn];
struct node{
    int u,v,flow,pre;
}e[maxn*];
void Add(int from,int to,int t){
    e[num].u=from;
    e[num].v=to;
    e[num].flow=t;
    e[num].pre=head[from];
    head[from]=num++;
}
void Init(){
    scanf("%d%d",&m,&n);
    int u,v,t;
    memset(head,-,sizeof(head));
    for(int i=;i<=m;i++){
        scanf("%d%d%d",&u,&v,&t);
        Add(u,v,t);Add(v,u,);
    }
}
bool Bfs(){
    memset(dis,-,sizeof(dis));
    queue<int>q;
    q.push();dis[]=;
    while(!q.empty()){
        int k=q.front();q.pop();
        for(int i=head[k];i!=-;i=e[i].pre){
            int v=e[i].v;
            if(dis[v]!=-||!e[i].flow)continue;
            q.push(v);dis[v]=dis[k]+;;
        }
    }
    return dis[n]!=-;
}
int Dfs(int now,int lim){
    if(!lim||now==n)return lim;
    int r=;
    for(int &i=cur[now];i!=-;i=e[i].pre){
        int v=e[i].v,s=;
        if(dis[v]==dis[now]+&&(s=Dfs(v,min(lim,e[i].flow)))){
            e[i].flow-=s;r+=s;
            e[i^].flow+=s;lim-=s;
        }
        if(lim==)break;
    }
    return r;
}
void Dinic(){
    int ans=;
    while(Bfs()){
        memcpy(cur,head,sizeof(head));
        ans+=Dfs(,0x7fffffff);
    }
    printf("%d\n",ans);
}
int main()
{
    Init();
    Dinic();
    return ;
}