POJ 2391 Ombrophobic Bovines(二分+网络流)

题意：给出n个牛棚，一开始每个牛棚有一些牛，但是每个牛棚只能住下规定数量的牛，每个牛棚之间有路可以互相到达，但是要花费一些时间，问是否有办法使得所有牛都有牛棚住，如果有办法，输出最小的时间花费。

解法：因为是问时间花费，所以很容易就想到了二分上面。先跑一边floyd得到每个牛棚之间的花费时间，直接二分时间，不断建图即可。

代码如下：

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<utility>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
using namespace std;
const int maxn = 1e4;
const int maxm = 1e6;
const long long INF = 1e18;
int n, m;

int head[maxn],cur[maxn],nx[maxm<<1],to[maxm<<1],ppp=0;
long long flow[maxm<<1];
struct Dinic
{
	int dis[maxn];
	int s, t;
	long long ans;
	
	void init() {
		memset(head, -1, sizeof(head));
		ppp = 0;
	}
	
	void AddEdge(int u, int v, long long c) {
		to[ppp]=v;flow[ppp]=c;nx[ppp]=head[u];head[u]=ppp++;swap(u,v);
		to[ppp]=v;flow[ppp]=0;nx[ppp]=head[u];head[u]=ppp++;
	}
	
	bool BFS() {
		memset(dis, -1, sizeof(dis));
		dis[s] = 1; 
		queue<int> Q;
		Q.push(s);
		while(!Q.empty()) {
			int x = Q.front();
			Q.pop();
			for(int i = head[x]; ~i; i = nx[i]) {
				if(flow[i] && dis[to[i]] == -1) {
					dis[to[i]] = dis[x] + 1;
					Q.push(to[i]);
				}
			}
		}
		return dis[t] != -1;
	}
	
	long long DFS(int x, long long maxflow) {
		if(x == t || !maxflow){
			ans += maxflow;
			return maxflow;
		}
		long long ret = 0, f;
		for(int &i = cur[x]; ~i; i = nx[i]) {
			if(dis[to[i]] == dis[x] + 1 && (f = DFS(to[i], min(maxflow, flow[i])))) {
				ret += f;
				flow[i] -= f;
				flow[i^1] += f;
				maxflow -= f;
				if(!maxflow)
					break;
			}
		}
		return ret;
	}
	
	long long solve(int source, int tank) {
		s = source;
		t = tank;
		ans = 0;
		while(BFS()) {
			memcpy(cur, head, sizeof(cur));
			DFS(s, INF);
		}
		return ans;
	}
}dinic;

long long G[maxn][maxn];
long long cow[maxn], shelter[maxn];

void build(long long mid) {
	dinic.init();
	int s = 0, t = 1;
	for(int i = 1; i <= n; i++) {
		if(cow[i])
			dinic.AddEdge(s, 2 * i, cow[i]);
		if(shelter[i])
			dinic.AddEdge(2 * i + 1, t, shelter[i]);
		for(int j = 1; j <= n ; j++) {
			if(G[i][j] <= mid) {
				dinic.AddEdge(i * 2, j * 2 + 1, INF);
			}
		}
	}
}

void floyd() {
	for(int k = 1; k <= n; k++) {
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
			}
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
#endif
	long long sum = 0;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++) {
		scanf("%lld%lld", &cow[i], &shelter[i]);
		sum += cow[i];
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++)
			G[i][j] = INF;
		G[i][i] = 0;
	}
	while(m--) {
		int u, v;
		long long tmp;
		scanf("%d%d%lld", &u, &v, &tmp);
		if(G[u][v] > tmp)
			G[u][v] = G[v][u] = tmp;
	}
	floyd();
	long long front = 0, back = INF;
	while(back != front) {
		long long mid = (front + back) / 2;
		build(mid);
		long long ans = dinic.solve(0, 1);
		if(ans < sum)
			front = mid + 1;
		else
			back = mid;
	}
	if(back != INF)
		printf("%lld\n", back);
	else
		printf("-1\n");
	return 0;
}