제출 #715775

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

sumzero

#include <iostream>
#include <algorithm>
using namespace std;
int v[400001];
typedef long long ll;
struct numbers
{
    ll nr;
    int id;
} ps[400001];
int jump[400000][17];
int f[400001];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,i,nr = 2e9,j,l,r,cnt = -1;
    ll cur = -1;
    cin>>n;
    for(i = 0; i < n; i++)
    {
        cin>>v[i];
        ps[i + 1] = {ps[i].nr + v[i],i + 1};
    }
    sort(ps,ps + n + 1,[&](numbers a,numbers b)
    {
        return a.nr < b.nr;
    });
    for(i = 0; i <= n; i++)
    {
        if(cur != ps[i].nr)
        {
            cur = ps[i].nr;
            cnt++;
        }
        ps[i].nr = cnt;
    }
    sort(ps,ps + n + 1,[&](numbers a,numbers b)
    {
        return a.id < b.id;
    });
    f[ps[n].nr] = n;
    for(i = n - 1; i >= 0; i--)
    {
        if(f[ps[i].nr] != 0)
        {
            nr = min(nr,f[ps[i].nr]);
        }
        jump[i][0] = (nr==2e9?n + 1:nr);
        f[ps[i].nr] = i;
    }
    for(i = 1; i <= 16; i++)
    {
        for(j = 0; j < n; j++)
        {
            jump[j][i] = (jump[j][i - 1] >= n?n + 1:jump[jump[j][i - 1]][i - 1]);
        }
    }
    int q,ans = 0;
    cin>>q;
    for(i = 0; i < q; i++)
    {
        cin>>l>>r;
        l--;
        r--;
        cur = l,ans = 0;
        for(j = 16; j >= 0; j--)
        {
            if(cur != n && jump[cur][j] <= r + 1)
            {
                cur = jump[cur][j];
                ans+=(1<<j);
            }
        }
        cout<<ans<<'\n';
    }
    return 0;
}

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