# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682870 | MilosMilutinovic | Sum Zero (RMI20_sumzero) | C++14 | 706 ms | 17516 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 MAX = 400000;
const int L = 3;
int n;
int R[MAX];
int pw[L + 1];
int pos[MAX][L];
int i;
unordered_map<long long, int> mp;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> R(n);
for (i = 0; i < n; i++) {
cin >> R[i];
}
long long s = 0;
mp[0] = n;
for (i = n - 1; i >= 0; i--) {
s += R[i];
if (mp.count(s)) {
R[i] = mp[s] - 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... |