#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=2e5+9,M=2e18+9,mod=1e9+7;
bool vis[N];
pair<ll,ll>p;
vector<ll>v[N];
ll a[N],n,x,y,z;
priority_queue<pair<ll,ll>>q;
void init(int m,vector<int>h)
{
n=m;
}
int minimum_jumps(int A, int B, int C, int D)
{
return C-B;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
6488 KB |
Output is correct |
2 |
Correct |
2 ms |
6488 KB |
Output is correct |
3 |
Correct |
73 ms |
7740 KB |
Output is correct |
4 |
Correct |
572 ms |
8160 KB |
Output is correct |
5 |
Correct |
546 ms |
7260 KB |
Output is correct |
6 |
Correct |
522 ms |
8024 KB |
Output is correct |
7 |
Correct |
461 ms |
7768 KB |
Output is correct |
8 |
Correct |
551 ms |
8160 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
6488 KB |
Output is correct |
2 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
6488 KB |
Output is correct |
2 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
6488 KB |
Output is correct |
2 |
Correct |
2 ms |
6488 KB |
Output is correct |
3 |
Correct |
73 ms |
7740 KB |
Output is correct |
4 |
Correct |
572 ms |
8160 KB |
Output is correct |
5 |
Correct |
546 ms |
7260 KB |
Output is correct |
6 |
Correct |
522 ms |
8024 KB |
Output is correct |
7 |
Correct |
461 ms |
7768 KB |
Output is correct |
8 |
Correct |
551 ms |
8160 KB |
Output is correct |
9 |
Incorrect |
1 ms |
6488 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |