# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857681 | alexdumitru | Sum Zero (RMI20_sumzero) | C++17 | 1 ms | 348 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 NMAX = 100;
const int LMAX = 10;
int n, q, a[NMAX], Next[NMAX], jump[NMAX];
long long sp[NMAX];
unordered_map<long long, int> mp;
int L[NMAX], R[NMAX], ANS[NMAX];
int query(int l, int r)
{
}
void solve()
{
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
sp[i] = sp[i - 1] + a[i];
}
Next[n + 1] = Next[n + 2] = n + 2;
for(int i = n; i >= 1; i--)
{
Next[i] = Next[i + 1];
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... |