虽然数据很大,但是dinic可过。
注意开LL。
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 5005, maxm = 30005, maxq = 10000;
const LL inf = 0x7FFFFFFFFFFFFFFFLL;
int n, m, depth[maxn], head[maxn], cur[maxn], cnt, bg, ed, q[maxq];
struct _edge {
int v, next;
LL w;
} g[maxm << 2];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline void add(int u, int v, int w) {
g[cnt] = (_edge) {v, head[u], w};
head[u] = cnt++;
}
bool bfs() {
for(int i = 1; i <= n; i++) depth[i] = -1;
int h = 0, t = 0, i, u; depth[q[t++] = bg] = 1;
while(h != t) for(i = head[u = q[h++]]; ~i; i = g[i].next) if(g[i].w && !~depth[g[i].v]) {
depth[g[i].v] = depth[u] + 1;
if(g[i].v == ed) return 1;
q[t++] = g[i].v;
}
return 0;
}
LL dfs(int x, LL flow) {
if(x == ed) return flow;
LL left = flow;
for(int i = cur[x]; ~i; i = g[i].next) if(g[i].w && depth[g[i].v] == depth[x] + 1) {
LL tmp = dfs(g[i].v, min(g[i].w, left));
left -= tmp; g[i].w -= tmp; g[i ^ 1].w += tmp;
if(g[i].w) cur[x] = i;
if(!left) return flow;
}
if(left == flow) depth[x] = -1;
return flow - left;
}
int main() {
n = iread(); m = iread();
for(int i = 1; i <= n; i++) head[i] = -1;
for(int i = 1; i <= m; i++) {
int x = iread(), y = iread(), c = iread();
add(x, y, c); add(y, x, 0);
add(y, x, c); add(x, y, 0);
}
LL ans = 0; bg = 1; ed = n;
while(bfs()) {
for(int i = 1; i <= n; i++) cur[i] = head[i];
ans += dfs(bg, inf);
}
printf("%lld\n", ans);
return 0;
}