제출 #960454

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

sumzero

#include <bits/stdc++.h>

#define MAX_N 400000
#define MAX_Q 400000
#define MAX_LOG_N 18


#pragma GCC target("avx2,popcnt")
#pragma GCC optimize("O3,unroll-loops")

using namespace std;

int last0[MAX_N + 2], last[MAX_N + 2], l[MAX_Q], r[MAX_Q], ans[MAX_Q];
unordered_map <int, int> mp;

int main() {
    int n, q, a, sp, niv, b, i;

    cin >> n;
    sp = 0;
    mp[sp] = 1;
    for ( i = 1; i <= n; i++ ) {
        cin >> a;
        sp += a;
        if ( mp[sp] > 0 )
            last0[mp[sp]] = i;
        mp[sp] = i + 1;
    }

    cin >> q;
    for ( i = 0; i < q; i++ ) {
        cin >> l[i] >> r[i];
        ans[i] = 0;
    }

    for ( i = 1; i <= n + 1; i++ ) {
        if ( last0[i] == 0 )
            last0[i] = n + 1;
    }

    for ( i = n; i >= 1; i-- )
        last0[i] = last0[i] < last0[i + 1] ? last0[i] : last0[i + 1];

    for ( niv = MAX_LOG_N; niv >= 0; niv-- ) {
        for ( i = 1; i <= n; i++ )
            last[i] = last0[i];
        for ( b = 1; b <= niv; b++ ) {
            for ( i = 1; i <= n; i++ )
                last[i] = last[i] + 1 > n ? n + 1 : last[last[i] + 1];
            last[n + 1] = n + 1;
        }
        for ( i = 0; i < q; i++ ) {
            if ( last[l[i]] <= r[i] ) {
                ans[i] += (1 << niv);
                l[i] = last[l[i]] + 1;
            }
        }
    }

    for ( i = 0; i < q; i++ )
        cout << ans[i] << "\n";

    return 0;
}

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