#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;
void init(int a, int b, vector<int> c, vector<int> d, vector<int> e){
}
int getMinimumFuelCapacity(int X, int Y){
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
26 ms |
3764 KB |
Output is correct |
10 |
Correct |
32 ms |
4556 KB |
Output is correct |
11 |
Correct |
31 ms |
4476 KB |
Output is correct |
12 |
Correct |
30 ms |
4660 KB |
Output is correct |
13 |
Correct |
33 ms |
4684 KB |
Output is correct |
14 |
Correct |
31 ms |
4140 KB |
Output is correct |
15 |
Correct |
86 ms |
8600 KB |
Output is correct |
16 |
Correct |
87 ms |
8592 KB |
Output is correct |
17 |
Correct |
81 ms |
8724 KB |
Output is correct |
18 |
Correct |
87 ms |
8736 KB |
Output is correct |
19 |
Incorrect |
51 ms |
4892 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Incorrect |
85 ms |
7984 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
26 ms |
3764 KB |
Output is correct |
10 |
Correct |
32 ms |
4556 KB |
Output is correct |
11 |
Correct |
31 ms |
4476 KB |
Output is correct |
12 |
Correct |
30 ms |
4660 KB |
Output is correct |
13 |
Correct |
33 ms |
4684 KB |
Output is correct |
14 |
Correct |
31 ms |
4140 KB |
Output is correct |
15 |
Correct |
86 ms |
8600 KB |
Output is correct |
16 |
Correct |
87 ms |
8592 KB |
Output is correct |
17 |
Correct |
81 ms |
8724 KB |
Output is correct |
18 |
Correct |
87 ms |
8736 KB |
Output is correct |
19 |
Incorrect |
85 ms |
7984 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |