# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597360 | pedroslrey | Sum Zero (RMI20_sumzero) | C++17 | 214 ms | 20452 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;
using lli = long long;
const int MAXN = 4e5 + 10;
const int MAXK = 20;
int ant[MAXN], dp[MAXN], prof[MAXN], ls[MAXN], rs[MAXN], ds[MAXN], tmp[MAXN];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n;
cin >> n;
vector<pair<lli, int>> xs{{0, 0}};
lli sum = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
sum += x;
xs.emplace_back(sum, i);
}
vector<int> ant(n+1);
for (int i = 1; i <= n; ++i)
ant[i] = -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... |