# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537903 | vladislav11 | Sum Zero (RMI20_sumzero) | C++14 | 345 ms | 20396 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 ll = long long;
const int N = int(4e5)+100;
int n;
ll a[N];
int nxt[N];
int jmp[N];
array<int,3> qer[N];
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
a[0] = 0;
for ( int i=1; i<=n; i++ )
cin >> a[i];
for ( int i=1; i<=n; i++ )
a[i] += a[i-1];
for ( int i=0; i<=n+1; i++ )
nxt[i] = n+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... |