oj.uz

Submission #979782

# Submission time Handle Problem Language Result Execution time Memory
979782 2024-05-11T11:04:11 Z someone Fish 3 (JOI24_fish3) C++14
100 / 100
 805 ms 73272 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int M = 1 << 19, N = 2 * M, INF = 1e15 + 42;

struct Query {
    int l, r, val = 0;
};

int sum[N], tag[N];

void applyOp(int i, int len, int add) {
    sum[i] += len * add;
    tag[i] += add;
}

void propage(int i, int len) {
    applyOp(i*2, len, tag[i]);
    applyOp(i*2+1, len, tag[i]);
    tag[i] = 0;
}

int update(int i, int deb, int fin, int l, int r, int add) {
    if(fin <= l || r <= deb) return 0;
    if(l <= deb && fin <= r) {
        applyOp(i, fin - deb, add);
        return sum[i];
    }
    int mid = (deb + fin) >> 1;
    propage(i, mid - deb);
    int ans = update(i*2, deb, mid, l, r, add) + update(i*2+1, mid, fin, l, r, add);
    sum[i] = sum[i*2] + sum[i*2+1];
    return ans;
}

Query req[M];
vector<int> id[M];
int n, q, d, c[M], prefD[M], zero[M], nbD[M];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> d;
    for(int i = 1; i <= n; i++)
        cin >> c[i];
    cin >> q;
    for(int i = 0; i < q; i++) {
        cin >> req[i].l >> req[i].r;
        id[req[i].r].push_back(i);
        req[i].r++;
    }
    for(int i = n; i > 0; i--) {
        zero[i] = zero[i+1];
        if(c[i] % d > c[i+1] % d)
            zero[i]++;
        nbD[i] = c[i] / d + zero[i];
        prefD[i] = nbD[i];
    }
    for(int i = 1; i <= n; i++)
        prefD[i] += prefD[i-1];

    deque<int> imin;
    nbD[0] = -INF;
    imin.push_back(0);
    for(int i = 1; i <= n; i++) {
        while(nbD[imin[0]] > nbD[i]) {
            update(1, 0, M, imin[1]+1, imin[0]+1, - nbD[imin[0]]);
            imin.pop_front();
        }
        update(1, 0, M, imin[0]+1, i+1, nbD[i]);
        imin.push_front(i);
        for(int iQ : id[i]) {
            if(update(1, 0, M, req[iQ].l, req[iQ].l+1, 0) < zero[req[iQ].l]) {
                req[iQ].val = -1;
            } else {
                req[iQ].val = prefD[req[iQ].r-1] - prefD[req[iQ].l-1] - update(1, 0, M, req[iQ].l, req[iQ].r, 0);
            }
        }
    }
    for(int i = 0; i < q; i++)
        cout << req[i].val << '\n';
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 41304 KB Output is correct
2 Correct 7 ms 41308 KB Output is correct
3 Correct 9 ms 41308 KB Output is correct
4 Correct 12 ms 41816 KB Output is correct
5 Correct 10 ms 41544 KB Output is correct
6 Correct 10 ms 41540 KB Output is correct
7 Correct 9 ms 41564 KB Output is correct
8 Correct 13 ms 41564 KB Output is correct
9 Correct 13 ms 41564 KB Output is correct
10 Correct 11 ms 41564 KB Output is correct
11 Correct 11 ms 41560 KB Output is correct
12 Correct 11 ms 41564 KB Output is correct
13 Correct 13 ms 41564 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 650 ms 66132 KB Output is correct
2 Correct 596 ms 65760 KB Output is correct
3 Correct 167 ms 47968 KB Output is correct
4 Correct 534 ms 65512 KB Output is correct
5 Correct 492 ms 65716 KB Output is correct
6 Correct 454 ms 66804 KB Output is correct
7 Correct 518 ms 66788 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 51884 KB Output is correct
2 Correct 713 ms 69900 KB Output is correct
3 Correct 604 ms 69792 KB Output is correct
4 Correct 693 ms 69752 KB Output is correct
5 Correct 596 ms 69696 KB Output is correct
6 Correct 549 ms 65076 KB Output is correct
7 Correct 575 ms 65208 KB Output is correct
8 Correct 609 ms 66580 KB Output is correct
9 Correct 653 ms 66568 KB Output is correct
10 Correct 541 ms 67432 KB Output is correct
11 Correct 559 ms 67376 KB Output is correct
12 Correct 662 ms 69008 KB Output is correct
13 Correct 525 ms 69172 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 517 ms 65764 KB Output is correct
2 Correct 597 ms 64816 KB Output is correct
3 Correct 352 ms 62676 KB Output is correct
4 Correct 532 ms 66372 KB Output is correct
5 Correct 699 ms 70544 KB Output is correct
6 Correct 805 ms 69448 KB Output is correct
7 Correct 640 ms 69884 KB Output is correct
8 Correct 752 ms 69444 KB Output is correct
9 Correct 415 ms 64268 KB Output is correct
10 Correct 373 ms 65872 KB Output is correct
11 Correct 567 ms 70372 KB Output is correct
12 Correct 479 ms 69208 KB Output is correct
13 Correct 728 ms 73032 KB Output is correct
14 Correct 568 ms 68948 KB Output is correct
15 Correct 708 ms 72860 KB Output is correct
16 Correct 580 ms 68940 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 41304 KB Output is correct
2 Correct 7 ms 41308 KB Output is correct
3 Correct 9 ms 41308 KB Output is correct
4 Correct 12 ms 41816 KB Output is correct
5 Correct 10 ms 41544 KB Output is correct
6 Correct 10 ms 41540 KB Output is correct
7 Correct 9 ms 41564 KB Output is correct
8 Correct 13 ms 41564 KB Output is correct
9 Correct 13 ms 41564 KB Output is correct
10 Correct 11 ms 41564 KB Output is correct
11 Correct 11 ms 41560 KB Output is correct
12 Correct 11 ms 41564 KB Output is correct
13 Correct 13 ms 41564 KB Output is correct
14 Correct 650 ms 66132 KB Output is correct
15 Correct 596 ms 65760 KB Output is correct
16 Correct 167 ms 47968 KB Output is correct
17 Correct 534 ms 65512 KB Output is correct
18 Correct 492 ms 65716 KB Output is correct
19 Correct 454 ms 66804 KB Output is correct
20 Correct 518 ms 66788 KB Output is correct
21 Correct 256 ms 51884 KB Output is correct
22 Correct 713 ms 69900 KB Output is correct
23 Correct 604 ms 69792 KB Output is correct
24 Correct 693 ms 69752 KB Output is correct
25 Correct 596 ms 69696 KB Output is correct
26 Correct 549 ms 65076 KB Output is correct
27 Correct 575 ms 65208 KB Output is correct
28 Correct 609 ms 66580 KB Output is correct
29 Correct 653 ms 66568 KB Output is correct
30 Correct 541 ms 67432 KB Output is correct
31 Correct 559 ms 67376 KB Output is correct
32 Correct 662 ms 69008 KB Output is correct
33 Correct 525 ms 69172 KB Output is correct
34 Correct 517 ms 65764 KB Output is correct
35 Correct 597 ms 64816 KB Output is correct
36 Correct 352 ms 62676 KB Output is correct
37 Correct 532 ms 66372 KB Output is correct
38 Correct 699 ms 70544 KB Output is correct
39 Correct 805 ms 69448 KB Output is correct
40 Correct 640 ms 69884 KB Output is correct
41 Correct 752 ms 69444 KB Output is correct
42 Correct 415 ms 64268 KB Output is correct
43 Correct 373 ms 65872 KB Output is correct
44 Correct 567 ms 70372 KB Output is correct
45 Correct 479 ms 69208 KB Output is correct
46 Correct 728 ms 73032 KB Output is correct
47 Correct 568 ms 68948 KB Output is correct
48 Correct 708 ms 72860 KB Output is correct
49 Correct 580 ms 68940 KB Output is correct
50 Correct 570 ms 73132 KB Output is correct
51 Correct 506 ms 66936 KB Output is correct
52 Correct 534 ms 70264 KB Output is correct
53 Correct 457 ms 71032 KB Output is correct
54 Correct 500 ms 72672 KB Output is correct
55 Correct 552 ms 73272 KB Output is correct
56 Correct 468 ms 68832 KB Output is correct
57 Correct 437 ms 65748 KB Output is correct
58 Correct 451 ms 65500 KB Output is correct
59 Correct 569 ms 71020 KB Output is correct
60 Correct 442 ms 68952 KB Output is correct
61 Correct 504 ms 71092 KB Output is correct
62 Correct 463 ms 71164 KB Output is correct
63 Correct 481 ms 72444 KB Output is correct
64 Correct 478 ms 68936 KB Output is correct