oj.uz

Submission #961621

# Submission time Handle Problem Language Result Execution time Memory
961621 2024-04-12T09:02:19 Z thangdz2k7 Sum Zero (RMI20_sumzero) C++17
100 / 100
 232 ms 20276 KB 
// author : HuuHung
// 25.3.2024
 
 
#include <bits/stdc++.h>
#define ii pair <int, int>
#define F first
#define S second
#define ll long long
 
using namespace std;
 
const int N = 4e5 + 5;
const int mod = 1e9 + 7;
 
 
int jump[N], p[N], level[N];
unordered_map<ll, int> f;
void solve(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n;
    cin >> n;
    ll tot = 0;
    int mx = -1;
    level[0] = 1;
    for(int i = 1; i <= n; i++) {
        int a; cin >> a;
        tot += a;
        if(f[tot] || !tot) mx = max(mx, f[tot]);
        f[tot] = i;
        p[i] = mx;
        if(mx == -1) level[i] = 1;
        else
        level[i] = level[p[i]] + 1;
        if(mx >= 0 && level[p[i]] - level[jump[p[i]]] ==  level[jump[p[i]]] - level[jump[jump[p[i]]]]) jump[i] = jump[jump[p[i]]];
        else jump[i] = p[i];
    }
    int q;
    cin >> q;
    while(q--) {
        int l, r;
        cin >> l >> r;
        int ans = 0; --l;
        while(r) {
            if(p[r] < l) break;
            if(jump[r] >= l) ans += level[r] - level[jump[r]], r = jump[r];
            else ans++, r = p[r];
        }
        cout << ans << "\n";
    }
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t --) solve();
 
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 2 ms 4692 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 43 ms 6720 KB Output is correct
8 Correct 39 ms 5656 KB Output is correct
9 Correct 44 ms 3928 KB Output is correct
10 Correct 51 ms 6636 KB Output is correct
11 Correct 42 ms 4824 KB Output is correct
12 Correct 51 ms 3900 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 2 ms 4692 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2652 KB Output is correct
7 Correct 43 ms 6720 KB Output is correct
8 Correct 39 ms 5656 KB Output is correct
9 Correct 44 ms 3928 KB Output is correct
10 Correct 51 ms 6636 KB Output is correct
11 Correct 42 ms 4824 KB Output is correct
12 Correct 51 ms 3900 KB Output is correct
13 Correct 205 ms 13504 KB Output is correct
14 Correct 181 ms 15660 KB Output is correct
15 Correct 204 ms 7760 KB Output is correct
16 Correct 202 ms 15936 KB Output is correct
17 Correct 188 ms 20276 KB Output is correct
18 Correct 232 ms 14672 KB Output is correct