# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846974 | TahirAliyev | Sum Zero (RMI20_sumzero) | C++17 | 350 ms | 33712 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define oo 1e9
#define pii pair<int, int>
const int MAX = 4e5 + 5, LOGMAX = 5;
int n, q;
int arr[MAX];
int presum[MAX];
int R[MAX];
int par[LOGMAX][MAX];
set<pii> s;
ll lift(int t, int f){
ll ans = 0;
for(int j = LOGMAX - 1; j >= 0 && par[0][t] != 0; j--){
while(par[j][t] <= f && par[j][t] != 0){
t = par[j][t];
ans += (1 << (j * 3));
}
}
if(par[0][t] <= f + 1 && par[0][t] != 0) ans++;
return ans;
}
int main(){
scanf("%d", &n);
s.insert({0, 0});
for(int i = 1; i <= n; i++){
scanf("%d", &arr[i]);
presum[i] = presum[i - 1] + arr[i];
s.insert({presum[i], i});
}
for(int l = 0; l < n; l++){
s.erase(s.find({presum[l], l}));
auto itr = s.lower_bound({presum[l], 0});
if(itr == s.end() || (*itr).first != presum[l]) continue;
R[l + 1] = (*itr).second;
}
scanf("%d", &q);
int mn = n + 1;
for(int i = n; i >= 1; i--){
if(R[i] < mn && R[i] != 0){
mn = R[i];
}
if(mn == n + 1){
R[i] = 0;
}
else{
R[i] = mn;
}
}
for(int i = 1; i <= n; i++){
if(!R[i]){
par[0][i] = 0;
continue;
}
par[0][i] = R[i] + 1;
}
for(int j = 1; j < LOGMAX; j++){
for(int i = 1; i <= n; i++){
par[j][i] = par[j - 1][par[j - 1][par[j - 1][par[j - 1][par[j - 1][par[j - 1][par[j - 1][par[j - 1][i]]]]]]]];
}
}
while(q--){
int l, r; scanf("%d%d", &l, &r);
cout << lift(l, r) << '\n';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |