Cable master (二分搜索)
来源:互联网 发布:java 日志 实现 编辑:程序博客网 时间:2024/05/21 08:58
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 972 Accepted Submission(s): 344Problem Description
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.
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.
Input
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.
The input is ended by line containing two 0's.
Output
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).
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).
Sample Input
4 118.027.434.575.390 0
Sample Output
2.00
#include <iostream>#include <algorithm>#include <string.h>#include <cmath>#include <stdio.h>#include <vector>#include <map>#include <queue>#include <utility>typedef long long ll;using namespace std;double a[10005];int N, K;bool judge(double len) { int sum = 0; for (int i = 0; i < N; ++i) { sum += static_cast<int>(a[i]/len); } if (sum >= K) return 1; else return 0;}int main () { double sum; while (scanf("%d %d", &N, &K) && N + K) { sum = 0; memset(a, 0, sizeof(a)); for (int i = 0; i < N; ++i) { scanf("%lf", &a[i]); sum += a[i]; } double len = sum / K*1.0; double left = 0.0, right = len; while (fabs(right - left) > 1e-6) { double mid = (right + left)/2; if (judge(mid)) left = mid; else right = mid; } printf("%.2lf\n",left); }}
0 0
- Cable master (二分搜索)
- Cable master poj1064(二分搜索)
- POJ - Cable master (二分搜索)
- POJ1064 Cable master(二分搜索)
- POJ 1064 Cable master (二分搜索)
- POJ 1064 Cable master (二分搜索)
- POJ - 1064 Cable master(二分搜索)
- POJ--1064 Cable master(二分搜索)
- poj 1064 Cable master(二分搜索)
- poj1064 Cable master(二分搜索)
- HDU1551:Cable master(二分)
- Cable master 二分
- POJ1064 Cable master(二分)
- POJ1064 Cable master 二分
- POJ1064 Cable master 二分
- POJ1064 Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551 Cable master(二分)
- 关于JSON详解
- android登录小界面
- Bitmap的加载和Cache
- HDU 1370 Biorhythms 中国剩余定理
- 基于Flume的美团日志收集系统(一)架构和设计
- Cable master (二分搜索)
- 【软考】IP子网划分
- Qt获取文件夹下文件夹,文件列表
- Socket通信之NIO
- Python标准库gzip的使用
- 第一课:Html5新增重要结构标签应用实例及兼容性检测
- CF
- The entitlements specified in your application’s Code Signing Entitlements file do not match those s
- 抽象类和对象的上转型对象