zoukankan      html  css  js  c++  java
  • UVALive

    My birthday is coming up and traditionally I’m
    serving pie. Not just one pie, no, I have a number
    N of them, of various tastes and of various sizes. F
    of my friends are coming to my party and each of
    them gets a piece of pie. This should be one piece
    of one pie, not several small pieces since that looks
    messy. This piece can be one whole pie though.
    My friends are very annoying and if one of them
    gets a bigger piece than the others, they start complaining.
    Therefore all of them should get equally
    sized (but not necessarily equally shaped) pieces,
    even if this leads to some pie getting spoiled (which
    is better than spoiling the party). Of course, I want
    a piece of pie for myself too, and that piece should also be of the same size.
    What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and
    they all have the same height 1, but the radii of the pies can be different.
    Input
    One line with a positive integer: the number of test cases. Then for each test case:
      • One line with two integers N and F with 1 ≤ N, F ≤ 10000: the number of pies and the number
    of friends.
      • One line with N integers ri with 1 ≤ ri ≤ 10000: the radii of the pies.
    Output
    For each test case, output one line with the largest possible volume V such that me and my friends can
    all get a pie piece of size V . The answer should be given as a oating point number with an absolute
    error of at most 10−3
    .
    Sample Input


    3
    3 3
    4 3 3
    1 24
    5
    10 5
    1 4 2 3 4 5 6 5 4 2
    Sample Output

    25.1327
    3.1416
    50.2655

    有m+1个人分n块蛋糕,每个人必须得到一整块蛋糕,而不是拼凑而来,而且每个人蛋糕的大小是一样的,求每个人可以分到的蛋糕的最大值。

     //Asimple
    #include <bits/stdc++.h>
    #define swap(a,b,t) t = a, a = b, b = t
    #define CLS(a, v) memset(a, v, sizeof(a))
    #define debug(a)  cout << #a << " = "  << a <<endl
    using namespace std;
    typedef long long ll;
    const int maxn = 10000+5;
    const double PI=acos(-1.0);
    const int INF = ( 1 << 16 ) ;
    ll n, m, res, ans, len, T, k, num, sum, l;
    double a[maxn];
    
    bool ok(double area){
    	sum = 0;
    	for(int i=0; i<n; i++) sum += floor(a[i]/area);
    	return sum >= m+1;
    }
    
    void input() {
    	ios_base::sync_with_stdio(false);
    	cin >> T;
    	while( T-- ) {
    		cin >> n >> m;
    		double Max = -1;
    		for(int i=0; i<n; i++) {
    			ll r;
    			cin >> r;
    			a[i] = PI*r*r;
    			Max = max(Max, a[i]);
    		}
    		double L = 0, R = Max;
    		while( R-L>10e-5) {
    			double mid = (L+R)/2;
    			if( ok(mid) ) L = mid;
    			else R = mid;
    		}
    		printf("%.4lf
    ", L);
    	}
    }
    
    int main(){
    	input();
    	return 0;
    }
    

      

  • 相关阅读:
    八皇后问题
    Catalan数与出栈顺序个数,Java编程模拟
    推荐系统中的协同过滤
    集成学习
    背包问题
    逆波兰表达式
    [leetcode]775. Global and Local Inversions
    [LeetCode]Minimum Moves to Equal Array Elements1,2
    链接属性
    常用表格属性
  • 原文地址:https://www.cnblogs.com/Asimple/p/6861514.html
Copyright © 2011-2022 走看看