# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413616 | daniel920712 | Rainforest Jumps (APIO21_jumps) | C++14 | 4070 ms | 29076 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 <vector>
#include <queue>
#include <stack>
#include <stdio.h>
using namespace std;
int r[25][200005];
int l[25][200005];
int Pow[25];
stack < int > all;
vector < int > high;
void init(int N, std::vector<int> H)
{
high=H;
int i,j,k;
Pow[0]=1;
for(i=1;i<=20;i++) Pow[i]=Pow[i-1]*2;
for(i=0;i<=20;i++)
{
for(j=0;j<N;j++)
{
r[i][j]=j;
l[i][j]=j;
}
}
for(i=0;i<N;i++)
{
while(!all.empty()&&H[all.top()]<H[i])
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... |
# | 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... |