oj.uz

Submission #549283

# Submission time Handle Problem Language Result Execution time Memory
549283 2022-04-15T13:55:18 Z kevinxiehk Sum Zero (RMI20_sumzero) C++17
100 / 100
 296 ms 18448 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
// #define int long long
#define inf 1e9
#define ick cout<<"ickbmi32.9\n"
using namespace std;

int nxt[400005];
long long ps;
signed main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    unordered_map<long long, int> la;
    la.reserve(n / 100);
    int t;
    for(int i = 1; i <= n; i++) {
        cin >> t;
        ps += t;
        nxt[i] = n + 1;
        if(la[ps] != 0 || ps == 0) {
            nxt[la[ps] + 1] = min(nxt[la[ps] + 1], i);
        }
        la[ps] = i;
    }
    la.clear();
    int sps[400005];
    int qus[400005][3];
    for(int i = n - 1; i >= 1; i--) {
        nxt[i] = min(nxt[i], nxt[i + 1]);
    }
    // for(int i = 1; i <= n; i++) {
    //     cout << next[i] << ' ';
    // }cout << '\n'; //return 0;
    
    nxt[n + 1] = n + 1;
    nxt[n + 2] = n + 1;
    for(int i = 1; i <= n + 2; i++) {
        sps[i] = nxt[i];
    }
    
    int q;
    cin >> q;
    for(int i = 0; i < q; i++) {
        cin >> qus[i][0] >> qus[i][1];
        qus[i][2] = 0;
    }
    for(int k = 19; k >= 0; k--) {
        for(int i = 1; i <= n + 2; i++) {
            sps[i] = nxt[i];
        }
        for(int j = 1; j <= k; j++) {
            for(int i = 1; i <= n + 2; i++) {
                sps[i] = sps[sps[i] + 1];
                if(sps[i] > n) sps[i] = n + 1;
                // cout << sps[i][j] << ' ';
            }
            // cout << '\n';
        }//return 0;
        for(int i = 0; i < q; i++) {
            if(sps[qus[i][0]] <= qus[i][1]) {
                qus[i][0] = sps[qus[i][0]] + 1;
                qus[i][2] += (1 << k);
            }
        }
    }
    // while(q--) {
    //     int l, r;
    //     cin >> l >> r;
    //     int ans = 0;
    //     for(int i = 19; i >= 0; i--) {
    //         if(sps[l][i] <= r) {
    //             ans += (1 << i);
    //             l = sps[l][i] + 1;
    //         }
    //     }
    //     cout << ans << '\n';
    // }
    for(int i = 0; i < q; i++) cout << qus[i][2] << '\n';

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6612 KB Output is correct
2 Correct 7 ms 6740 KB Output is correct
3 Correct 9 ms 6680 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 6 ms 6628 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct

Subtask #2
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6612 KB Output is correct
2 Correct 7 ms 6740 KB Output is correct
3 Correct 9 ms 6680 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 6 ms 6628 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 69 ms 9248 KB Output is correct
8 Correct 64 ms 9476 KB Output is correct
9 Correct 69 ms 7936 KB Output is correct
10 Correct 74 ms 9244 KB Output is correct
11 Correct 67 ms 8724 KB Output is correct
12 Correct 70 ms 7880 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6612 KB Output is correct
2 Correct 7 ms 6740 KB Output is correct
3 Correct 9 ms 6680 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 6 ms 6628 KB Output is correct
6 Correct 6 ms 6740 KB Output is correct
7 Correct 69 ms 9248 KB Output is correct
8 Correct 64 ms 9476 KB Output is correct
9 Correct 69 ms 7936 KB Output is correct
10 Correct 74 ms 9244 KB Output is correct
11 Correct 67 ms 8724 KB Output is correct
12 Correct 70 ms 7880 KB Output is correct
13 Correct 289 ms 17352 KB Output is correct
14 Correct 254 ms 18292 KB Output is correct
15 Correct 296 ms 10868 KB Output is correct
16 Correct 271 ms 18448 KB Output is correct
17 Correct 266 ms 16684 KB Output is correct
18 Correct 282 ms 17852 KB Output is correct