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.
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
3
3 100 25 150 35 80 25
2 120 80 155 40
2 100 100 120 110
Sample Output
0.649
题意
一个通信系统有n种设备组成,现有这n种设备,每种设备有不同价格以及性能的不同(量化为b),要求是每种设备中选择一个,记取出的n个设备中的最小性能值为B,它们的价格总和为P,要计算可能的最大性价比B/P。
1代表的是一个测试实例
3代表的是3种需要采购
然后采购行数 第一个数字是厂家个数 后面分别为每个厂家的 带宽 然后是价格输出0.649是怎么算出来的呢?
120/(110+40+35)约等于0.649
也就是说从每行设备中挑选一个,然后记录最小的带宽,除以总价格,就是题目所得B/P 。
这道题我没想到用贪心怎么来解,只会dp。
代码如下
#include<cstdio>
int main()
{
int w[105][105],v[105][105];
int t,n,x,i,j,k;
scanf("%d",&t);
while(t--)
{
int dp[105][405]={0};
double s=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
for(j=0;j<x;j++)
scanf("%d%d",&w[i][j],&v[i][j]);
for(j=0;j<=400;j++)
{
int m=1<<30;
for(k=0;k<x;k++)
if(j<=w[i][k]&&dp[i-1][j]+v[i][k]<m)
m=dp[i-1][j]+v[i][k];
dp[i][j]=m;
}
}
for(j=1;j<=400;j++)
if(j/(double)dp[n][j]>s)
s=j/(double)dp[n][j];
printf("%.3f\n",s);
}
return 0;
}