网络流Dinic
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100005,maxm = 100005;
struct node
{
int to,next,flow;
node(void){}
node(int a,int b,int c) : to(a),next(b),flow(c){}
}e[maxm * 2];
int d[maxn];
int final[maxn],cur[maxn];
int n,m,tot,s,t;
void link(int u,int v,int c)
{
e[++ tot] = node(v,final[u],c),final[u] = tot;
e[++ tot] = node(u,final[v],0),final[v] = tot;
}
bool bfs()
{
static int que[maxn];
for(int i = s;i <= t;i ++) d[i] = -1,cur[i] = final[i];
d[s] = 0;
que[1] = s;
for(int fi = 1,en = 1;fi <= en;fi ++)
{
int u = que[fi];
for(int i = final[u];i;i = e[i].next)
if (e[i].flow > 0 && d[e[i].to] == -1)
{
d[e[i].to] = d[u] + 1;
que[++ en] = e[i].to;
}
}
return d[t] != -1;
}
int dfs(int now,int flow)
{
if (now == t) return flow;
int use = 0;
for(int i = cur[now];i;i = e[i].next)
{
cur[now] = i;
if (e[i].flow > 0 && d[e[i].to] == d[now] + 1)
{
int tmp = dfs(e[i].to,min(e[i].flow,flow - use));
use += tmp,e[i].flow -= tmp,e[i ^ 1].flow += tmp;
if (flow == use) return use;
}
}
return use;
}
int main()
{
tot = 1;
scanf("%d%d", &n, &m);
s = 1,t = n;
for(int i = 1;i <= m;i ++)
{
int u,v,c;
scanf("%d%d%d", &u, &v, &c);
link(u,v,c);
}
int ans = 0;
for(;bfs();)
ans += dfs(s,1 << 30);
printf("%d\n", ans);
return 0;
}