#include "swap.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define int long long
const int NN = 1e5+5;
int res;
vector<pair<int, int>> edges[NN];
int sum = 0, mx = 0;
void init(int32_t N, int32_t M,
vector<int32_t> U, vector<int32_t> V, vector<int32_t> W) {
//cout<<"\n";
for(int i=0;i<M;i++){
edges[U[i]].pb({V[i], W[i]});
edges[V[i]].pb({U[i], W[i]});
sum += W[i], mx = max(mx, (int)W[i]);
}
if(N == M) res = mx;
else res = -1;
}
/*
5 5
1 0 1
2 1 2
3 2 3
4 3 4
4 0 5
5
0 1
1 2
2 3
3 4
4 0
*/
int32_t getMinimumFuelCapacity(int32_t x, int32_t y) {
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
3 ms |
2636 KB |
Output is correct |
6 |
Correct |
3 ms |
2636 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
3 ms |
2636 KB |
Output is correct |
9 |
Correct |
49 ms |
8516 KB |
Output is correct |
10 |
Correct |
65 ms |
9916 KB |
Output is correct |
11 |
Correct |
63 ms |
9776 KB |
Output is correct |
12 |
Correct |
67 ms |
10096 KB |
Output is correct |
13 |
Correct |
75 ms |
10088 KB |
Output is correct |
14 |
Correct |
53 ms |
8616 KB |
Output is correct |
15 |
Correct |
119 ms |
11732 KB |
Output is correct |
16 |
Correct |
122 ms |
11604 KB |
Output is correct |
17 |
Correct |
139 ms |
11984 KB |
Output is correct |
18 |
Correct |
123 ms |
11948 KB |
Output is correct |
19 |
Correct |
63 ms |
7288 KB |
Output is correct |
20 |
Correct |
121 ms |
12880 KB |
Output is correct |
21 |
Correct |
131 ms |
12956 KB |
Output is correct |
22 |
Correct |
134 ms |
13276 KB |
Output is correct |
23 |
Correct |
132 ms |
13272 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Incorrect |
104 ms |
10964 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
3 ms |
2636 KB |
Output is correct |
6 |
Correct |
3 ms |
2636 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
3 ms |
2636 KB |
Output is correct |
9 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
3 ms |
2636 KB |
Output is correct |
6 |
Correct |
3 ms |
2636 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
3 ms |
2636 KB |
Output is correct |
9 |
Correct |
49 ms |
8516 KB |
Output is correct |
10 |
Correct |
65 ms |
9916 KB |
Output is correct |
11 |
Correct |
63 ms |
9776 KB |
Output is correct |
12 |
Correct |
67 ms |
10096 KB |
Output is correct |
13 |
Correct |
75 ms |
10088 KB |
Output is correct |
14 |
Correct |
53 ms |
8616 KB |
Output is correct |
15 |
Correct |
119 ms |
11732 KB |
Output is correct |
16 |
Correct |
122 ms |
11604 KB |
Output is correct |
17 |
Correct |
139 ms |
11984 KB |
Output is correct |
18 |
Correct |
123 ms |
11948 KB |
Output is correct |
19 |
Incorrect |
104 ms |
10964 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |