結果
問題 | No.2634 Tree Distance 3 |
ユーザー | Yu_212 |
提出日時 | 2024-02-16 23:35:09 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,933 ms / 3,000 ms |
コード長 | 4,813 bytes |
コンパイル時間 | 3,349 ms |
コンパイル使用メモリ | 265,860 KB |
実行使用メモリ | 334,972 KB |
最終ジャッジ日時 | 2024-02-16 23:37:23 |
合計ジャッジ時間 | 96,493 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,734 ms
316,508 KB |
testcase_01 | AC | 1,705 ms
316,508 KB |
testcase_02 | AC | 1,812 ms
316,508 KB |
testcase_03 | AC | 1,797 ms
316,508 KB |
testcase_04 | AC | 1,770 ms
316,508 KB |
testcase_05 | AC | 1,738 ms
316,508 KB |
testcase_06 | AC | 1,705 ms
316,508 KB |
testcase_07 | AC | 1,701 ms
316,540 KB |
testcase_08 | AC | 1,464 ms
304,784 KB |
testcase_09 | AC | 1,422 ms
305,176 KB |
testcase_10 | AC | 1,445 ms
305,120 KB |
testcase_11 | AC | 1,768 ms
304,220 KB |
testcase_12 | AC | 1,757 ms
303,568 KB |
testcase_13 | AC | 1,442 ms
305,452 KB |
testcase_14 | AC | 1,799 ms
303,792 KB |
testcase_15 | AC | 1,552 ms
305,132 KB |
testcase_16 | AC | 1,456 ms
257,192 KB |
testcase_17 | AC | 791 ms
152,352 KB |
testcase_18 | AC | 1,026 ms
192,896 KB |
testcase_19 | AC | 1,228 ms
225,252 KB |
testcase_20 | AC | 328 ms
73,344 KB |
testcase_21 | AC | 1,864 ms
320,792 KB |
testcase_22 | AC | 1,869 ms
320,792 KB |
testcase_23 | AC | 1,825 ms
320,792 KB |
testcase_24 | AC | 1,843 ms
312,504 KB |
testcase_25 | AC | 1,881 ms
311,384 KB |
testcase_26 | AC | 1,933 ms
322,744 KB |
testcase_27 | AC | 1,833 ms
312,500 KB |
testcase_28 | AC | 1,852 ms
312,468 KB |
testcase_29 | AC | 1,869 ms
320,248 KB |
testcase_30 | AC | 1,783 ms
325,932 KB |
testcase_31 | AC | 1,826 ms
325,792 KB |
testcase_32 | AC | 1,804 ms
325,772 KB |
testcase_33 | AC | 1,129 ms
224,380 KB |
testcase_34 | AC | 197 ms
47,104 KB |
testcase_35 | AC | 653 ms
132,736 KB |
testcase_36 | AC | 318 ms
75,392 KB |
testcase_37 | AC | 762 ms
159,412 KB |
testcase_38 | AC | 8 ms
6,676 KB |
testcase_39 | AC | 7 ms
6,676 KB |
testcase_40 | AC | 5 ms
6,676 KB |
testcase_41 | AC | 5 ms
6,676 KB |
testcase_42 | AC | 4 ms
6,676 KB |
testcase_43 | AC | 455 ms
100,224 KB |
testcase_44 | AC | 317 ms
68,224 KB |
testcase_45 | AC | 1,456 ms
274,748 KB |
testcase_46 | AC | 948 ms
179,120 KB |
testcase_47 | AC | 1,746 ms
307,744 KB |
testcase_48 | AC | 1,862 ms
325,804 KB |
testcase_49 | AC | 1,850 ms
325,780 KB |
testcase_50 | AC | 1,879 ms
325,776 KB |
testcase_51 | AC | 1,835 ms
325,920 KB |
testcase_52 | AC | 1,868 ms
325,864 KB |
testcase_53 | AC | 6 ms
6,676 KB |
testcase_54 | AC | 5 ms
6,676 KB |
testcase_55 | AC | 6 ms
6,676 KB |
testcase_56 | AC | 5 ms
6,676 KB |
testcase_57 | AC | 5 ms
6,676 KB |
testcase_58 | AC | 2 ms
6,676 KB |
testcase_59 | AC | 2 ms
6,676 KB |
testcase_60 | AC | 1,693 ms
334,740 KB |
testcase_61 | AC | 1,712 ms
334,972 KB |
testcase_62 | AC | 1,752 ms
325,452 KB |
testcase_63 | AC | 1,554 ms
291,200 KB |
testcase_64 | AC | 972 ms
187,848 KB |
testcase_65 | AC | 1,385 ms
273,972 KB |
testcase_66 | AC | 357 ms
80,128 KB |
testcase_67 | AC | 285 ms
66,944 KB |
testcase_68 | AC | 1,575 ms
300,580 KB |
testcase_69 | AC | 1,572 ms
300,548 KB |
testcase_70 | AC | 1,663 ms
300,548 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using i64 = long long; #define var auto template <class Edge> using graph = std::vector<std::vector<Edge>>; template <class Edge> struct helper { static int to(const Edge &e) { return e.to; } }; template <class T> struct helper<std::pair<int, T>> { static int to(const std::pair<int, T> &e) { return e.first; } }; template <> struct helper<int> { static int to(const int &e) { return e; } }; template <class Edge> int to(const Edge &e) { return helper<Edge>::to(e); } // f(divide, L, R) template <class Edge, class F> void one_third_centroid_decomposition(const graph<Edge> &g, F f) { const int n = g.size(); assert(n >= 1); std::vector<int> size(n), xy(n), count(n), sort(n); using buf_node = std::pair<graph<Edge>, graph<Edge>>; std::vector<std::unique_ptr<buf_node>> buf; const auto get_buf = [&](const int depth) -> buf_node & { while (depth >= buf.size()) buf.push_back(std::make_unique<buf_node>(graph<Edge>(n), graph<Edge>(n))); return *buf[depth]; }; const auto dc = [&](const auto &dc, const int n, const int v, const graph<Edge> &g, const int depth) -> void { if (n <= 2) return; int s = -1; const auto sz = [&](const auto &sz, const int v, const int p) -> void { size[v] = 1; int max = 0; for (const auto &e : g[v]) { if (to(e) != p) { sz(sz, to(e), v); size[v] += size[to(e)]; max = std::max(max, size[to(e)]); } } max = std::max(max, n - size[v]); if (max * 2 <= n) s = v; }; sz(sz, v, -1); int maxsz = 0; for (const auto &e : g[s]) { if (size[to(e)] > size[s]) size[to(e)] = n - size[s]; count[size[to(e)]]++; maxsz = std::max(maxsz, size[to(e)] + 1); } for (int i = 1; i < maxsz; i++) count[i] += count[i - 1]; for (const auto &e : g[s]) sort[--count[size[to(e)]]] = to(e); std::fill(count.begin(), count.begin() + maxsz, 0); int xs = 0, ys = 0; for (int i = g[s].size(); i-- > 0;) { if (xs < ys) xy[sort[i]] = 0, xs += size[sort[i]]; else xy[sort[i]] = 1, ys += size[sort[i]]; } auto &[x, y] = get_buf(depth); x[s].clear(); y[s].clear(); const auto build = [&](const auto &build, const int v, const int p, auto &t) -> void { t[v] = g[v]; for (const auto &e : g[v]) { if (to(e) != p) build(build, to(e), v, t); } }; for (const auto &e : g[s]) { auto &t = xy[to(e)] ? y : x; t[s].push_back(e); build(build, to(e), s, t); } f(s, x, y); dc(dc, xs + 1, s, x, depth + 1); dc(dc, ys + 1, s, y, depth + 1); }; dc(dc, n, 0, g, 0); } int main() { cin.tie(0)->sync_with_stdio(false); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } vector<vector<int>> edges(n); for (int i = 0; i < n - 1; i ++) { int u, v; cin >> u >> v; u--, v--; edges[u].push_back(v); edges[v].push_back(u); } vector<int> ans(n); const auto f = [&](const int s, const auto &x, const auto &y) { vector<int> table; auto dfs1 = [&](auto self, int node, int parent, int depth) -> void { while (table.size() <= depth) table.push_back(0); table[depth] = min(table[depth], -a[node]); for (int child : x[node]) { if (child == parent) continue; self(self, child, node, depth + 1); } }; dfs1(dfs1, s, s, 0); int m = table.size(); for (int i = m - 2; i >= 0; i--) { table[i] = min(table[i], table[i + 1]); } auto dfs2 = [&](auto self, int node, int parent, int depth) -> void { int pos = upper_bound(table.begin(), table.end(), -a[node]) - table.begin(); if (pos >= 1) { ans[node] = max(ans[node], depth + pos - 1); } for (int child : y[node]) { if (child == parent) continue; self(self, child, node, depth + 1); } }; dfs2(dfs2, s, s, 0); }; one_third_centroid_decomposition(edges, [&](int s, const auto &x, const auto &y) { f(s, x, y); f(s, y, x); }); for (int i = 0; i < n; i++) { cout << ans[i] << " \n"[i+1==n]; } }