제출 #563211

#제출 시각아이디문제언어결과실행 시간메모리
563211oblantis밀림 점프 (APIO21_jumps)C++17
0 / 100
95 ms2072 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 123; int n, h[maxn]; void init(int N, vector<int> H) { n = N; for(int i = 0; i < n; i++) h[i] = H[i]; } int minimum_jumps(int A, int B, int C, int D) { return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...