HDU 1532 Drainage Ditches
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<string>
#include<map>
#include<queue>
#include<vector>
using namespace std;
const int maxe = 2e6 + 10;
const int maxn = 1e3 + 10;
const int INF = 0x3f3f3f3f;
struct edge {
int to, nx, w;
}e[maxe];
int head[maxn];
int sz, n, m;
int prs[maxn], gap[maxn], d[maxn];
void add(int u, int v, int w) {
e[sz].to = v;
e[sz].w = w;
e[sz].nx = head[u];
head[u] = sz++;
e[sz].to = u;
e[sz].w = 0;
e[sz].nx = head[v];
head[v] = sz++;
}
struct cmp {
int x, h;
cmp(int x = 0, int h = 0) :x(x), h(h) {}
inline bool operator < (const cmp &a) const { return h < a.h; }
};
priority_queue<cmp> pq;
bool push(int x, int y, int p) {
int w = min(prs[x], e[p].w);
e[p].w -= w; e[p ^ 1].w += w; prs[x] -= w; prs[y] += w;
return w;
}
void Gap(int l, int s, int t) {
for (int i = 1; i <= n; i++) {
if (i != s && i != t && l < d[i] && d[i] <= n) d[i] = n + 1;
}
}
int maxflow(int s, int t) {
while (!pq.empty()) pq.pop();
memset(prs, 0, sizeof prs);
memset(d, 0, sizeof d);
memset(gap, 0, sizeof gap);
d[s] = n; prs[s] = INF; pq.push(cmp(s, d[s]));
while (!pq.empty()) {
int x = pq.top().x;
pq.pop();
if (!prs[x]) continue;
for (int i = head[x]; i != -1; i = e[i].nx) {
int v = e[i].to; int w = e[i].w;
if ((x == s || d[x] == d[v] + 1) && push(x, v, i) && v != t && v != s) {
pq.push(cmp(v, d[v]));
}
}
if (x != s && x != t && prs[x]) {
if (!(--gap[d[x]])) Gap(d[x], s, t);
++gap[++d[x]];
pq.push(cmp(x, d[x]));
}
}
return prs[t];
}
int main() {
while (~scanf("%d %d", &m, &n)) {
memset(head, -1, sizeof head); sz = 0;
for (int i = 1; i <= m; i++) {
int u, v, w;
scanf("%d %d %d", &u, &v, &w);
if (w == 0) continue;
add(u, v, w);
}
int ans = maxflow(1, n);
printf("%d\n", ans);
}
return 0;
}