# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597225 | Deepesson | Sum Zero (RMI20_sumzero) | C++17 | 577 ms | 18792 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>
#define MAX 405000
#define LOG 19
using ll = long long;
int N;
int jump[MAX][2];
int pulo_origem[MAX];
void simular_camada(int u){
for(int i=0;i!=N;++i)jump[i][0]=pulo_origem[i];
for(int j=1;j!=u+1;++j){
int cord = j&1;
int oposto = !cord;
for(int i=0;i!=N;++i){
int x = jump[i][oposto];
if(x<0)jump[i][cord]=x-1;
else jump[i][cord]=jump[x][oposto];
}
}
}
int* array;
ll* comprime;
int sz;
void work(){
ll s=0;
for(int i=0;i!=N;++i){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |