# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520391 | Alex_tz307 | Sum Zero (RMI20_sumzero) | C++17 | 275 ms | 20420 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.
#include <bits/stdc++.h>
using namespace std;
const int kN = 4e5;
int nxt[1 + kN], jump[1 + kN + 1 + 1];
int64_t sum[1 + kN];
struct query {
int l, r, ans;
} q[1 + kN];
void testCase() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> sum[i];
sum[i] += sum[i - 1];
}
multiset<int64_t> sums{0};
int r = 0;
for (int l = 1; l <= n; ++l) {
while (r <= n) {
if (sums.count(sum[r]) >= 2) {
break;
}
r += 1;
sums.emplace(sum[r]);
}
nxt[l] = r + 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |