【bzoj1733】[Usaco2005 feb]Secret Milking Machine 神秘的挤奶机 二分+网络流最大流

题目描述

Farmer John is constructing a new milking machine and wishes to keep it secret as long as possible. He has hidden in it deep within his farm and needs to be able to get to the machine without being detected. He must make a total of T (1 <= T <= 200) trips to the machine during its construction. He has a secret tunnel that he uses only for the return trips. The farm comprises N (2 <= N <= 200) landmarks (numbered 1..N) connected by P (1 <= P <= 40,000) bidirectional trails (numbered 1..P) and with a positive length that does not exceed 1,000,000. Multiple trails might join a pair of landmarks. To minimize his chances of detection, FJ knows he cannot use any trail on the farm more than once and that he should try to use the shortest trails. Help FJ get from the barn (landmark 1) to the secret milking machine (landmark N) a total of T times. Find the minimum possible length of the longest single trail that he will have to use, subject to the constraint that he use no trail more than once. (Note well: The goal is to minimize the length of the longest trail, not the sum of the trail lengths.) It is guaranteed that FJ can make all T trips without reusing a trail.

约翰正在制造一台新型的挤奶机，但他不希望别人知道．他希望尽可能久地隐藏这个秘密．他把挤奶机藏在他的农场里，使它不被发现．在挤奶机制造的过程中，他需要去挤奶机所在的地方T(1≤T≤200)次．他的农场里有秘密的地道，但约翰只在返回的时候用它．农场被划分成N(2≤N≤200)块区域，用1到200标号．这些区域被P(1≤P≤40000)条道路连接，每条路有一个小于10^6的长度L．两块区域之间可能有多条道路连接．为了减少被发现的可能，约翰不会两次经过农场上的任何一条道路．当然了，他希望走最短的路． 请帮助约翰寻找这T次从仓库走到挤奶机所在地的路线．仓库是区域1，挤奶机所在地是区域N．我们现在要求的是约翰经过的这些道路中最长的路的长度最小是多少，当然他不能重复走某一条路．请注意，我们要求的不是最短的总路程长度，而是所经过的直揍连接两个区域的道路中最长的道路的最小长度． 数据保证约翰可以找到T条没有重复的从仓库到挤奶机所在区域的路．

输入

* Line 1: Three space-separated integers: N, P, and T * Lines 2..P+1: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, indicating that a trail connects landmark A_i to landmark B_i with length L_i.

第1行是3个整数N、P和T，用空格隔开．

第2到P+1行，每行包括3个整数，Ai，Bi，Li．表示区域Ai、Bi之间有一条长度为Li的道路．

输出

* Line 1: A single integer that is the minimum possible length of the longest segment of Farmer John's route.

输出只有一行，包含一个整数，即约翰经过的这些道路中最长的路的最小长度．

样例输入

7 9 2
1 2 2
2 3 5
3 7 5
1 4 1
4 3 1
4 5 7
5 7 1
1 6 3
6 7 3

样例输出

5

---

题解

二分+网络流最大流

显然最大长度满足二分性质，我们可以二分长度mid，这样只能选择长度小于等于mid的边来走。

然后由于题目限制了每条边只能走一次，要求1到n的路径数，显然这是一个最大流问题。

对于原图中的边x->y，长度为z，如果z<=mid，则连边x->y，容量为1；否则不连边。

然后跑最大流，判断是否大于等于T即可，并对应调整上下界。

说实话这道网络流真是再水不过了。

#include <cstdio>
#include <cstring>
#include <queue>
#define N 210
#define M 40010
using namespace std;
queue<int> q;
int n , m , p , x[M] , y[M] , z[M] , head[N] , to[M << 2] , val[M << 2] , next[M << 2] , cnt , s , t , dis[N];
void add(int x , int y , int z)
{
	to[++cnt] = y , val[cnt] = z , next[cnt] = head[x] , head[x] = cnt;
	to[++cnt] = x , val[cnt] = 0 , next[cnt] = head[y] , head[y] = cnt;
}
bool bfs()
{
	int x , i;
	memset(dis , 0 , sizeof(dis));
	while(!q.empty()) q.pop();
	dis[s] = 1 , q.push(s);
	while(!q.empty())
	{
		x = q.front() , q.pop();
		for(i = head[x] ; i ; i = next[i])
		{
			if(val[i] && !dis[to[i]])
			{
				dis[to[i]] = dis[x] + 1;
				if(to[i] == t) return 1;
				q.push(to[i]);
			}
		}
	}
	return 0;
}
int dinic(int x , int low)
{
	if(x == t) return low;
	int temp = low , i , k;
	for(i = head[x] ; i ; i = next[i])
	{
		if(val[i] && dis[to[i]] == dis[x] + 1)
		{
			k = dinic(to[i] , min(temp , val[i]));
			if(!k) dis[to[i]] = 0;
			val[i] -= k , val[i ^ 1] += k;
			if(!(temp -= k)) break;
		}
	}
	return low - temp;
}
bool judge(int mid)
{
	int i , ans = 0;
	memset(head , 0 , sizeof(head)) , cnt = 1;
	for(i = 1 ; i <= m ; i ++ )
		if(z[i] <= mid)
			add(x[i] , y[i] , 1) , add(y[i] , x[i] , 1);
	while(bfs()) ans += dinic(s , 0x7fffffff);
	return ans >= p;
}
int main()
{
	int i , l = 0 , r = 0 , mid , ans = -1;
	scanf("%d%d%d" , &n , &m , &p) , s = 1 , t = n;
	for(i = 1 ; i <= m ; i ++ ) scanf("%d%d%d" , &x[i] , &y[i] , &z[i]) , r = max(r , z[i]);
	while(l <= r)
	{
		mid = (l + r) >> 1;
		if(judge(mid)) ans = mid , r = mid - 1;
		else l = mid + 1;
	}
	printf("%d\n" , ans);
	return 0;
}