제출 #942459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942459		bachhoangxuan	Sum Zero (RMI20_sumzero)	C++17	22 / 100	69 ms	24968 KiB

sumzero

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=400005;
const int B=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
const int base=101;


int n,pre[maxn],par[maxn],val[maxn],add[maxn];
map<int,int> mp;

int q,res[maxn];
vector<pii> qq[maxn];

int findpar(int u){
    if(u!=par[u]){
        int p=par[u];
        par[u]=findpar(par[u]);
        val[u]+=val[p];
        return par[u];
    }
    return u;
}

void unions(int u,int v){
    u=findpar(u);v=findpar(v);
    if(u==v) return;
    val[v]+=add[v]-add[u];
    par[v]=u;
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) par[i]=i;
    for(int i=1;i<=n;i++) cin >> pre[i],pre[i]+=pre[i-1];
    cin >> q;
    for(int i=1;i<=q;i++){
        int l,r;cin >> l >> r;
        qq[r].push_back({l,i});
    }
    mp[0]=0;
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    for(int i=1;i<=n;i++){
        pq.push({i-1,i});
        if(mp.find(pre[i])!=mp.end()){
            int l=mp[pre[i]]+1,p=-1;
            while(!pq.empty() && pq.top().fi<l){
                int u=pq.top().se;pq.pop();
                if(p!=-1) unions(u,p);
                p=u;
            }
            if(p!=-1){
                p=findpar(p);
                pq.push({i,p});
                add[p]++;
            }
        }
        mp[pre[i]]=i;
        for(auto [l,id]:qq[i]){
            int p=findpar(l);
            res[id]=val[l]+add[p];
        }
    }
    for(int i=1;i<=q;i++) cout << res[i] << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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