poj1018 커뮤니케이션 시스템 욕심
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 14261
Accepted: 4993
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
Source
#include
#include
using namespace std;
const int N=120;
const int inf=(1<<28);
int b[N][N],p[N][N],m[N];
int min_b,max_b;
int main()
{
int ci;scanf("%d",&ci);
while(ci--)
{
int n;scanf("%d",&n);
min_b=inf,max_b=0;
for(int i=0;i
scanf("%d",&m[i]);
for(int j=0;j
scanf("%d%d",&b[i][j],&p[i][j]);
if(b[i][j]>max_b) max_b=b[i][j];
if(b[i][j]
}
double cnt=0;
for(int i=min_b;i<=max_b;i++)
{
int sum=0;
for(int j=0;j
int min_p=inf;
for(int k=0;k
if(b[j][k]>=i&&p[j][k]
min_p=p[j][k];
}
}
sum+=min_p;
}
if((i+0.0)/sum>cnt) cnt=(i+0.0)/sum;
}
printf("%.3lf/n",cnt);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
cocos2d Lua 학습(一)ios에서 루아 함수 호출 및 전참 방법 lua 코드: 출력 결과: lua 호출 C++ 방법: add 함수: lua 코드: 출력 결과: 함수를 호출합니다. 함수를 호출하려면 다음 협의를 따르십시오. 우선, 호출할 함...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.