poj 1273

#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 205
#include<queue>
using namespace std;

int map[maxn][maxn],p[maxn],n,m;
bool flag[maxn];
bool bfs()
{
queue<int>q;
memset(flag,0,sizeof flag);
memset(p,-1,sizeof p);
q.push(1);
flag[1]=1;
while(!q.empty())
{
int now=q.front();
q.pop();
if(now==m) return 1;
for(int i=1; i<=m; i++)
if(map[now][i]>0&&!flag[i])
{
flag[i]=1;
p[i]=now;
q.push(i);
}
}
return 0;
}

void ek()
{
int u,flow=0,t;
while(bfs())
{
t=99999999;
u=m;
while(p[u]!=-1)
{
t=min(t,map[p[u]][u]);
u=p[u];
}
flow+=t;
u=m;
while(p[u]!=-1)
{
map[p[u]][u]-=t;
map[u][p[u]]+=t;
u=p[u];
}
}
printf("%d\n",flow);
}

int main()
{
int a,b,f;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(map,0,sizeof map);
while(n--)
{
scanf("%d%d%d",&a,&b,&f);
map[a][b]+=f;
}
ek();
}
return 0;
}