提出 #76183212

---

ソースコード 拡げる

#include <bits/stdc++.h>

const int N = 2e5 + 10;
long long a[N], pre[N];

struct node {
    int l, r;
    long long sum;
    long long premx;
}tr[N << 2];


void pushup(int u) {
    tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
    tr[u].premx = std::max({0ll, tr[u << 1].premx, tr[u << 1].sum + tr[u << 1 | 1].premx});
}

void build(int u, int l, int r) {
    tr[u] = {l, r, 0, 0};
    if (l == r) {
        tr[u].sum = a[l];
        tr[u].premx = std::max(0ll, a[l]);
        return;
    }

    int mid = (l + r) >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
    pushup(u);
}

int first_query(int u, int l, int r, long long t, long long& suc) {
    if (l <= tr[u].l && tr[u].r <= r && suc + tr[u].premx <= t) {
        suc += tr[u].sum;
        return -1;
    } 
    if (tr[u].l == tr[u].r) {
        return tr[u].l;
    }

    int mid = (tr[u].l + tr[u].r) >> 1;
    int res = -1;
    if (l <= mid) {
        res = first_query(u << 1, l, r, t, suc);
    } 
    if (res != -1) {
        return res;
    }
    if (mid < r) {
        res = first_query(u << 1 | 1, l, r, t, suc);
    }
    return res;
}



void Kita3() {
    int n, q;
    std::cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        long long x, y, z;
        std::cin >> x >> y >> z;
        a[i] = -x + y + z;
    }

    long long mx = 0, Tsum = 0;
    for (int i = 1; i <= n; i++) {
        Tsum += a[i];
        pre[i] = pre[i - 1] + a[i];
        mx = std::max(mx, Tsum);
    }

    build(1, 1, n);

    while (q--) {
        long long res = 0;
        long long l, s;
        std::cin >> l >> s;
        long long v = 0;
        long long i = first_query(1, l, n, s, v);
        if (i != -1) {
            std::cout << i - l + 1 << "\n";
            continue;
        }
        res += n - l + 1;
        s -= pre[n] - pre[l - 1];
        if (s >= mx && Tsum <= 0) {
            std::cout << "0\n";
            continue;
        }
        long long t = std::max(0ll, s - mx + 1);
        long long p = Tsum > 0 ? (t + Tsum - 1) / Tsum : 0;
        res += p * n;
        s -= p * Tsum;
        v = 0;
        i = first_query(1, 1, n, s, v);
        res += i - 1;
        std::cout << res + 1 << "\n";
    } 
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    // std::cin >> t;
    
    while (t--) {
        Kita3();
    }

    return 0;
}

提出情報

ジャッジ結果