Communication System (P1018)
来源:互联网 发布:linux 怎么进入vi 编辑:程序博客网 时间:2024/06/05 04:09
在网上看到这一个题是DP题,所以来做一下,可是不知道无DP
还是用的小贪心了。
#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#include<vector>#include<cmath>#include<set>#include<cstdlib>#include<cstring>#include<stack>#include<string>using namespace std;#define N 105struct my{double b;double p;}go[N][N];bool cmp(my a,my b){return a.p<b.p;}int c[N];int main(){freopen("in.txt","r",stdin);int i,j,k;int n;int t;cin>>t;while (t--){cin>>n;for (i=0;i<n;i++){cin>>c[i];for (j=0;j<c[i];j++)cin>>go[i][j].b>>go[i][j].p;sort(go[i],go[i]+c[i],cmp);}double ans=0;for (i=0;i<n;i++){for (j=0;j<c[i];j++){double b=go[i][j].b;double p=go[i][j].p;bool ok=true;for (k=0;k<n;k++){if (k==i)continue;if (b>go[k][c[k]-1].b){ok=false;break;}int e;for ( e=0;e<c[k];e++){if (go[k][e].b>=b)break;}p+=go[k][e].p;}if (ok)ans=max(ans,b/p);}}printf("%.3f\n",ans);}}
Communication System
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18723 Accepted: 6626
Description
We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufacturers. Same devices from two manufacturers differ in their maximum bandwidths and prices.
By overall bandwidth (B) we mean the minimum of the bandwidths of the chosen devices in the communication system and the total price (P) is the sum of the prices of all chosen devices. Our goal is to choose a manufacturer for each device to maximize B/P.
By overall bandwidth (B) we mean the minimum of the bandwidths of the chosen devices in the communication system and the total price (P) is the sum of the prices of all chosen devices. Our goal is to choose a manufacturer for each device to maximize B/P.
Input
The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by the input data for each test case. Each test case starts with a line containing a single integer n (1 ≤ n ≤ 100), the number of devices in the communication system, followed by n lines in the following format: the i-th line (1 ≤ i ≤ n) starts with mi (1 ≤ mi ≤ 100), the number of manufacturers for the i-th device, followed by mi pairs of positive integers in the same line, each indicating the bandwidth and the price of the device respectively, corresponding to a manufacturer.
Output
Your program should produce a single line for each test case containing a single number which is the maximum possible B/P for the test case. Round the numbers in the output to 3 digits after decimal point.
Sample Input
1 33 100 25 150 35 80 252 120 80 155 402 100 100 120 110
Sample Output
0.649
- Communication System (P1018)
- Communication System
- Communication System
- Communication System
- Communication System
- Communication System
- p1018
- 1018 Communication System - 贪心
- poj 1018 Communication System
- POJ 1018 Communication System
- poj 1018 Communication System
- 1018 Communication System
- POJ 1018 Communication System
- POJ 1018 Communication System
- ZOJ1409 POJ1018 Communication System
- POJ 1018 Communication System
- PKU 1018 Communication System
- poj 1018 Communication System
- 发送email时防止发送无title
- 用python解决问题
- Jquery 常用操作
- hadoop笔记
- yuv和yCbCr的差异
- Communication System (P1018)
- mysql性能优化
- gcc基本用法
- java数组全排列
- sqrt对重载函数的调用不明确
- 扑克牌的顺子
- POJ 2632 Crashing Robots 水模拟
- 一键批量替换文本工具
- javascript string.Formart() 很棒!