Paratroopers
来源:互联网 发布:二手知豆电动汽车价格 编辑:程序博客网 时间:2024/06/06 20:04
Paratroopers
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 7881 Accepted: 2373
Description
It is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in the m × n grid yard of one their main weapon factories in order to destroy it. In addition, the spies informed them the row and column of the places in the yard in which each paratrooper will land. Since the paratroopers are very strong and well-organized, even one of them, if survived, can complete the mission and destroy the whole factory. As a result, the defense force of the Earth must kill all of them simultaneously after their landing.
In order to accomplish this task, the defense force wants to utilize some of their most hi-tech laser guns. They can install a gun on a row (resp. column) and by firing this gun all paratroopers landed in this row (resp. column) will die. The cost of installing a gun in the ith row (resp. column) of the grid yard is ri (resp. ci ) and the total cost of constructing a system firing all guns simultaneously is equal to the product of their costs. Now, your team as a high rank defense group must select the guns that can kill all paratroopers and yield minimum total cost of constructing the firing system.
Input
Input begins with a number T showing the number of test cases and then, T test cases follow. Each test case begins with a line containing three integers 1 ≤ m ≤ 50 , 1 ≤ n ≤ 50 and 1 ≤ l ≤ 500 showing the number of rows and columns of the yard and the number of paratroopers respectively. After that, a line with m positive real numbers greater or equal to 1.0 comes where the ith number is ri and then, a line with n positive real numbers greater or equal to 1.0 comes where the ith number is ci. Finally, l lines come each containing the row and column of a paratrooper.
Output
For each test case, your program must output the minimum total cost of constructing the firing system rounded to four digits after the fraction point.
Sample Input
1
4 4 5
2.0 7.0 5.0 2.0
1.5 2.0 2.0 8.0
1 1
2 2
3 3
4 4
1 4
Sample Output
16.0000
Source
Amirkabir University of Technology Local Contest 2006
好恶心的题啊,一直超时,后来也没有怎么改经过一大波的TLE后就过了,好奇怪,难道精度没有控制好?
#include <map>#include <cmath>#include <queue>#include <stack>#include <string>#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;const double INF = 10000.0;const double eps = 1e-8;const int Max = 3000;struct Edge{ int v; int next; double cap;}E[Max];int Head[120];int Du[120];int top;int n,m,L;int s,t;void AddEdge(int u,int v,double w){ E[top].cap=w;E[top].v=v; E[top].next=Head[u];Head[u]=top++; E[top].cap=0;E[top].v=u; E[top].next=Head[v];Head[v]=top++;}double Eps(double s){ return fabs(s)<eps?0:s;}double min(double a,double b){ return a<b?a:b;}int bfs(){ memset(Du,0,sizeof(Du)); queue<int>Q; Du[s]=1; Q.push(s); while(!Q.empty()) { int a=Q.front(); Q.pop(); for(int i=Head[a];i!=-1;i=E[i].next) { if(Du[E[i].v]==0&&Eps(E[i].cap)>0) { Du[E[i].v]=Du[a]+1; Q.push(E[i].v); } } } return Du[t];}double dfs(int star,double num){ if(star==t) { return num; } double S=0; double ant; for(int i=Head[star];i!=-1;i=E[i].next) { if(Du[star]+1==Du[E[i].v]&&Eps(E[i].cap)>0) { ant=dfs(E[i].v,min(E[i].cap,num)); E[i].cap-=ant; E[i^1].cap+=ant; num-=ant; S+=ant; if(Eps(num)==0) { break; } } } return S;}double Dinic(){ double ant=0; while(bfs()) { ant+=dfs(0,INF); } return ant;}int main(){ int T; double w; int u,v; scanf("%d",&T); while(T--) { scanf("%d %d %d",&n,&m,&L); s=0; t=n+m+1; top=0; memset(Head,-1,sizeof(Head)); for(int i=1;i<=n;i++) { scanf("%lf",&w); AddEdge(s,i,log(w)); } for(int i=1;i<=m;i++) { scanf("%lf",&w); AddEdge(n+i,t,log(w)); } for(int i=1;i<=L;i++) { scanf("%d %d",&u,&v); AddEdge(u,v+n,INF); } printf("%.4f\n",exp(Dinic())); } return 0;}
- Paratroopers
- poj3308 Paratroopers
- POJ3308 Paratroopers
- pku 3308 Paratroopers
- POJ 3308 Paratroopers
- poj 3308 Paratroopers
- poj 3308 Paratroopers
- POJ 3308 Paratroopers
- POJ 3308: Paratroopers
- POJ 3308 Paratroopers
- POJ 3308 Paratroopers
- POJ-3308-Paratroopers
- poj 3308 Paratroopers
- poj 3308 Paratroopers
- POJ 3308 Paratroopers
- poj 3308 Paratroopers
- POJ 3308--Paratroopers
- POJ 3308 Paratroopers //最小割
- Eclipse出现"Running Android Lint has encountered a problem"解决方案
- 国产手机出海:提着互联网灯笼去印度
- POJ 3468 A Simple Problem with Integers 线段树 区间更新
- PullScrollView进阶(一)----->图片下拉回弹
- 苹果审核reject理由大全(7):引导更新按钮或弹框
- Paratroopers
- iOS声明变量详解【转】
- 零基础学python-2.13 回到我们的游戏 加入循环
- jQuery(2)选择器
- java做图片加水印的功能代码
- 印度将成智能手机市场下一个风口,群雄已开始逐鹿
- 成都麻将胡牌规则
- Android事件处理的两种模型介绍
- 最新版 使用Xcode6.4 和Instruments、Leaks调试解决iOS内存泄露