#include "swap.h"
#include <vector>
using namespace std;
int res = 0;
bool cycle = 0;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
if(N == M) cycle = 1;
for(int i = 0; i < M; i++) res = max(res, W[i]);
}
int getMinimumFuelCapacity(int X, int Y) {
if(cycle) return res;
else return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
30 ms |
3820 KB |
Output is correct |
10 |
Correct |
35 ms |
4588 KB |
Output is correct |
11 |
Correct |
35 ms |
4588 KB |
Output is correct |
12 |
Correct |
37 ms |
4844 KB |
Output is correct |
13 |
Correct |
38 ms |
4972 KB |
Output is correct |
14 |
Correct |
35 ms |
4204 KB |
Output is correct |
15 |
Correct |
105 ms |
7752 KB |
Output is correct |
16 |
Correct |
97 ms |
7592 KB |
Output is correct |
17 |
Correct |
100 ms |
7764 KB |
Output is correct |
18 |
Correct |
99 ms |
7892 KB |
Output is correct |
19 |
Correct |
61 ms |
6196 KB |
Output is correct |
20 |
Correct |
99 ms |
9800 KB |
Output is correct |
21 |
Correct |
104 ms |
10024 KB |
Output is correct |
22 |
Correct |
103 ms |
10324 KB |
Output is correct |
23 |
Correct |
107 ms |
10284 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Incorrect |
90 ms |
4240 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
30 ms |
3820 KB |
Output is correct |
10 |
Correct |
35 ms |
4588 KB |
Output is correct |
11 |
Correct |
35 ms |
4588 KB |
Output is correct |
12 |
Correct |
37 ms |
4844 KB |
Output is correct |
13 |
Correct |
38 ms |
4972 KB |
Output is correct |
14 |
Correct |
35 ms |
4204 KB |
Output is correct |
15 |
Correct |
105 ms |
7752 KB |
Output is correct |
16 |
Correct |
97 ms |
7592 KB |
Output is correct |
17 |
Correct |
100 ms |
7764 KB |
Output is correct |
18 |
Correct |
99 ms |
7892 KB |
Output is correct |
19 |
Incorrect |
90 ms |
4240 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |