POJ-1064 Cable master

5人阅读 评论(0) 收藏 举报
分类:

题目链接:点击打开链接

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.

Input

The first line of the input file contains two integer numb ers 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 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.

Output

Write to the output file 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 file must contain the single number "0.00" (without quotes).

Sample Input

4 11
8.02
7.43
4.57
5.39

Sample Output

2.00
题意:给出N个木棒,要求切出k段长度相等的木棒, 求相等的最大长度。

思路:很明显二分思想,每一个mid ,看是否满足,根据切出来的段数,划分上界和下界,这道题最大的坑点是精度处理,当然也可以转化为整数求解,这里主要是小数作法,

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cstring>
#include<cmath>
using namespace std;
const int MAX = 10010;
const int INF = 0X3f3f3f;
const double eps = 1e-8;

double cable[MAX];

int n, request;

int judge(double mid) {//判断当前mid 是否满足
    int sum = 0;
    for(int i = 0; i < n; i++) {
        sum += (int)(cable[i] / mid);//(int)转化
    }
    return sum >= request;// >= 返回1, <返回0
}

int main() {
    while(cin >> n >> request){//好像不用这样输入。
        for(int i = 0; i < n; i++) {
            scanf("%lf", &cable[i]);
        }
        double l = 0, r = 100001;
        double mid;
        while(r - l >= eps) {//注意这里是 >= 
            mid = (l + r) / 2;
            if(judge(mid)) {
                l = mid;
            }
            else
                r = mid;
        }// 结果就是r
        if((int)(r * 1000) % 10 >= 5) //本题最大坑点!!!结果不是保留2位小数,看小数点后第三位 是否 >= 5 
            r -= 0.005;//是的话,-0.005
        printf("%.2lf\n", r);
    }
	return 0;
}

查看评论

Cable master 小数二分

二分专题 保留两位小数 陷阱
  • qq_26071477
  • qq_26071477
  • 2016-07-12 22:48:20
  • 923

poj 1064 Cable master 【二分 + 精度控制】

Cable master Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 29552   Accepted: 62...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015-07-30 16:10:38
  • 832

poj-Cable master(double预处理为int型)

Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Commi...
  • wjhshuai
  • wjhshuai
  • 2017-03-22 20:26:29
  • 419

POJ_1064_Cable master【二分】

/* Cable master Time Limit: 1000MS        Memory Limit: 10000K Total Submissions: 43878        Ac...
  • huangshuai147
  • huangshuai147
  • 2017-04-05 15:50:51
  • 411

poj1064Cable master【二分】

Language: Default Cable master Time Limit: 1000MS   Memory Limit: 10000K Total S...
  • R1986799047
  • R1986799047
  • 2016-01-01 21:56:17
  • 456

POJ 1064 Cable master(二分)

Cable master Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 42159   Accepted: 90...
  • zl1085372438
  • zl1085372438
  • 2017-02-28 10:00:19
  • 156

7Cable master

简单题意 给出每个管子的长度,让你确定最长切割长度,把管子按照切割长度切成给定的数量 解题思路形成过程 用二分法在能保证数量的基础上求得最大值 感想 说真的题干略长,读的不是很明白,跟着模糊...
  • qq_33720032
  • qq_33720032
  • 2016-04-09 15:33:22
  • 127

【HDU】1551 - Cable master(二分)

点击打开题目 Cable master Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...
  • wyg1997
  • wyg1997
  • 2016-07-26 10:53:57
  • 227
    个人资料
    等级:
    访问量: 181
    积分: 241
    排名: 31万+
    文章存档
    最新评论