pku1273 Drainage Ditches

//pku1273 hdu1532
#include<string.h>
#define VMAX 201
#define INF 0x7ffffff
int n, m; //分别表示图的边数和顶点数
int c[VMAX][VMAX];   //容量
int Edmonds_Karp( int s, int t ) //输入源点和汇点
{
int p,q,queue[VMAX],u,v,pre[VMAX],flow= 0,aug;
while(true)
{    memset(pre,-1,sizeof(pre)); //记录父节点
for( queue[p=q=0]=s; p<=q; p++ ) //广度优先搜索
{   u= queue[p];
for( v=0; v<m&&pre[t]<0; v++ )
if( c[u][v]>0 && pre[v]<0 )   pre[v]=u, queue[++q]=v;
if( pre[t]>=0 )    break;
}
if( pre[t]<0 )    break; //不存在增广路
aug= INF;    //记录最小残留容量
for( u=pre[v=t]; v!=s; v=u,u=pre[u] )
if(c[u][v]<aug)    aug=c[u][v];
for( u=pre[v=t]; v!=s; v=u,u=pre[u] )
c[u][v]-=aug, c[v][u]+=aug;
flow+= aug;
}
return flow;
}
#include<stdio.h>
int main()
{
while(scanf("%d%d",&n,&m)!=-1)
{
int a,b,d;
memset(c,0,sizeof(c));
for(int i=0;i<n;i++)
{	scanf("%d%d%d",&a,&b,&d);
c[a-1][b-1]+=d;
}
printf("%d\n",Edmonds_Karp(0,m-1));
}
return 0;
}