【BeijingWc 2008】 秦腾与教学评估

【题目链接】

https://www.lydsy.com/JudgeOnline/problem.php?id=1271

【算法】

二分

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN 200100

int T,i,n,ans;
long long l,r,mid;
long long s[MAXN],d[MAXN],e[MAXN];

inline long long calc(long long x)
{
        int i;
        long long ret = ;
        for (i = ; i <= n; i++)
        {
                if (s[i] <= x)
                        ret += (min(e[i],x) - s[i]) / d[i] + ;
        }
        return ret;
}

int main()
{

        scanf("%d",&T);
        while (T--)
        {
                ans = ;
                scanf("%d",&n);
                for (i = ; i <= n; i++) scanf("%lld%lld%lld",&s[i],&e[i],&d[i]);
                l = ; r = ;
                if (calc(r) %  == )
                {
                        printf("Poor QIN Teng:(\n");
                        continue;
                }
                while (l <= r)
                {
                        mid = (l + r) >> ;
                        if (calc(mid) & )
                        {
                                ans = mid;
                                r = mid - ;
                        } else l = mid + ;
                }
                if (ans) printf("%d %lld\n",ans,calc(ans)-calc(ans-));
        }
        return ;

}