Submission #1033351

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033351		rolandpetrean	Sum Zero (RMI20_sumzero)	C++17	0 / 100	2 ms	604 KiB

sumzero

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

using ll = long long;
// #define int ll

#define endl '\n'
#define pb push_back
using pi = array<int, 2>;

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  
  int n;
  cin >> n;
  
  vector<int> a(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  
  vector<ll> vals, suf(n + 2);
  for (int i = n; i >= 1; --i) {
    suf[i] = suf[i + 1] + a[i];
    vals.pb(suf[i]);
  }
  sort(vals.begin(), vals.end());
  vals.erase(unique(vals.begin(), vals.end()), vals.end());
  auto norm = [&](int x) -> int {
    return upper_bound(vals.begin(), vals.end(), x) - vals.begin();
  };
  
  vector<int> ap(n + 1), after(n + 2);
  int pos = n + 1;
  for (int i = n; i >= 0; --i) {
    suf[i] = norm(suf[i]);
    
    if (ap[suf[i]]) {
      pos = min(pos, ap[suf[i]]);
    }
    after[i] = pos;

    ap[suf[i]] = i;
  }
  
  vector<int> jmp(n + 2), sum(n + 2);
  for (int i = n; i >= 1; --i) {
    int p = after[i];
    jmp[i] = p;
    sum[i] = 1;
    if (jmp[jmp[p]] - jmp[p] == jmp[p] - p) {
      jmp[i] = jmp[jmp[p]];
      sum[i] = sum[p] + sum[jmp[p]] + 1;
    }
  }
  
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    
    int ans = 0;
    while (l <= r) {
      if (jmp[l] > r + 1) {
        if (after[l] > r + 1) {
          l = r + 1;
        } else {
          ++ans;
          l = after[l];
        }
      } else {
        ans += sum[l];
        l = jmp[l];
      }
    }
    
    cout << ans << endl;
  }
}

/*
10
1 2 -3 0 1 -4 3 2 -1 1
1
1 5
*/

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