kuangbin带你飞 【二分】HDU - 4768 Flyer（整数二分）

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<algorithm>

#define ll long long
#define int ll
#define inf (1<<31)-1//注意上界
#define PI acos(-1.0)
using namespace std;
int read() {
    
    
	int w = 1, s = 0;
	char ch = getchar();
	while (ch < '0' || ch>'9') {
    
     if (ch == '-') w = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') {
    
     s = s * 10 + ch - '0';    ch = getchar(); }
	return s * w;
}
int gcd(int x, int y) {
    
     return y ? gcd(y, x % y) : x; }
int ksm(int a, int b, int mod) {
    
     int s = 1; while(b) {
    
    if(b&1) s=s*a%mod;a=a*a%mod;b>>=1;}return s;}
const int N = 20010;
int a[N], b[N], c[N];
int l, r, n;
int check(int x)
{
    
    
    int sum = 0;
    for (int i = 0; i < n; i++) {
    
    
        if (min(x, b[i]) >= a[i])
            sum += (min(x, b[i]) - a[i]) / c[i] + 1;
    }
    return sum;
}

signed main()
{
    
    
    while (~scanf("%lld", &n))
    {
    
    

        for (int i = 0; i < n; i++) {
    
    
        	a[i] = read();
        	b[i] = read();
        	c[i] = read();
        }
        //二分模板
        l = 0, r = inf;
        int mid;
        while (l < r) {
    
    
            mid = l + r >> 1;
            if (check(mid) % 2) r = mid;
            else l = mid + 1;
        }
        //不存在的情况
        if (l == inf) printf("DC Qiang is unhappy.\n");
        else {
    
    
            //x是最小值
            while (check(l) % 2 == 0) l--;//剩余最后两个值，肯定一个是l，另一个是l-1
            printf("%lld %lld\n", l, check(l) - check(l - 1));
        }
    }
    return 0;
}