#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mxN = 2e5+10;
const int mxK = 1e6+10;
const int INF = 1e9+10;
int ans = INF, k;
vector<array<int, 2>> adj[mxN];
bool vis[mxN];
int sz[mxN];
void get_sz(int node, int p) {
sz[node] = 1;
for(auto [it, w] : adj[node]) {
if(it == p || vis[it]) continue;
get_sz(it, node);
sz[node] += sz[it];
}
}
int get_c(int node, int p, int n) {
for(auto [it, w] : adj[node]) {
if(vis[it] || it == p) continue;
if(sz[it] * 2 > n) return get_c(it, node, p);
}
return node;
}
void get_min(int node, int p, bool filling, int dist, int s, vector<int>& d) {
if(s > k) return ;
if(filling) {
d[s] = min(d[s], dist);
}
else {
ans = min(ans, dist+d[k-s]);
}
for(auto [it, w] : adj[node]) {
if(it == p || vis[it]) continue;
get_min(it, node, filling, dist+1, s+w, d);
}
}
void build(int node) {
get_sz(node, -1);
int c = get_c(node, -1, sz[node]);
vis[c] = true;
vector<int> d(k+1, INF);
d[0] = 0;
for(auto [it, w] : adj[c]) {
if(vis[it]) continue;
get_min(it, c, 0, 1, w, d);
get_min(it, c, 1, 1, w, d);
}
for(auto [it, w] : adj[c]) {
if(vis[it]) continue;
build(it);
}
}
int best_path(int n, int K, int h[][2], int l[]) {
for(int i = 0; i < n-1; i++) {
adj[h[i][0]].push_back({h[i][1], l[i]});
adj[h[i][1]].push_back({h[i][0], l[i]});
}
k = K;
build(0);
return (ans == INF ? -1 : ans);
}
/*
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << best_path(4, 3, {{0, 1}, {1, 2}, {1, 3}},
{1, 2, 4});
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4956 KB |
Output is correct |
2 |
Correct |
2 ms |
4956 KB |
Output is correct |
3 |
Correct |
3 ms |
4956 KB |
Output is correct |
4 |
Correct |
2 ms |
4956 KB |
Output is correct |
5 |
Correct |
3 ms |
4956 KB |
Output is correct |
6 |
Correct |
2 ms |
4956 KB |
Output is correct |
7 |
Correct |
2 ms |
4956 KB |
Output is correct |
8 |
Correct |
2 ms |
5008 KB |
Output is correct |
9 |
Correct |
2 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4956 KB |
Output is correct |
11 |
Correct |
2 ms |
4956 KB |
Output is correct |
12 |
Correct |
2 ms |
4956 KB |
Output is correct |
13 |
Correct |
2 ms |
4952 KB |
Output is correct |
14 |
Correct |
2 ms |
4956 KB |
Output is correct |
15 |
Correct |
2 ms |
4956 KB |
Output is correct |
16 |
Correct |
3 ms |
4956 KB |
Output is correct |
17 |
Correct |
2 ms |
4956 KB |
Output is correct |
18 |
Correct |
3 ms |
4956 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4956 KB |
Output is correct |
2 |
Correct |
2 ms |
4956 KB |
Output is correct |
3 |
Correct |
3 ms |
4956 KB |
Output is correct |
4 |
Correct |
2 ms |
4956 KB |
Output is correct |
5 |
Correct |
3 ms |
4956 KB |
Output is correct |
6 |
Correct |
2 ms |
4956 KB |
Output is correct |
7 |
Correct |
2 ms |
4956 KB |
Output is correct |
8 |
Correct |
2 ms |
5008 KB |
Output is correct |
9 |
Correct |
2 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4956 KB |
Output is correct |
11 |
Correct |
2 ms |
4956 KB |
Output is correct |
12 |
Correct |
2 ms |
4956 KB |
Output is correct |
13 |
Correct |
2 ms |
4952 KB |
Output is correct |
14 |
Correct |
2 ms |
4956 KB |
Output is correct |
15 |
Correct |
2 ms |
4956 KB |
Output is correct |
16 |
Correct |
3 ms |
4956 KB |
Output is correct |
17 |
Correct |
2 ms |
4956 KB |
Output is correct |
18 |
Correct |
3 ms |
4956 KB |
Output is correct |
19 |
Correct |
2 ms |
4956 KB |
Output is correct |
20 |
Correct |
2 ms |
4952 KB |
Output is correct |
21 |
Correct |
3 ms |
5208 KB |
Output is correct |
22 |
Correct |
1036 ms |
62936 KB |
Output is correct |
23 |
Correct |
847 ms |
64228 KB |
Output is correct |
24 |
Correct |
941 ms |
52664 KB |
Output is correct |
25 |
Correct |
977 ms |
44784 KB |
Output is correct |
26 |
Correct |
369 ms |
22512 KB |
Output is correct |
27 |
Correct |
969 ms |
52248 KB |
Output is correct |
28 |
Correct |
205 ms |
17764 KB |
Output is correct |
29 |
Correct |
328 ms |
20492 KB |
Output is correct |
30 |
Correct |
380 ms |
26668 KB |
Output is correct |
31 |
Correct |
755 ms |
41076 KB |
Output is correct |
32 |
Correct |
765 ms |
44136 KB |
Output is correct |
33 |
Correct |
892 ms |
69560 KB |
Output is correct |
34 |
Correct |
689 ms |
120736 KB |
Output is correct |
35 |
Correct |
888 ms |
218544 KB |
Output is correct |
36 |
Runtime error |
211 ms |
262144 KB |
Execution killed with signal 9 |
37 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4956 KB |
Output is correct |
2 |
Correct |
2 ms |
4956 KB |
Output is correct |
3 |
Correct |
3 ms |
4956 KB |
Output is correct |
4 |
Correct |
2 ms |
4956 KB |
Output is correct |
5 |
Correct |
3 ms |
4956 KB |
Output is correct |
6 |
Correct |
2 ms |
4956 KB |
Output is correct |
7 |
Correct |
2 ms |
4956 KB |
Output is correct |
8 |
Correct |
2 ms |
5008 KB |
Output is correct |
9 |
Correct |
2 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4956 KB |
Output is correct |
11 |
Correct |
2 ms |
4956 KB |
Output is correct |
12 |
Correct |
2 ms |
4956 KB |
Output is correct |
13 |
Correct |
2 ms |
4952 KB |
Output is correct |
14 |
Correct |
2 ms |
4956 KB |
Output is correct |
15 |
Correct |
2 ms |
4956 KB |
Output is correct |
16 |
Correct |
3 ms |
4956 KB |
Output is correct |
17 |
Correct |
2 ms |
4956 KB |
Output is correct |
18 |
Correct |
3 ms |
4956 KB |
Output is correct |
19 |
Correct |
517 ms |
10512 KB |
Output is correct |
20 |
Correct |
525 ms |
11472 KB |
Output is correct |
21 |
Correct |
764 ms |
11220 KB |
Output is correct |
22 |
Correct |
87 ms |
11860 KB |
Output is correct |
23 |
Correct |
56 ms |
12112 KB |
Output is correct |
24 |
Correct |
40 ms |
11868 KB |
Output is correct |
25 |
Execution timed out |
3060 ms |
16532 KB |
Time limit exceeded |
26 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4956 KB |
Output is correct |
2 |
Correct |
2 ms |
4956 KB |
Output is correct |
3 |
Correct |
3 ms |
4956 KB |
Output is correct |
4 |
Correct |
2 ms |
4956 KB |
Output is correct |
5 |
Correct |
3 ms |
4956 KB |
Output is correct |
6 |
Correct |
2 ms |
4956 KB |
Output is correct |
7 |
Correct |
2 ms |
4956 KB |
Output is correct |
8 |
Correct |
2 ms |
5008 KB |
Output is correct |
9 |
Correct |
2 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4956 KB |
Output is correct |
11 |
Correct |
2 ms |
4956 KB |
Output is correct |
12 |
Correct |
2 ms |
4956 KB |
Output is correct |
13 |
Correct |
2 ms |
4952 KB |
Output is correct |
14 |
Correct |
2 ms |
4956 KB |
Output is correct |
15 |
Correct |
2 ms |
4956 KB |
Output is correct |
16 |
Correct |
3 ms |
4956 KB |
Output is correct |
17 |
Correct |
2 ms |
4956 KB |
Output is correct |
18 |
Correct |
3 ms |
4956 KB |
Output is correct |
19 |
Correct |
2 ms |
4956 KB |
Output is correct |
20 |
Correct |
2 ms |
4952 KB |
Output is correct |
21 |
Correct |
3 ms |
5208 KB |
Output is correct |
22 |
Correct |
1036 ms |
62936 KB |
Output is correct |
23 |
Correct |
847 ms |
64228 KB |
Output is correct |
24 |
Correct |
941 ms |
52664 KB |
Output is correct |
25 |
Correct |
977 ms |
44784 KB |
Output is correct |
26 |
Correct |
369 ms |
22512 KB |
Output is correct |
27 |
Correct |
969 ms |
52248 KB |
Output is correct |
28 |
Correct |
205 ms |
17764 KB |
Output is correct |
29 |
Correct |
328 ms |
20492 KB |
Output is correct |
30 |
Correct |
380 ms |
26668 KB |
Output is correct |
31 |
Correct |
755 ms |
41076 KB |
Output is correct |
32 |
Correct |
765 ms |
44136 KB |
Output is correct |
33 |
Correct |
892 ms |
69560 KB |
Output is correct |
34 |
Correct |
689 ms |
120736 KB |
Output is correct |
35 |
Correct |
888 ms |
218544 KB |
Output is correct |
36 |
Runtime error |
211 ms |
262144 KB |
Execution killed with signal 9 |
37 |
Halted |
0 ms |
0 KB |
- |