oj.uz

Submission #942623

# Submission time Handle Problem Language Result Execution time Memory
942623 2024-03-11T01:31:31 Z LOLOLO Sum Zero (RMI20_sumzero) C++14
100 / 100
 635 ms 20216 KB 
#include <bits/stdc++.h>
typedef long long ll;
 
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int32_t)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
 
using namespace std;
const int N = 4e5 + 10;
int c[N], sp[N][5], p[10];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    p[0] = 1;
    for (int i = 1; i < 10; i++) 
        p[i] = p[i - 1] * 4;

    int n;
    cin >> n;
 
    for (int i = 1; i <= n + 2; i++) {
        for (int j = 0; j < 5; j++)
            sp[i][j] = n + 2;
    }
 
    ll sum = 0;
    vector < pair <ll, int>> all;
    all.pb({0, 1});
    for (int i = 1; i <= n; i++) {
        cin >> c[i];
        sum += c[i];
        all.pb({sum, i + 1});
    }

    sort(all(all));

    for (int i = 0; i < sz(all) - 1; i++) {
        if (all[i].f == all[i + 1].f) {
            sp[all[i].s][0] = all[i + 1].s;
        }
    }

    all.clear();
 
    for (int i = n + 1; i >= 1; i--) {
        sp[i][0] = min(sp[i + 1][0], sp[i][0]);
        for (int j = 1; j < 5; j++) {
            int x = i;
            for (int k = 0; k < 4; k++) {
                x = sp[x][j - 1];
            }
            sp[i][j] = x;
        }
    }
 
    int q;
    cin >> q;
 
    while (q--) {
        int l, r;
        cin >> l >> r;
        int id = 4, cnt = 0;
        while (id >= 0) {
            if (sp[l][id] <= r + 1) {
                l = sp[l][id];
                cnt += p[id];
            } else {
                id--;
            }
        }

        cout << cnt << '\n';
    }
 
    return 0; 
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2820 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2820 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 67 ms 6880 KB Output is correct
8 Correct 40 ms 6872 KB Output is correct
9 Correct 62 ms 6868 KB Output is correct
10 Correct 74 ms 6868 KB Output is correct
11 Correct 41 ms 6872 KB Output is correct
12 Correct 60 ms 6872 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2820 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 67 ms 6880 KB Output is correct
8 Correct 40 ms 6872 KB Output is correct
9 Correct 62 ms 6868 KB Output is correct
10 Correct 74 ms 6868 KB Output is correct
11 Correct 41 ms 6872 KB Output is correct
12 Correct 60 ms 6872 KB Output is correct
13 Correct 635 ms 18388 KB Output is correct
14 Correct 252 ms 18384 KB Output is correct
15 Correct 527 ms 20216 KB Output is correct
16 Correct 526 ms 18896 KB Output is correct
17 Correct 256 ms 19124 KB Output is correct
18 Correct 521 ms 19892 KB Output is correct