| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1187238 | Aviansh | 밀림 점프 (APIO21_jumps) | C++20 | 329 ms | 22912 KiB |
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
vector<int>g[maxn];
int rev[maxn];
void init(int n, vector<int> h) {
for(int i = 0;i<n;i++){
rev[h[i]-1]=i;
}
set<int>inds;
for(int i = n-1;i>=0;i--){
int ind = rev[i];
if(inds.size()){
auto it = inds.lower_bound(i);
if(it!=inds.end()){
g[ind].push_back(*it);
}
if(it!=inds.begin()){
it--;
g[ind].push_back(*it);
}
}
inds.insert(rev[i]);
}
}
int minimum_jumps(int a, int b, int c, int d) {
return c-b;
}
| # | 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... | ||||
