/tmp/solutions/build/tree_diameter-slow.cpp:
1| |#include <common.h>
2| |prelude;
3| |
4| |namespace {
5| |
6| |constexpr int N = 5e5;
7| |
8| |struct edge {
9| | int to;
10| | int len;
11| |};
12| |
13| |int pa[N];
14| |std::vector<edge> ch[N];
15| |
16| 40|def tree_diameter(int u, int p) -> std::pair<u64, int> {
17| 40| pa[u] = p;
18| 40| std::pair<u64, int> ans{0, u};
19| 76| for (let[v, len] : ch[u]) {
^40
------------------
| Branch (19:20): [True: 65.52%, False: 34.48%]
------------------
20| 76| if (v != p) {
------------------
| Branch (20:9): [True: 50.00%, False: 50.00%]
------------------
21| 38| def res = tree_diameter(v, u);
22| 38| res.first += len;
23| 38| ans = std::max(ans, res);
24| 38| }
25| 76| }
26| 40| return ans;
27| 40|}
28| |
29| |} // namespace
30| |
31| 1|int main() {
32| 1| rd rd;
33| 1| wt wt;
34| 1| int n = rd.uh();
35| 20| for (int i = 1; i < n; ++i) {
^19
------------------
| Branch (35:19): [True: 95.00%, False: 5.00%]
------------------
36| 19| int a = rd.uh();
37| 19| int b = rd.uh();
38| 19| int c = rd.uw();
39| 19| ch[a].emplace_back(b, c);
40| 19| ch[b].emplace_back(a, c);
41| 19| }
42| 1| let[_, u] = tree_diameter(0, -1);
43| 1| let[d, v] = tree_diameter(u, -1);
44| 1| int c = 0;
45| 10| for (int i = v; i != -1; i = pa[i]) ++c;
^9 ^9
------------------
| Branch (45:19): [True: 90.00%, False: 10.00%]
------------------
46| 1| wt.ud(d);
47| 1| wt.uw(c);
48| 10| for (int i = v; i != -1; i = pa[i]) wt.uw(i);
^9 ^9
------------------
| Branch (48:19): [True: 90.00%, False: 10.00%]
------------------
49| 1|#ifdef LOCAL
50| 21| for (int i = 0; i < n; ++i) ch[i].clear();
^20 ^20
------------------
| Branch (50:19): [True: 95.24%, False: 4.76%]
------------------
51| 1|#endif
52| 1| return 0;
53| 1|}