oj.uz

Submission #942769

# Submission time Handle Problem Language Result Execution time Memory
942769 2024-03-11T04:17:45 Z ShadowShark Sum Zero (RMI20_sumzero) C++17
100 / 100
 447 ms 18616 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxN = 4e5 + 9;
int jump[10][maxN];
int *nxt;
pair<long long, int> *sum;

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

    int n;
    cin >> n;

    nxt = new int[n + 1];
    sum = new pair<long long, int>[n + 1];

    sum[0] = {0, 0};

    nxt[0] = n + 1;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        sum[i] = {sum[i - 1].first + x, i};
        nxt[i] = n + 1;
    }

    sort(sum, sum + n + 1);

    for (int i = 0; i <= n; i++) {
        //cout << sum[i].first << ' ' << sum[i].second << '\n';
        int j = i;
        while (j < n && sum[i].first == sum[j + 1].first) j++;

        for (int k = i; k < j; k++) nxt[sum[k].second + 1] = sum[k + 1].second;

        i = j;
    }

    delete[] sum;

    int val = n + 1;
    jump[0][n + 1] = n + 1;
    for (int i = n; i >= 0; i--) {
        jump[0][i] = val;
        val = min(val, nxt[i]);
    }

    delete[] nxt;

    for (int i = 1; i <= 9; i++)
        for (int j = 0; j <= n + 1; j++)
            jump[i][j] = jump[i - 1][jump[i - 1][j]];

    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        int ans = 0; l--;
        for (int i = 9; i >= 0; i--)
            while (jump[i][l] <= r) {
                l = jump[i][l];
                ans += 1 << i;
            }
        cout << ans << '\n';
    }

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14936 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14796 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14936 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14796 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 51 ms 15328 KB Output is correct
8 Correct 46 ms 15536 KB Output is correct
9 Correct 59 ms 15292 KB Output is correct
10 Correct 53 ms 15288 KB Output is correct
11 Correct 44 ms 15320 KB Output is correct
12 Correct 58 ms 15276 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14936 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14796 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 51 ms 15328 KB Output is correct
8 Correct 46 ms 15536 KB Output is correct
9 Correct 59 ms 15292 KB Output is correct
10 Correct 53 ms 15288 KB Output is correct
11 Correct 44 ms 15320 KB Output is correct
12 Correct 58 ms 15276 KB Output is correct
13 Correct 447 ms 17892 KB Output is correct
14 Correct 227 ms 17844 KB Output is correct
15 Correct 421 ms 18616 KB Output is correct
16 Correct 397 ms 17844 KB Output is correct
17 Correct 218 ms 17820 KB Output is correct
18 Correct 416 ms 18256 KB Output is correct