# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667511 | 2022-12-01T15:57:11 Z | AdOjis485 | Sum Zero (RMI20_sumzero) | C++14 | 26 ms | 1336 KB |
#include <bits/stdc++.h> #define int int64_t using namespace std; int find(int l, int r, vector<vector<int>>& jump) { if(jump[l][0] > r) return 0; int lvl = 0; while(lvl < jump[0].size() && jump[l][lvl] <= r) ++lvl; --lvl; int ans = 1<<lvl; l = jump[l][lvl]; while(lvl > 0) { --lvl; if(jump[l][lvl] <= r) { ans += 1<<lvl; l = jump[l][lvl]; } } return ans; } signed main() { int n; cin >> n; vector<int> c(n); for(int i = 0; i < n; ++i) cin >> c[i]; int q; cin >> q; map<int, int> m; int ss = 0; m[0] = 0; vector<int> next(n + 1, n + 1); for(int i = 0; i < n; ++i) { ss += c[i]; if(m.count(ss)) { next[m[ss]] = i + 1; cerr << m[ss] << ' ' << i + 1 << '\n'; } m[ss] = i + 1; } int cur = n + 1; for(int i = n - 1; i >= 0; --i) { if(c[i] == 0) next[i] = i + 1; if(next[i] < cur) cur = next[i]; else next[i] = cur; } int log = 1; while(n >> log) ++log; log += 2; vector<vector<int>> jump(n + 1, vector<int> (log, n + 1)); for(int i = 0; i <= n; ++i) jump[i][0] = next[i]; for(int i = 1; i < log; ++i) { for(int j = 0; j <= n; ++j) { if(jump[j][i - 1] <= n) jump[j][i] = jump[jump[j][i - 1]][i - 1]; } } for(int i = 0; i < q; ++i) { int l, r; cin >> l >> r; --l; cout << find(l, r, jump) + (c[l] == 0) << '\n'; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 26 ms | 1336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 26 ms | 1336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 26 ms | 1336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |