Submission #563211

# Submission time Handle Problem Language Result Execution time Memory
563211 2022-05-16T14:01:25 Z oblantis Rainforest Jumps (APIO21_jumps) C++17
0 / 100
95 ms 2072 KB
#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 time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 95 ms 2072 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Incorrect 95 ms 2072 KB Output isn't correct
4 Halted 0 ms 0 KB -