# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569197 | hibiki | Rainforest Jumps (APIO21_jumps) | C++11 | 1214 ms | 77952 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 all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define f first
#define s second
int n,h[200005];
int bk[200005][20];
vector<int> jp[200005];
void monotone_q_and_lds()
{
for(int i = 0; i < n; i++)
bk[i][0] = i;
stack<int> s;
for(int i = 0; i < n; i++)
{
if(s.size())
while(!s.empty() && h[s.top()] < h[i])
{
// s top go right that is i
jp[s.top()].pb(i);
s.pop();
}
if(!s.empty())
{
# | 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... |