poj 1064 cable master

原创 2016年08月29日 15:03:51

http://poj.org/problem?id=1064

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,n为提供的缆线条数,k为需要缆线的条数。接下来输入n个数字,分别为n条缆线的长度。求可以剪成k条缆线时每条缆线的最长长度。

题目类型:二分

思路:
二分长度,求出该程度下所能裁剪出的缆线条数。

错误点:
1.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).这个需要特判。
2.考虑生活常识,这个只能量到厘米,不能更加精确,所以其余的会被舍弃,在最后结果的时候不可以直接答案,答案是四舍五入后的结果,而这个需要去尾,所以int(right*100.0)/100.0。
3.有一组数据
1 10
100.00
answer:10.00
而我用left的时候取出来是9.99,所以就改了right
4.数据范围为1到10000,所以t可能用int会超,用long long.

#include<stdio.h>
#include<iostream>
#define N 10005
#define eps 1e-5
using namespace std;

double a[N];

int main()
{
    int n,k;
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        int i,t;
        double sum=0;
        for(i=0;i<n;i++)
            {
                scanf("%lf",&a[i]);
                sum+=a[i];
            }


     if(double(0.01*k)>sum)  
          printf("0.00\n");
     else
          {
            double left=0,right=(double)sum/(double)k,mid;

            while(right-left>eps)
            {
                mid=(left+right)/2;

               long long int t=0;
                for(i=0;i<n;i++)
                   t=t+int(a[i]/mid);


                if(t>=k)
                   left=mid;
                else
                   right=mid;
            }
            printf("%.2lf\n",int(right*100.0)/100.0);
         }
        }
    return 0;
}

这道题周赛时只有一个人做出来了,哈哈,这道题好流氓……
这里写图片描述
好喜欢叶子君

版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ1064 Cable master(二分)

题意: 给出n根电缆,长度在1cm~100km之间,要求截断成k根长度为m的电缆,求m的最大值,注意小于1cm的就不能截断了。 要点: 明显的二分题,但是要注意精度,如果按m做要考虑精度损失,所...

Cable master POJ - 1064

Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Commi...

【自用】POJ1064 Cable master 且来说说卡精度的心得

题意: 多组数据,n个小棒,分成m段,最长多长? 不能短于0.01,如果分不出来,输出”0.00” 题解: 满足单调性,来二分吧。 心得: 来,我们看着代码说话。 判无解的处理 ...
  • Vmurder
  • Vmurder
  • 2015年03月17日 20:17
  • 1045

POJ 1064 Cable master 【二分】

Cable master Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 37400   ...

poj 1064 Cable master

/* * poj 1064 Cable master 题目大意: 给定一系列长度的电缆,需要截取成等长的K份,求所能截取的最大长度值。 解题思路: ...
  • baisung
  • baisung
  • 2012年05月25日 01:36
  • 3097

POJ 1064 Cable master(很好玩的二分搜索)

Cable master Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 24292   ...

Cable master(假定一个解并判断是否可行)(POJ NO.1064)

Cable master 二分(注意结果保留两位小数的数据处理(用到了floor))

poj 1064 Cable master(浮点数的二分法)

Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 34248   Accepted: 7278 Descriptio...
  • chat_c
  • chat_c
  • 2016年03月17日 23:25
  • 341

poj 1064 cable master (分绳子)二分求最大值

取r 然后这个题主要的问题是避免四舍五入的。像我们一般printf(”%.2f”,b)什么都四舍五入过了的。然后避免四舍五入可以用floor函数#include #include #includ...
  • bllsll
  • bllsll
  • 2017年04月20日 11:45
  • 121

POJ - 1064 Cable master

Cable master Time limit 1000 ms Memory limit 10000 kB Description Inhabitants of the Wonderland...
  • Murphyc
  • Murphyc
  • 2017年05月22日 21:43
  • 94
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 1064 cable master
举报原因:
原因补充:

(最多只允许输入30个字)