Codeforces 887D Ratings and Reality Shows

Ratings and Reality Shows

参加talk show的时间肯定是在某个t[ i ]的后一秒， 枚举一下就好了。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ull unsigned long long
 
using namespace std;
 
const int N = 3e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = ;
const double eps = 1e-;
const double PI = acos(-);
 
int Log[N];
struct ST {
    LL dp[N][]; int ty;
    void build(int n, LL b[], int _ty) {
        ty = _ty;
        for(int i = -(Log[]=-); i < N; i++)
        Log[i] = Log[i - ] + ((i & (i - )) == );
        for(int i = ; i <= n; i++) dp[i][] = ty * b[i];
        for(int j = ; j <= Log[n]; j++)
            for(int i = ; i+(<<j)- <= n; i++)
                dp[i][j] = max(dp[i][j-], dp[i+(<<(j-))][j-]);
    }
    inline LL query(int x, int y) {
        int k = Log[y - x + ];
        return ty * max(dp[x][k], dp[y-(<<k)+][k]);
    }
};
 
int n, a, b, c, d, start, len;
int t[N], q[N];
LL sum[N];
ST rmq;
 
int main() {
    cin >> n >> a >> b >> c >> d >> start >> len;
    for(int i = ; i <= n; i++) {
        cin >> t[i] >> q[i];
        if(q[i]) sum[i] = sum[i - ] + c;
        else sum[i] = sum[i - ] - d;
    }
    t[] = -;
    rmq.build(n, sum, -);
    LL prefix = start;
    int ans = -;
    for(int i = ; i <= n; i++) {
        if(i) {
            if(q[i]) prefix += a;
            else prefix -= b;
        }
        if(prefix < ) break;
        int p = lower_bound(t + , t +  + n, t[i] +  + len) - t - ;
        if(p <= i) {
            ans = t[i] + ;
            break;
        } else {
            int L = i + , R = p;
            LL mn = rmq.query(L, R) - sum[i];
            if(prefix + mn >= ) {
                ans = t[i] + ;
                break;
            }
        }
    }
    printf("%d\n", ans);
    return ;
}
 
/*
*/