# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855125 | PoPularPlusPlus | Rainforest Jumps (APIO21_jumps) | C++17 | 999 ms | 98488 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 "jumps.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) x.begin(),x.end()
#define vf first
#define vs second
const int mod = 998244353;
const int N = 200005 , B = 25;
int n;
int arr[N] , left_edge[N] , right_edge[N];
vector<int> gl[N],gr[N],gmx[N];
int upl[N][B], upr[N][B], upmx[N][B];
void dfsl(int node , int par){
upl[node][0] = par;
for(int i = 1; i < B; i++){
upl[node][i] = upl[upl[node][i-1]][i-1];
}
for(int i : gl[node]){
dfsl(i,node);
}
}
void dfsr(int node , int par){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |