結果
問題 | No.2634 Tree Distance 3 |
ユーザー | 👑 hos.lyric |
提出日時 | 2024-02-16 22:41:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 462 ms / 3,000 ms |
コード長 | 3,957 bytes |
コンパイル時間 | 2,408 ms |
コンパイル使用メモリ | 128,292 KB |
実行使用メモリ | 76,896 KB |
最終ジャッジ日時 | 2024-02-16 22:41:46 |
合計ジャッジ時間 | 23,804 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 399 ms
72,240 KB |
testcase_01 | AC | 379 ms
72,240 KB |
testcase_02 | AC | 391 ms
72,240 KB |
testcase_03 | AC | 446 ms
72,240 KB |
testcase_04 | AC | 423 ms
72,240 KB |
testcase_05 | AC | 207 ms
51,632 KB |
testcase_06 | AC | 230 ms
51,632 KB |
testcase_07 | AC | 233 ms
51,632 KB |
testcase_08 | AC | 392 ms
73,136 KB |
testcase_09 | AC | 361 ms
73,184 KB |
testcase_10 | AC | 377 ms
73,164 KB |
testcase_11 | AC | 462 ms
73,096 KB |
testcase_12 | AC | 435 ms
73,072 KB |
testcase_13 | AC | 165 ms
52,596 KB |
testcase_14 | AC | 183 ms
52,472 KB |
testcase_15 | AC | 160 ms
52,552 KB |
testcase_16 | AC | 320 ms
69,300 KB |
testcase_17 | AC | 160 ms
41,940 KB |
testcase_18 | AC | 227 ms
51,148 KB |
testcase_19 | AC | 258 ms
61,512 KB |
testcase_20 | AC | 67 ms
23,264 KB |
testcase_21 | AC | 207 ms
59,664 KB |
testcase_22 | AC | 208 ms
62,580 KB |
testcase_23 | AC | 203 ms
63,824 KB |
testcase_24 | AC | 434 ms
76,380 KB |
testcase_25 | AC | 418 ms
74,844 KB |
testcase_26 | AC | 372 ms
76,896 KB |
testcase_27 | AC | 189 ms
54,200 KB |
testcase_28 | AC | 190 ms
55,568 KB |
testcase_29 | AC | 187 ms
54,752 KB |
testcase_30 | AC | 207 ms
51,876 KB |
testcase_31 | AC | 194 ms
51,780 KB |
testcase_32 | AC | 199 ms
51,784 KB |
testcase_33 | AC | 124 ms
38,108 KB |
testcase_34 | AC | 26 ms
10,360 KB |
testcase_35 | AC | 69 ms
23,804 KB |
testcase_36 | AC | 39 ms
15,016 KB |
testcase_37 | AC | 84 ms
27,100 KB |
testcase_38 | AC | 3 ms
6,676 KB |
testcase_39 | AC | 3 ms
6,676 KB |
testcase_40 | AC | 3 ms
6,676 KB |
testcase_41 | AC | 2 ms
6,676 KB |
testcase_42 | AC | 2 ms
6,676 KB |
testcase_43 | AC | 91 ms
25,652 KB |
testcase_44 | AC | 61 ms
18,216 KB |
testcase_45 | AC | 313 ms
61,752 KB |
testcase_46 | AC | 213 ms
41,928 KB |
testcase_47 | AC | 404 ms
68,584 KB |
testcase_48 | AC | 381 ms
72,384 KB |
testcase_49 | AC | 428 ms
72,380 KB |
testcase_50 | AC | 395 ms
72,372 KB |
testcase_51 | AC | 424 ms
72,364 KB |
testcase_52 | AC | 402 ms
72,384 KB |
testcase_53 | AC | 3 ms
6,676 KB |
testcase_54 | AC | 3 ms
6,676 KB |
testcase_55 | AC | 3 ms
6,676 KB |
testcase_56 | AC | 2 ms
6,676 KB |
testcase_57 | AC | 3 ms
6,676 KB |
testcase_58 | AC | 2 ms
6,676 KB |
testcase_59 | AC | 2 ms
6,676 KB |
testcase_60 | AC | 416 ms
72,240 KB |
testcase_61 | AC | 419 ms
72,240 KB |
testcase_62 | AC | 434 ms
72,240 KB |
testcase_63 | AC | 328 ms
70,796 KB |
testcase_64 | AC | 214 ms
47,656 KB |
testcase_65 | AC | 336 ms
66,972 KB |
testcase_66 | AC | 81 ms
22,628 KB |
testcase_67 | AC | 62 ms
19,308 KB |
testcase_68 | AC | 163 ms
52,404 KB |
testcase_69 | AC | 160 ms
52,404 KB |
testcase_70 | AC | 160 ms
52,404 KB |
ソースコード
#include <cassert> #include <cmath> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using Int = long long; template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; }; template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; } template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; } template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; } template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; } #define COLOR(s) ("\x1b[" s "m") int N; vector<int> A, B; vector<vector<int>> G; namespace lca { vector<int> dep; // vector<Int> cs; vector<int> poss, seq; vector<int> mn_; vector<int *> mn; void dfs(int u, int pi) { poss[u] = seq.size(); seq.push_back(u); for (const int i : G[u]) if (pi != i) { const int v = A[i] ^ B[i] ^ u; dep[v] = dep[u] + 1; // cs[v] = cs[u] + C[i]; dfs(v, i); seq.push_back(u); } } inline int shallower(int u, int v) { return (dep[u] <= dep[v]) ? u : v; } void build() { poss.resize(N); dep.assign(N, 0); // cs.assign(N, 0); seq.clear(); dfs(0, -1); const int E = (31 - __builtin_clz(2 * N - 1)) + 1; mn_.resize(E * (2 * N - 1)); mn.resize(E); for (int e = 0; e < E; ++e) { mn[e] = mn_.data() + e * (2 * N - 1); } for (int j = 0; j < 2 * N - 1; ++j) { mn[0][j] = seq[j]; } for (int e = 0; e < E - 1; ++e) { for (int i = 0; i + (1 << (e + 1)) <= 2 * N - 1; ++i) { mn[e + 1][i] = shallower(mn[e][i], mn[e][i + (1 << e)]); } } } int lca(int u, int v) { int j0 = poss[u], j1 = poss[v]; if (j0 > j1) swap(j0, j1); ++j1; const int e = 31 - __builtin_clz(j1 - j0); return shallower(mn[e][j0], mn[e][j1 - (1 << e)]); } inline int dist(int u, int v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; } // inline Int cost(int u, int v) { // return cs[u] + cs[v] - 2 * cs[lca(u, v)]; // } } // lca //////////////////////////////////////////////////////////////////////////////// vector<int> W; int main() { for (; ~scanf("%d", &N); ) { W.resize(N); for (int u = 0; u < N; ++u) { scanf("%d", &W[u]); } A.resize(N - 1); B.resize(N - 1); for (int i = 0; i < N - 1; ++i) { scanf("%d%d", &A[i], &B[i]); --A[i]; --B[i]; } G.assign(N, {}); for (int i = 0; i < N - 1; ++i) { G[A[i]].push_back(i); G[B[i]].push_back(i); } lca::build(); map<int, vector<int>> uss; for (int u = 0; u < N; ++u) { uss[-W[u]].push_back(u); } vector<int> ans(N, 0); { int d = 0; int a = -1, b = -1; for (const auto &kv : uss) { for (const int u : kv.second) { if (!~a) { a = b = u; } else { const int dau = lca::dist(a, u); const int dbu = lca::dist(b, u); if (dau >= dbu) { if (chmax(d, dau)) b = u; } else { if (chmax(d, dbu)) a = u; } } } for (const int u : kv.second) { ans[u] = max(lca::dist(a, u), lca::dist(b, u)); } } } for (int u = 0; u < N; ++u) { if (u) printf(" "); printf("%d", ans[u]); } puts(""); } return 0; }