N - Optimal Milking POJ - 2112
题意:有n个奶牛m个挤奶机,然后让你找到每一个奶牛都到挤奶机的最近距离,且每一个挤奶机最多容纳的奶牛数目有限。
分析:n个奶牛m个挤奶机,且奶牛可以通过其他地方到达另一个挤奶机,所以需要Floyed来跑一个多元最多路,接着便可以二分距离求解即可。
#include <iostream>
#include <cstdio>
#include <stack>
#include <cmath>
#include <set>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
const int INF = 0x3f3f3f3f;
const int maxn = 1510;
int un, vn, g[maxn][maxn], linker[maxn][maxn];
bool used[maxn];
int num[maxn], mid, n, m, t, b, a[maxn][maxn];
string str;
bool dfs(int u)
{
for(int v = 1; v <= n; v++) ///
if(g[u][v] && !used[v])
{
used[v] = 1;
if(linker[v][0] < t)
{
linker[v][++linker[v][0]] = u;
return true;
}
for(int i = 1; i <= t; i++)
if(dfs(linker[v][i])){
linker[v][i] = u;
return true;
}
}
return false;
}
int hungry()
{
int res = 0;
for(int i = 0; i <= n + m; i++) linker[i][0] = 0;
for(int u = n + 1; u <= n + m; u++){
memset(used, 0, sizeof(used));
if(dfs(u)) res++;
}
return res;
}
int main()
{
while(~scanf("%d%d%d", &n, &m, &t))
{
memset(g, 0, sizeof(g));
for(int i = 1; i <= n + m; i++)
for(int j = 1; j <= n + m; j++)
{
scanf("%d", &a[i][j]);
if(!a[i][j]) a[i][j] = INF;
}
for(int k = 1; k <= n + m; k++)
for(int i = 1; i <= n + m; i++)
for(int j = 1; j <= n + m; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
int l = 0, r = 0x3f3f3f3f, ans = 0;
while(l <= r)
{
mid = (l + r) / 2;
memset(g, 0, sizeof(g));
for(int i = n + 1; i <= n + m; i++)
for(int j = 1; j <= n; j++)
if(a[i][j] <= mid) g[i][j] = 1;
int res = hungry();
//cout << res<<endl;
if(res == m) ans = mid, r = mid - 1;
else l = mid + 1;
}
printf("%d\n", ans);
}
return 0;
}