#include "swap.h"
#include <vector>
using namespace std;
int n, m;
vector<vector<pair<int, int> > > g; // {to, c}
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
// g.assign(n, vector<pair<int, int> >());
// for(int i = 0; i < m; ++i) {
// }
}
int getMinimumFuelCapacity(int X, int Y) {
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
16 ms |
3764 KB |
Output is correct |
10 |
Correct |
20 ms |
4688 KB |
Output is correct |
11 |
Correct |
20 ms |
4444 KB |
Output is correct |
12 |
Correct |
21 ms |
4692 KB |
Output is correct |
13 |
Correct |
23 ms |
4664 KB |
Output is correct |
14 |
Correct |
20 ms |
4256 KB |
Output is correct |
15 |
Correct |
58 ms |
8612 KB |
Output is correct |
16 |
Correct |
62 ms |
8716 KB |
Output is correct |
17 |
Correct |
61 ms |
8888 KB |
Output is correct |
18 |
Correct |
73 ms |
8880 KB |
Output is correct |
19 |
Incorrect |
34 ms |
4892 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Incorrect |
55 ms |
7924 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
16 ms |
3764 KB |
Output is correct |
10 |
Correct |
20 ms |
4688 KB |
Output is correct |
11 |
Correct |
20 ms |
4444 KB |
Output is correct |
12 |
Correct |
21 ms |
4692 KB |
Output is correct |
13 |
Correct |
23 ms |
4664 KB |
Output is correct |
14 |
Correct |
20 ms |
4256 KB |
Output is correct |
15 |
Correct |
58 ms |
8612 KB |
Output is correct |
16 |
Correct |
62 ms |
8716 KB |
Output is correct |
17 |
Correct |
61 ms |
8888 KB |
Output is correct |
18 |
Correct |
73 ms |
8880 KB |
Output is correct |
19 |
Incorrect |
55 ms |
7924 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |