题目链接:
[POJ 3308]Paratroopers[最大流]
题意分析:
在一副n行,m列的坐标图上,有着l个敌人。现在我们有阿姆斯特朗回旋加速炮,可以一口气秒杀一行或者一列的敌人。但是我们的阿姆斯特朗回旋加速炮配置需要价格,第i行上配置要cr[i]元,第i列上配置要cc[i]元。现在要干掉所有敌人,我们最少需要多少钱?(花费钱数等于所有的炮费的乘积。product竟然是乘积,夭寿啦~~~)
解题思路:
如果这题是求和最小的话,我们就能转换为最大流了。那么想想怎么把乘变成加呢?于是神奇的log登场了,利用这个,我们就可以化乘为和了。这样,源点和行连一条cr[i]的边,汇点和列连一条cc[i]的边,然后每个敌人所在的行和列连一条inf的边。最后把答案转换回来就行啦~
个人感受:
乘积啊!!!虽然知道是乘积,但也没想着求和。直接脑子发热写了费用流= =,结果显而易见了。然后用网络流,WA了一个版本,听说卡精度,就各种改板子,然后T了= =T了= =。最后发现是板子改错了。。。。。。然后现在的版本和精度没有半毛钱关系= =
具体代码如下:
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#define lowbit(x) (x & (-x))
#define ll long long
#define pr(x) cout << #x << " = " << (x) << '\n';
using namespace std;
const int MAXN = 155;//点数的最大值
const int MAXM = 5000;//边数的最大值
const double INF = 1e7;
const double eps = 1e-7;
struct Edge
{
int to,next;
double cap,flow;
}edge[MAXM];//注意是MAXM
int tol, src, des;
int head[MAXN];
int gap[MAXN],dep[MAXN],pre[MAXN],cur[MAXN];
void init()
{
tol = 0;
memset(head,-1,sizeof(head));
}
//加边,单向图三个参数,双向图四个参数
void addedge(int u,int v,double w,int rw=0)
{
edge[tol].to = v;edge[tol].cap = w;edge[tol].next = head[u];
edge[tol].flow = 0;head[u] = tol++;
edge[tol].to = u;edge[tol].cap = rw;edge[tol].next = head[v];
edge[tol].flow = 0;head[v]=tol++;
}
//输入参数:起点、终点、点的总数
//点的编号没有影响,只要输入点的总数
double sap(int start,int end,int N)
{
memset(gap,0,sizeof(gap));
memset(dep,0,sizeof(dep));
memcpy(cur,head,sizeof(head));
int u = start;
pre[u] = -1;
gap[0] = N;
double ans = 0;
while(dep[start] < N)
{
if(u == end)
{
double Min = INF;
for(int i = pre[u];i != -1; i = pre[edge[i^1].to])
if(Min > edge[i].cap - edge[i].flow )
Min = edge[i].cap - edge[i].flow;
for(int i = pre[u];i != -1; i = pre[edge[i^1].to])
{
edge[i].flow += Min;
edge[i^1].flow -= Min;
}
u = start;
ans += Min;
continue;
}
bool flag = false;
int v;
for(int i = cur[u]; i != -1;i = edge[i].next)
{
v = edge[i].to;
if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u])
{
flag = true;
cur[u] = pre[v] = i;
break;
}
}
if(flag)
{
u = v;
continue;
}
int Min = N;
for(int i = head[u]; i != -1;i = edge[i].next)
if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
{
Min = dep[edge[i].to];
cur[u] = i;
}
gap[dep[u]]--;
if(!gap[dep[u]])return ans;
dep[u] = Min+1;
gap[dep[u]]++;
if(u != start) u = edge[pre[u]^1].to;
}
return ans;
}
double a, b;
int main()
{
int kase; scanf("%d", &kase);
while (kase --) {
int n, m, l;
init();
scanf("%d%d%d", &n, &m, &l);
int src = 0, des = n + m + 1;
for (int i = 1; i <= n; ++i) {
scanf("%lf", &a);
addedge(src, i, log2(a));
}
for (int j = 1; j <= m; ++j) {
scanf("%lf", &a);
addedge(j + n, des, log2(a));
}
int u, v;
for (int i = 1; i <= l; ++i) {
scanf("%d%d", &u, &v);
addedge(u, v + n, INF);
}
printf("%.4f\n", pow(2,sap(src, des, des + 1)));
}
return 0;
}