Cable master
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 26596 | Accepted: 5673 |
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条绳子，求能切割出的最大长度，保留两位小数。 设C(X)表示能否切割出长度为x的K条绳子。 二分枚举X就行了。
1 #include <iostream>
2 #include <cstdio>
3 #include <cstring>
4 #include <cmath>
5 #include <algorithm>
6 #include <string>
7 #include <vector>
8 #include <set>
9 #include <map>
10 #include <queue>
11 #include <stack>
12 #include <sstream>
13 #include <iomanip>
14 using namespace std;
15 const int INF=0x4fffffff;
16 const int EXP=1e-6;
17 const int MS=10005;
18
19 int N,K;
20 double len[MS];
21
22 bool judge(double x)
23 {
24 int cnt=0;
25 for(int i=1;i<=N;i++)
26 cnt+=(int)(len[i]/x+EXP);
27 return cnt>=K;
28 }
29
30 void solve()
31 {
32 double l=0.0,r=MS*10.0;
33 double mid;
34 for(int i=0;i<100;i++)
35 {
36 mid=(l+r)/2;
37 if(judge(mid))
38 l=mid;
39 else
40 r=mid; // 注意这里是double。
41 }
42 printf("%.2lf\n",floor(mid*100)/100);
43 // 千万注意精度
44 // printf("%.2lf\n",mid); WA
45 }
46
47 int main()
48 {
49 scanf("%d%d",&N,&K);
50 for(int i=1;i<=N;i++)
51 scanf("%lf",&len[i]);
52 solve();
53 return 0;
54 }