#include "jumps.h"
#include <vector>
int subtask;
void init(int N, std::vector<int> H) {
if (N <= 200) subtask = 2;
else if (N <= 2000) subtask = 3;
int flag = 1;
for (int i = 1; i < N; ++i)
if (H[i] != H[i-1] + 1) flag = 0;
if(flag) subtask = 1;
}
int minimum_jumps(int A, int B, int C, int D) {
if (subtask == 1)
{
if (A > D) return -1;
if (B >= C) return 0;
return C - B;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
74 ms |
1548 KB |
Output is correct |
4 |
Correct |
585 ms |
1980 KB |
Output is correct |
5 |
Correct |
484 ms |
1112 KB |
Output is correct |
6 |
Correct |
547 ms |
1980 KB |
Output is correct |
7 |
Correct |
437 ms |
1480 KB |
Output is correct |
8 |
Correct |
577 ms |
1984 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
74 ms |
1548 KB |
Output is correct |
4 |
Correct |
585 ms |
1980 KB |
Output is correct |
5 |
Correct |
484 ms |
1112 KB |
Output is correct |
6 |
Correct |
547 ms |
1980 KB |
Output is correct |
7 |
Correct |
437 ms |
1480 KB |
Output is correct |
8 |
Correct |
577 ms |
1984 KB |
Output is correct |
9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |