제출 #980917

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980917		box	Fish 3 (JOI24_fish3)	C++17	100 / 100	364 ms	38228 KiB

Main

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

#define ar array
#define sz(v) int(std::size(v))
#define rep(i,a,b) for (int i = a; i < b; ++i)
typedef long long i64;
typedef vector<int> vi;

i64 cdiv(i64 a, i64 b) { return (a+b-1)/b; }

struct FT {
    vector<i64> t;
    FT(int N) : t(N) {}
    void add(int i, i64 x) {
        while (i < sz(t)) t[i] += x, i |= i+1;
    }
    i64 sum(int i) {
        i64 x = 0;
        while (i >= 0) x += t.at(i), i &= i+1, i--;
        return x;
    }
    i64 sum(int l, int r) { return sum(r)-sum(l-1); }
};

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int N; i64 D; cin >> N >> D;
    vector<i64> C(N); rep(i,0,N) cin >> C[i];
    int Q; cin >> Q;
    vector<vector<ar<int, 2>>> qr(N);
    vector<i64> ans(Q);
    rep(q,0,Q) {
        int l, r; cin >> l >> r, l--, r--;
        qr.at(r).push_back({l,q});
    }
    FT t(N), c0(N), c1(N);
    auto A = [&](int i) {
        return C.at(i) - t.sum(i);
    };
    vector<int> p;
    rep(r,0,N) {
        i64 v = C[r];
        for (int i = sz(p)-1; i >= 0; i--) {
            i64 a = A(p[i]); int j = i ? p[i-1]+1 : 0;
            if (a <= v) break;
            else {
                auto w = cdiv(a-v, D);
                t.add(j, D*w), t.add(p[i]+1, -D*w);
                c0.add(0, w*(p[i]-j+1)), c0.add(j, w*j), c0.add(p[i]+1, -w*(p[i]+1));
                c1.add(j, -w), c1.add(p[i]+1, w);
                v = A(j);
            }
        }
        while (sz(p)) {
            int j = p.back();
            if (A(j+1) - A(j) < D) p.pop_back();
            else break;
        }
        p.push_back(r);
        for (auto [l,q] : qr.at(r))
            ans[q] = A(l) < 0 ? -1 : l*c1.sum(l)+c0.sum(l);
    }
    rep(q,0,Q) cout << ans[q] << '\n';
}

• Subtask 1: 9 / 9
• Subtask 2: 7 / 7
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36