HDOJ 1551 Cable master
2016-07-27 21:24
369 查看
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3844 Accepted Submission(s): 1486
[align=left]Problem Description[/align]
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect
computers for the contestants using a "star" topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from
it.
To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants
as far from each other as possible.
The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter, and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not
known and the Cable Master is completely puzzled.
You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.
[align=left]Input[/align]
The input consists of several testcases. The first line of each testcase contains two integer numbers N and K, separated by a space. N (1 ≤ N ≤ 10000) is the number of cables in the stock, and K (1 ≤ K
≤ 10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 centimeter and at most 100 kilometers in length. All lengths
in the input are written with a centimeter precision, with exactly two digits after a decimal point.
The input is ended by line containing two 0's.
[align=left]Output[/align]
For each testcase write to the output the maximal length (in meters) of the pieces that Cable Master may cut from the cables in the stock to get the requested number of pieces. The number must be written
with a centimeter precision, with exactly two digits after a decimal point.
If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output must contain the single number "0.00" (without quotes).
[align=left]Sample Input[/align]
4 11
8.02
7.43
4.57
5.39
0 0
[align=left]Sample Output[/align]
2.00
直接对网线的长度二分,L=0,R=sum/k(sum是总长,k是人数)
判断能否满足条件。在POJ上也有一道几乎一模一样的,但是两道题有细微的差别,一开始POJ的AC代码直接拿过来了结果直接WA掉了。
#include <stdio.h> #include <string.h> #include <math.h> #include <algorithm> using namespace std; int n,k; double a[10005],sum; int judge(double s) { int cnt = 0; for(int i = 0; i<n; i++) { cnt+=(int)(a[i]/s); } if(cnt>=k) return 1; return 0; } int main() { int i; while(~scanf("%d%d",&n,&k),n+k) { sum = 0; for(i = 0; i<n; i++) { scanf("%lf",&a[i]); sum+=a[i]; } sum = sum/k; double l = 0,r = sum; while(fabs(l-r)>1e-8) { double mid = (l+r)/2; if(judge(mid)) l = mid; else r = mid; } printf("%.2f\n",l); } return 0; }
相关文章推荐
- JAVA中实现链式操作(方法链)的简单例子
- 图形学(7)光照模型
- hdu5758Explorer Bo
- UITableView全面解析文章
- 虚拟机 centos 6.5 扩展根目录分区大小
- 第2章 启动和结束
- CodeForces 427B
- noip2009 最优贸易
- 设计模式之策略模式
- BOM、DOM总结
- HDOJ-----2141二分
- JAVA学习笔记Day02——基本语法
- 每日小结
- mysql查询性能优化
- 【Postgresql源码分析之四】同步复制源码分析--支持多个同步备机
- c语言指针操作
- poj1060
- 190. Reverse Bits
- 机房收费(五)之总结
- java 抓取 网页 数据