제출 #942643

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

sumzero

#include<bits/stdc++.h>

using namespace std;

using ll=long long;
const int N=4e5+10, LG=7;
int n, a[N], nxt[N];
pair<ll, int> pf[N];
int jump[LG][N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   pf[0]={0, 0};
   memset(nxt, -1, sizeof nxt);
   for (int i=1; i<=n; ++i) cin >> a[i], pf[i]={pf[i-1].first+a[i], i};
   sort(pf, pf+n+1);
   for (int i=0; i<=n; ++i){
      int j=i;
      while (j<n && pf[j+1].first==pf[i].first) ++j;
      for (int k=i; k<j; ++k) nxt[pf[k].second+1]=pf[k+1].second;
      i=j;
   }
   int mn=n+1;
   jump[0][n+1]=n+1;
   for (int i=n; i>=0; --i){
      jump[0][i]=mn;
      if (nxt[i]!=-1) mn=min(mn, nxt[i]);
   }
   for (int k=1; k<LG; ++k) for (int i=0; i<=n+1; ++i) jump[k][i]=jump[k-1][jump[k-1][i]];
   int q; cin >> q;
   while (q--){
      int x, y; cin >> x >> y;
      int ans=0, cur=x-1;
      for (int i=LG-1; i>=0; --i){
         while (jump[i][cur]<=y){
            cur=jump[i][cur];
            ans+=1<<i;
         }
      }
      cout << ans << '\n';
   }
   return 0;
}

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