oj.uz

Submission #972583

# Submission time Handle Problem Language Result Execution time Memory
972583 2024-04-30T16:33:04 Z VMaksimoski008 Sum Zero (RMI20_sumzero) C++17
22 / 100
 1000 ms 23116 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define int long long

const int LOG = 20;
const int maxn = 2e5 + 5;

int up[maxn][LOG];

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n;
    cin >> n;

    vector<int> v(n+1), last(n+1, 1e9);
    for(int i=1; i<=n; i++) cin >> v[i];

    map<ll, int> mp; mp[0] = 0;
    ll sum = 0;

    vector<pii> I; I.push_back({ -1, -1 });
    for(int i=1; i<=n; i++) {
        sum += v[i];
        if(mp.count(sum)) last[i] = mp[sum];
        mp[sum] = i;
        if(last[i] != 1e9) I.push_back({ last[i], i });
    }

    vector<int> pref; pref.push_back(-1);
    for(int i=1; i<(int)I.size(); i++) {
        if((int)pref.size() == 0) pref.push_back(I[i].first);
        else pref.push_back(max((ll)pref[i-1], (ll)I[i].first));
    }

    for(int j=0; j<LOG; j++)
        for(int i=0; i<=n; i++) up[i][j] = -1;

    int p=0;
    for(int i=1; i<=n; i++) {
        while(p+1 < (int)I.size() && I[p+1].second <= i) p++;
        up[i][0] = pref[p];
    }

    for(int j=1; j<LOG; j++)
        for(int i=1; i<=n; i++)
            if(up[i][j-1] != -1) up[i][j] = up[up[i][j-1]][j-1];

    int q;
    cin >> q;

    while(q--) {
        int l, r, ans = 0;
        cin >> l >> r;
        l--;
        while(r) {
            if(up[r][0] < l) break;
            ans++;
            r = up[r][0];
        }
        
        cout << ans << '\n';
    }

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2908 KB Output is correct
2 Correct 3 ms 3072 KB Output is correct
3 Correct 7 ms 2908 KB Output is correct
4 Correct 8 ms 2908 KB Output is correct
5 Correct 3 ms 2904 KB Output is correct
6 Correct 7 ms 2888 KB Output is correct

Subtask #2
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2908 KB Output is correct
2 Correct 3 ms 3072 KB Output is correct
3 Correct 7 ms 2908 KB Output is correct
4 Correct 8 ms 2908 KB Output is correct
5 Correct 3 ms 2904 KB Output is correct
6 Correct 7 ms 2888 KB Output is correct
7 Execution timed out 1022 ms 23116 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2908 KB Output is correct
2 Correct 3 ms 3072 KB Output is correct
3 Correct 7 ms 2908 KB Output is correct
4 Correct 8 ms 2908 KB Output is correct
5 Correct 3 ms 2904 KB Output is correct
6 Correct 7 ms 2888 KB Output is correct
7 Execution timed out 1022 ms 23116 KB Time limit exceeded
8 Halted 0 ms 0 KB -