leeing Sunlight Gym - 103061F

题目链接



超高精度二分

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <sstream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

struct node
{
    double l, r, av;
} a[100010];

int main(int argc, char const *argv[])
{
    int n, m;
    double minn = 0x3f3f3f3f, maxx = 0;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].l >> a[i].r;
        if (a[i].l < minn)
            minn = a[i].l;
        if (a[i].r > maxx)
            maxx = a[i].r;
        a[i].av = a[i].r - a[i].l;
    }
    while (maxx - minn > 1e-5)
    {
        double mid = (minn + maxx) / 2;
        double sum = 0;
        for (int i = 0; i < n; i++)
            if (mid >= a[i].r)
                sum += 1.0;
            else if (mid > a[i].l && mid < a[i].r)
                sum += (mid - a[i].l) / a[i].av;
        if (sum >= m)//这里必须是>=不能是>,因为题目中要找的是最小的x使得炸鱼的期望>=m，如果我们找到了一个x使炸鱼的期望>=m就退出查找是不对的，因为得找最小的，所以哪怕找到了一个期望>=m我们也得继续二分找下去，直到maxx-minn<1e-5
            maxx = mid;
        else
            minn = mid;
    }
    printf("%.10f\n", maxx);
    return 0;
}