oj.uz

답안 #857447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857447 2023-10-06T08:06:34 Z Peti Sum Zero (RMI20_sumzero) C++17
100 / 100
 201 ms 20176 KB 
#include <bits/stdc++.h>
 
using namespace std;

const int maxn = 400005;
int v[maxn], nxt[maxn], jump[maxn], lvl[maxn];
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int n;
    cin>>n;
 
    v[0] = 0;
    for(int i = 1; i <= n; i++) cin>>v[i];
    long long sum = accumulate(v + 1, v + n + 1, 0LL);
    unordered_map<long long, int> mp;
    nxt[n+1] = n+1;
    int last = n+1;
    for(int i = n; i >= 0; i--){
        nxt[i] = mp.count(sum) ? mp[sum] : n+1;
        mp[sum] = i;
        sum -= v[i];
        if(nxt[i] < last){
            last = nxt[i];
        } else{
            nxt[i] = last;
        }
    }

    mp.clear();

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

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 41 ms 7088 KB Output is correct
8 Correct 37 ms 7532 KB Output is correct
9 Correct 43 ms 5968 KB Output is correct
10 Correct 42 ms 7560 KB Output is correct
11 Correct 36 ms 6836 KB Output is correct
12 Correct 44 ms 6064 KB Output is correct

Subtask #3
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 41 ms 7088 KB Output is correct
8 Correct 37 ms 7532 KB Output is correct
9 Correct 43 ms 5968 KB Output is correct
10 Correct 42 ms 7560 KB Output is correct
11 Correct 36 ms 6836 KB Output is correct
12 Correct 44 ms 6064 KB Output is correct
13 Correct 185 ms 15044 KB Output is correct
14 Correct 170 ms 17508 KB Output is correct
15 Correct 196 ms 9456 KB Output is correct
16 Correct 187 ms 17544 KB Output is correct
17 Correct 174 ms 20176 KB Output is correct
18 Correct 201 ms 14928 KB Output is correct