zoukankan      html  css  js  c++  java
  • 1018—Communication System

    Communication System
    Time Limit: 1000MS Memory Limit: 10000K
    Total Submissions:30175 Accepted: 10737

    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

    #include<iostream>
    #include<cstdio>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    #define inf 0x7fffffff
    int main(int argc, char const *argv[])
    {
    	int t;
    	int n;
    	int mi,b,p;
    	int dp[121][1100];
    	int i,j,k;
    	double out;
    	scanf("%d",&t);
    	while(t--)
    	{
    		scanf("%d",&n);
    		for(i=1;i<=n;i++)
    		{
    			for(j=0;j<1100;j++)
    				dp[i][j]=inf;
    		}
    		for(i=1;i<=n;i++)
    		{
    			scanf("%d",&mi);
    			for(j=1;j<=mi;j++)
    		     {
    		     	scanf("%d%d",&b,&p);
    		     	if(i==1)
    		        {
    		   	      dp[1][b]=min(dp[1][b],p);
    		        }
    		        else
                    {            //每次选择带宽最小的那一个,然后选择与前一类设备的价格之和最小的那一个
    		   	      for(k=0;k<1100;k++)
    		   	      {
    		   	      	if(dp[i-1][k]!=inf)
    		   	      	{
    		   	      		if(k<=b)
    		   	      			dp[i][k]=min(dp[i][k],dp[i-1][k]+p);
    		   	      		else
    		   	      			dp[i][b]=min(dp[i][b],dp[i-1][k]+p);
    		   	      	}
    		   	      }
    		        }
    		     }
    		}
    		double ans=0;
    		for(i=0;i<1100;i++)
    		{
    			if(dp[n][i]!=inf)
    			{
    				out=(double)i/dp[n][i];
    				if(out>ans)
    				ans=out;
    			}
    			
    		}
    		printf("%.3f
    ",ans);
    	}
    	return 0;
    }

  • 相关阅读:
    Codefoces Gym 101652 【最大连续和】
    HYSBZ 4034 【树链剖分】+【线段树 】
    Codeforces Gym 101291C【优先队列】
    Codeforces gym 101291 M (最长交替子序列)【DP】
    HDU 3308 LCIS (经典区间合并)【线段树】
    POJ 3237 Tree (树链剖分+边权转点权)
    POJ 2763 Housewife Wind (树链剖分+边权转点权)
    P1054 等价表达式
    P1107 [BJWC2008]雷涛的小猫
    P1552 [APIO2012]派遣
  • 原文地址:https://www.cnblogs.com/kuroko-ghh/p/9363350.html
Copyright © 2011-2022 走看看