제출 #495490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495490		couplefire	Sum Zero (RMI20_sumzero)	C++17	61 / 100	770 ms	28100 KiB

sumzero

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 400005;

int n, q; bitset<19> to[N][5];
map<ll, int> mp; ll sum;

int main(){
    // freopen("a.in", "r", stdin);
    cin.tie(0)->sync_with_stdio(0);
    cin >> n; mp[0] = 0;
    for(int i = 1; i<=n; ++i){
        int a; cin >> a;
        sum += a; to[i][0] = to[i-1][0];
        if(mp.count(sum))
            to[i][0] = max((int)to[i][0].to_ullong(), mp[sum]+1);
        mp[sum] = i;
    } mp.clear();
    for(int j = 1; j<5; ++j)
        for(int i = 1; i<=n; ++i){
            int bruh = i+1;
            for(int k = 0; k<16; ++k)
                bruh = to[max(0, bruh-1)][j-1].to_ullong();
            to[i][j] = bruh;
        }
    cin >> q;
    while(q--){
        int l, r; cin >> l >> r;
        int cnt = 0, cur = r;
        for(int i = 4; i>=0; --i)
            while((int)to[cur][i].to_ullong()>=l) cur = to[cur][i].to_ullong()-1, cnt += (1<<(4*i));
        cout << cnt << '\n';
    }
}

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