제출 #1118365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1118365		somefolk	Sum Zero (RMI20_sumzero)	C++14	61 / 100	1052 ms	18120 KiB

sumzero

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC target("popcnt")

#define endl "\n"
// #define int long long

const int INF = 2 * 1e5 + 5;
const int MOD = 1e9 + 7;

void solve(){
    int n;
    cin >> n;
    vector<int> a(n);

    int k = 630; // aprox sqrt(n)

    for(int i = 0; i < n; i++){
        cin >> a[i];
    }

    vector<int> idx(n);
    for(int i = 0; i < n+1; i++){
        idx[i] = n+1;
    }

    unordered_map<int, int> mp;
    mp[0] = n;
    int s = 0;
    for(int i = n-1; i >= 0; i--){
        s += a[i];
        if(mp.count(s)) idx[i] = mp[s];
        mp[s] = i;
    }
    mp.clear();

    int curr = n+1;
    for(int i = n-1; i >= 0; i--){
        if(idx[i] > -1){
            curr = min(curr, idx[i]);
        }
        idx[i] = curr;
    }

    vector<int> valid(n);
    for(int i = 0; i < n; i++){
        curr = i;
        for(int j = 0; j < k && curr <= n; j++){
            curr = idx[curr];
        }
        valid[i] = curr;
    }

    int m;
    cin >> m;
    while(m--){
        int l, r;
        cin >> l >> r;

        curr = l-1;
        int sol = 0;
        while(valid[curr] <= r){
            sol += k;
            curr = valid[curr];
        }
        while(idx[curr] <= r){
            sol++;
            curr = idx[curr];
        }

        cout << sol << endl;
    }
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

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