#include <bits/stdc++.h>
// #include "grader_swap.cpp"
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
for (auto i : x) cout << i << ' ';\
cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
return o >> a.X >> a.Y;
}
const int mod = 1e9 + 7, abc = 864197532, Doludu = 123, N = 100001, logN = 18, K = 40;
vector <pii> adj[N];
int n, m, mx, jump[N][logN], val[N][logN], in[N], out[N], _t;
void dfs(int v, int pa) {
}
void build() {
}
void init(int _n, int _m, vector <int> u, vector <int> v, vector <int> w) {
n = _n, m = _m;
for (int i = 0; i < m; ++i) {
adj[u[i]].eb(v[i], w[i]);
adj[v[i]].eb(u[i], w[i]);
mx = max(mx, w[i]);
}
build();
}
int getMinimumFuelCapacity(int u, int v) {
if (n == m) return mx;
return -1;
}
/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
2 3 3
1 4 10
3
1 2
2 4
0 1
*/
# |
결과 |
실행 시간 |
메모리 |
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 |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
42 ms |
6896 KB |
Output is correct |
10 |
Correct |
50 ms |
7884 KB |
Output is correct |
11 |
Correct |
48 ms |
7736 KB |
Output is correct |
12 |
Correct |
53 ms |
8048 KB |
Output is correct |
13 |
Correct |
52 ms |
8128 KB |
Output is correct |
14 |
Correct |
46 ms |
6980 KB |
Output is correct |
15 |
Correct |
113 ms |
9744 KB |
Output is correct |
16 |
Correct |
113 ms |
9568 KB |
Output is correct |
17 |
Correct |
119 ms |
10028 KB |
Output is correct |
18 |
Correct |
118 ms |
9952 KB |
Output is correct |
19 |
Correct |
63 ms |
6908 KB |
Output is correct |
20 |
Correct |
114 ms |
10884 KB |
Output is correct |
21 |
Correct |
116 ms |
11008 KB |
Output is correct |
22 |
Correct |
121 ms |
11224 KB |
Output is correct |
23 |
Correct |
119 ms |
11308 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 |
106 ms |
10208 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 |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 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 |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
42 ms |
6896 KB |
Output is correct |
10 |
Correct |
50 ms |
7884 KB |
Output is correct |
11 |
Correct |
48 ms |
7736 KB |
Output is correct |
12 |
Correct |
53 ms |
8048 KB |
Output is correct |
13 |
Correct |
52 ms |
8128 KB |
Output is correct |
14 |
Correct |
46 ms |
6980 KB |
Output is correct |
15 |
Correct |
113 ms |
9744 KB |
Output is correct |
16 |
Correct |
113 ms |
9568 KB |
Output is correct |
17 |
Correct |
119 ms |
10028 KB |
Output is correct |
18 |
Correct |
118 ms |
9952 KB |
Output is correct |
19 |
Incorrect |
106 ms |
10208 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |