题意:有n个岛屿,m条路,给出n个岛屿的坐标,路的起点终点和人数容量,求从最西边到最东边的最大可行人数。
最大流裸题,注意这是无向边,所以加边时反向边容量也设为w
时间卡的很紧,G++: 9600+ms、c++ T 了。。。
链接:hdu 4280
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 100005;
const int maxm = 1000005;
int n, m;//点数、边数
int sp, tp;//原点、汇点
struct node {
int u;
int v, next;
int cap;
}mp[maxm];
int pre[maxn], dis[maxn], cur[maxn];//cur为当前弧优化,dis存储分层图中每个点的层数(即到原点的最短距离),pre建邻接表
int cnt = 0;
void init() { //不要忘记初始化
cnt = 0;
memset(pre, -1, sizeof(pre));
}
void add(int u, int v, int w) { //加边
mp[cnt].u = u;
mp[cnt].v = v;
mp[cnt].cap = w;
mp[cnt].next = pre[u];
pre[u] = cnt++;
mp[cnt].u = v;
mp[cnt].v = u;
mp[cnt].cap = w;
mp[cnt].next = pre[v];
pre[v] = cnt++;
}
bool bfs() { //建分层图
memset(dis, -1, sizeof(dis));
queue<int>q;
while(!q.empty())
q.pop();
q.push(sp);
dis[sp] = 0;
int u, v;
while(!q.empty()) {
u = q.front();
q.pop();
for(int i = pre[u]; i != -1; i = mp[i].next) {
v = mp[i].v;
if(dis[v] == -1 && mp[i].cap > 0) {
dis[v] = dis[u] + 1;
q.push(v);
if(v == tp)
break;
}
}
}
return dis[tp] != -1;
}
int dfs(int u, int cap) {//寻找增广路
if(u == tp || cap == 0)
return cap;
int res = 0, f;
for(int &i = cur[u]; i != -1; i = mp[i].next) {//
int v = mp[i].v;
if(dis[v] == dis[u] + 1 && (f = dfs(v, min(cap - res, mp[i].cap))) > 0) {
mp[i].cap -= f;
mp[i ^ 1].cap += f;
res += f;
if(res == cap)
return cap;
}
}
if(!res)
dis[u] = -1;
return res;
}
int dinic() {
int ans = 0;
while(bfs()) {
for(int i = 0; i <= n + 1; i++)
cur[i] = pre[i];
ans += dfs(sp, inf);
}
return ans;
}
int main()
{
int np, nc;
int T;
scanf("%d", &T);
while(T--) {
scanf("%d %d", &n, &m);
init();
int a, b, minn = inf, maxx = -inf;
for(int i = 1; i <= n; i++) {
scanf("%d %d", &a, &b);
if(a > maxx) {
maxx = a;
tp = i;
}
if(a < minn) {
minn = a;
sp = i;
}
}
int c;
for(int i = 1; i <= m; i++) {
scanf("%d %d %d", &a, &b, &c);
add(a, b, c);
}
int ans = dinic();
printf("%d\n", ans);
}
return 0;
}