Submission #478288

#	Time	Username	Problem	Language	Result	Execution time	Memory
478288		Tenis0206	Sum Zero (RMI20_sumzero)	C++11	0 / 100	14 ms	19404 KiB

sumzero

#include <bits/stdc++.h>

using namespace std;
int n,q,v[400005];
vector<int> G[400005];
vector<pair<int,int>> Q[400005];
int t;
pair<long long,int> aux[400005];
int l[400005];
int cnt = 0;
void dfs(int nod)
{
    l[cnt++] = nod;
    for(auto it : Q[nod])
    {
        int st = 1;
        int dr = cnt-1;
        int poz = 0;
        while(st<=dr)
        {
            int mij = (st+dr)>>1;
            if(l[mij]-1<=it.first)
            {
                poz = mij;
                dr = mij-1;
            }
            else
            {
                st = mij+1;
            }
        }
        v[it.second] = cnt - poz - 1;
    }
    for(auto it : G[nod])
    {
        dfs(it);
    }
    --cnt;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
 //   freopen("sumzero.in","r",stdin);
 //   freopen("sumzero.out","w",stdout);
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>v[i];
    }
    cin>>q;
    for(int i=1; i<=q; i++)
    {
        int st,dr;
        cin>>st>>dr;
        Q[st].push_back({dr,i});
    }
    G[0].push_back(n+1);
    t = 0;
    long long sum = 0;
    for(int i=n;i>=1;i--)
    {
        sum+=v[i];
        aux[i] = {sum,i};
    }
    sort(aux+1,aux+n+1);
    sum = 0;
    for(int i=n; i>=1; i--)
    {
        sum+=v[i];
        if(sum==0)
        {
            if(!t)
            {
                t = n+1;
            }
            G[t].push_back(i);
            continue;
        }
        int st = 1;
        int dr = n;
        int poz = 0;
        while(st<=dr)
        {
            int mij = (st+dr)>>1;
            if(aux[mij].first==sum && aux[mij].second>i)
            {
                poz = aux[mij].second;
            }
            if(aux[mij].first>sum || (aux[mij].first==sum && aux[mij].second>i))
            {
                dr = mij-1;
            }
            else
            {
                st = mij+1;
            }
        }
        if(poz)
        {
            if(t)
            {
                t = min(t,poz);
            }
            else
            {
                t = poz;
            }
        }
        G[t].push_back(i);
    }
    dfs(0);
    for(int i=1; i<=q; i++)
    {
        cout<<v[i]<<'\n';
    }
    return 0;
}

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