oj.uz

Submission #980917

# Submission time Handle Problem Language Result Execution time Memory
980917 2024-05-12T15:43:07 Z box Fish 3 (JOI24_fish3) C++17
100 / 100
 364 ms 38228 KB 
#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.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 31316 KB Output is correct
2 Correct 162 ms 30680 KB Output is correct
3 Correct 73 ms 10504 KB Output is correct
4 Correct 172 ms 30308 KB Output is correct
5 Correct 184 ms 30352 KB Output is correct
6 Correct 198 ms 30292 KB Output is correct
7 Correct 139 ms 30292 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 14164 KB Output is correct
2 Correct 318 ms 38228 KB Output is correct
3 Correct 261 ms 38000 KB Output is correct
4 Correct 284 ms 38016 KB Output is correct
5 Correct 247 ms 38000 KB Output is correct
6 Correct 227 ms 31568 KB Output is correct
7 Correct 216 ms 31704 KB Output is correct
8 Correct 255 ms 34948 KB Output is correct
9 Correct 247 ms 35056 KB Output is correct
10 Correct 168 ms 34912 KB Output is correct
11 Correct 191 ms 34916 KB Output is correct
12 Correct 213 ms 37248 KB Output is correct
13 Correct 237 ms 37040 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 27988 KB Output is correct
2 Correct 165 ms 31316 KB Output is correct
3 Correct 91 ms 16724 KB Output is correct
4 Correct 163 ms 34584 KB Output is correct
5 Correct 273 ms 35300 KB Output is correct
6 Correct 319 ms 37932 KB Output is correct
7 Correct 286 ms 33208 KB Output is correct
8 Correct 327 ms 37968 KB Output is correct
9 Correct 156 ms 30852 KB Output is correct
10 Correct 167 ms 30452 KB Output is correct
11 Correct 188 ms 34640 KB Output is correct
12 Correct 182 ms 33948 KB Output is correct
13 Correct 364 ms 37748 KB Output is correct
14 Correct 295 ms 33616 KB Output is correct
15 Correct 335 ms 37612 KB Output is correct
16 Correct 314 ms 33608 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 179 ms 31316 KB Output is correct
15 Correct 162 ms 30680 KB Output is correct
16 Correct 73 ms 10504 KB Output is correct
17 Correct 172 ms 30308 KB Output is correct
18 Correct 184 ms 30352 KB Output is correct
19 Correct 198 ms 30292 KB Output is correct
20 Correct 139 ms 30292 KB Output is correct
21 Correct 71 ms 14164 KB Output is correct
22 Correct 318 ms 38228 KB Output is correct
23 Correct 261 ms 38000 KB Output is correct
24 Correct 284 ms 38016 KB Output is correct
25 Correct 247 ms 38000 KB Output is correct
26 Correct 227 ms 31568 KB Output is correct
27 Correct 216 ms 31704 KB Output is correct
28 Correct 255 ms 34948 KB Output is correct
29 Correct 247 ms 35056 KB Output is correct
30 Correct 168 ms 34912 KB Output is correct
31 Correct 191 ms 34916 KB Output is correct
32 Correct 213 ms 37248 KB Output is correct
33 Correct 237 ms 37040 KB Output is correct
34 Correct 152 ms 27988 KB Output is correct
35 Correct 165 ms 31316 KB Output is correct
36 Correct 91 ms 16724 KB Output is correct
37 Correct 163 ms 34584 KB Output is correct
38 Correct 273 ms 35300 KB Output is correct
39 Correct 319 ms 37932 KB Output is correct
40 Correct 286 ms 33208 KB Output is correct
41 Correct 327 ms 37968 KB Output is correct
42 Correct 156 ms 30852 KB Output is correct
43 Correct 167 ms 30452 KB Output is correct
44 Correct 188 ms 34640 KB Output is correct
45 Correct 182 ms 33948 KB Output is correct
46 Correct 364 ms 37748 KB Output is correct
47 Correct 295 ms 33616 KB Output is correct
48 Correct 335 ms 37612 KB Output is correct
49 Correct 314 ms 33608 KB Output is correct
50 Correct 259 ms 37972 KB Output is correct
51 Correct 243 ms 31568 KB Output is correct
52 Correct 277 ms 34792 KB Output is correct
53 Correct 273 ms 34868 KB Output is correct
54 Correct 258 ms 37096 KB Output is correct
55 Correct 247 ms 37972 KB Output is correct
56 Correct 214 ms 33624 KB Output is correct
57 Correct 226 ms 30456 KB Output is correct
58 Correct 230 ms 30452 KB Output is correct
59 Correct 258 ms 35980 KB Output is correct
60 Correct 224 ms 33676 KB Output is correct
61 Correct 172 ms 35052 KB Output is correct
62 Correct 209 ms 33420 KB Output is correct
63 Correct 232 ms 36816 KB Output is correct
64 Correct 273 ms 33912 KB Output is correct