제출 #942748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942748		ShadowShark	Sum Zero (RMI20_sumzero)	C++17	61 / 100	640 ms	26520 KiB

sumzero

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

const int maxN = 4e5 + 9;
int *a;
int jump[9][maxN];
map<long long, int> appear;
pair<int, int> *segment;

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

    int n;
    cin >> n;

    a = new int[n + 1];
    segment = new pair<int, int>[n + 1];

    for (int i = 1; i <= n; i++)
        cin >> a[i];

    appear[0] = 0;
    long long sum = 0;

    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        sum = sum + a[i];
        if (appear[sum] != 0)
            segment[++cnt] = {i, appear[sum] + 1};
        else if (sum == 0)
            segment[++cnt] = {i, 1};
        appear[sum] = i;
    }

    appear.clear();
    delete[] a;

    sort(segment + 1, segment + cnt + 1);

    int curr = 0;
    jump[0][n + 1] = n + 1;
    for (int i = 0; i <= n; i++) {
        while (curr <= cnt && i >= segment[curr].second) curr++;

        if (curr > cnt) jump[0][i] = n + 1;
            else jump[0][i] = segment[curr].first;
    }

    delete[] segment;

    for (int i = 1; i <= 8; 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 = 8; i >= 0; i--)
            while (jump[i][l] <= r) {
                l = jump[i][l];
                ans += 1 << i;
            }
        cout << ans << '\n';
    }

    return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 39 / 39
• Subtask 3: 0 / 39