#include <iostream>
#include <vector>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <cstring>
#include <unordered_map>
#include <iomanip>
#include <queue>
#include <map>
#include <sstream>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
const int nm = 200002;
const ll inf = 1e18;
vector<pair<int, ll>> adj[nm];
int H[nm][2], L[nm];
int Res;
unordered_map<ll, int> dfs(int i, int p, int k) {
unordered_map<ll, int> res;
for (auto [j, w]: adj[i]) {
if (j == p) continue;
auto resj = dfs(j, i, k);
for (auto [cost, len]: resj) {
if (cost + w > k) continue;
if (cost + w == k) {
Res = min(Res, len + 1);
} else if (res.count(k - cost - w)) {
Res = min(Res, res[k - cost - w] + len + 1);
}
if (res.count(cost + w) && len + 1 < res[cost + w]) res[cost + w] = len + 1;
else res[cost + w] = len + 1;
}
res[w] = 1;
}
// cout << "dfs " << i << "\n";
// for (auto [cost, len]: res) cout << cost << " " << len << "\n";
return res;
}
void bfs(int i, int n, int k) {
queue<int> q;
q.push(i);
vector<pair<ll, ll>> d(n);
for (int j = 0; j < n; ++j) d[j] = {inf, inf};
d[i] = {0, 0};
while (q.size()) {
int i = q.front();
q.pop();
for (auto [j, w]: adj[i]) {
if (d[j].second > d[i].second + 1) {
d[j].first = d[i].first + w;
d[j].second = d[i].second + 1;
q.push(j);
}
}
}
for (int j = 0; j < n; ++j) {
if (d[j].first == k) Res = min(Res, (int) d[j].second);
}
}
int best_path(int n, int k, int H[][2], int L[]) {
for (int i = 0; i < n - 1; ++i) {
adj[H[i][0]].emplace_back(H[i][1], L[i]);
adj[H[i][1]].emplace_back(H[i][0], L[i]);
}
Res = n + 1;
for (int i = 0; i < n; ++i) bfs(i, n, k);
return Res <= n ? Res : -1;
}
// int main() {
// #ifdef LOCAL
// freopen("grader.in.1", "r", stdin);
// #endif
// ios::sync_with_stdio(0);
// cin.tie(0);
// int n, k;
// cin >> n >> k;
// for (int i = 0; i < n - 1; ++i) cin >> H[i][0] >> H[i][1] >> L[i];
// cout << best_path(n, k, H, L) << "\n";
// }
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11096 KB |
Output is correct |
6 |
Correct |
2 ms |
11100 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
3 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
2 ms |
11100 KB |
Output is correct |
13 |
Correct |
3 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
2 ms |
11100 KB |
Output is correct |
16 |
Correct |
2 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11124 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11096 KB |
Output is correct |
6 |
Correct |
2 ms |
11100 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
3 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
2 ms |
11100 KB |
Output is correct |
13 |
Correct |
3 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
2 ms |
11100 KB |
Output is correct |
16 |
Correct |
2 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11124 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
19 |
Correct |
2 ms |
11100 KB |
Output is correct |
20 |
Correct |
2 ms |
11100 KB |
Output is correct |
21 |
Correct |
13 ms |
11208 KB |
Output is correct |
22 |
Correct |
13 ms |
11100 KB |
Output is correct |
23 |
Correct |
13 ms |
11220 KB |
Output is correct |
24 |
Correct |
13 ms |
11356 KB |
Output is correct |
25 |
Correct |
13 ms |
11208 KB |
Output is correct |
26 |
Correct |
13 ms |
11100 KB |
Output is correct |
27 |
Correct |
15 ms |
11100 KB |
Output is correct |
28 |
Correct |
14 ms |
11124 KB |
Output is correct |
29 |
Correct |
12 ms |
11096 KB |
Output is correct |
30 |
Correct |
13 ms |
11204 KB |
Output is correct |
31 |
Correct |
13 ms |
11208 KB |
Output is correct |
32 |
Correct |
13 ms |
11196 KB |
Output is correct |
33 |
Correct |
13 ms |
11096 KB |
Output is correct |
34 |
Correct |
10 ms |
11096 KB |
Output is correct |
35 |
Correct |
10 ms |
11096 KB |
Output is correct |
36 |
Correct |
8 ms |
11100 KB |
Output is correct |
37 |
Correct |
10 ms |
11136 KB |
Output is correct |
38 |
Correct |
11 ms |
11100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11096 KB |
Output is correct |
6 |
Correct |
2 ms |
11100 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
3 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
2 ms |
11100 KB |
Output is correct |
13 |
Correct |
3 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
2 ms |
11100 KB |
Output is correct |
16 |
Correct |
2 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11124 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
19 |
Execution timed out |
3061 ms |
20112 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11096 KB |
Output is correct |
6 |
Correct |
2 ms |
11100 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
3 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
2 ms |
11100 KB |
Output is correct |
13 |
Correct |
3 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
2 ms |
11100 KB |
Output is correct |
16 |
Correct |
2 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11124 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
19 |
Correct |
2 ms |
11100 KB |
Output is correct |
20 |
Correct |
2 ms |
11100 KB |
Output is correct |
21 |
Correct |
13 ms |
11208 KB |
Output is correct |
22 |
Correct |
13 ms |
11100 KB |
Output is correct |
23 |
Correct |
13 ms |
11220 KB |
Output is correct |
24 |
Correct |
13 ms |
11356 KB |
Output is correct |
25 |
Correct |
13 ms |
11208 KB |
Output is correct |
26 |
Correct |
13 ms |
11100 KB |
Output is correct |
27 |
Correct |
15 ms |
11100 KB |
Output is correct |
28 |
Correct |
14 ms |
11124 KB |
Output is correct |
29 |
Correct |
12 ms |
11096 KB |
Output is correct |
30 |
Correct |
13 ms |
11204 KB |
Output is correct |
31 |
Correct |
13 ms |
11208 KB |
Output is correct |
32 |
Correct |
13 ms |
11196 KB |
Output is correct |
33 |
Correct |
13 ms |
11096 KB |
Output is correct |
34 |
Correct |
10 ms |
11096 KB |
Output is correct |
35 |
Correct |
10 ms |
11096 KB |
Output is correct |
36 |
Correct |
8 ms |
11100 KB |
Output is correct |
37 |
Correct |
10 ms |
11136 KB |
Output is correct |
38 |
Correct |
11 ms |
11100 KB |
Output is correct |
39 |
Execution timed out |
3061 ms |
20112 KB |
Time limit exceeded |
40 |
Halted |
0 ms |
0 KB |
- |