結果

問題 No.2634 Tree Distance 3
ユーザー 👑 rin204rin204
提出日時 2024-02-18 18:18:35
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 673 ms / 3,000 ms
コード長 12,486 bytes
コンパイル時間 4,625 ms
コンパイル使用メモリ 275,128 KB
実行使用メモリ 34,420 KB
最終ジャッジ日時 2024-02-18 18:19:06
合計ジャッジ時間 30,330 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 291 ms
33,204 KB
testcase_01 AC 303 ms
33,204 KB
testcase_02 AC 293 ms
33,204 KB
testcase_03 AC 313 ms
33,204 KB
testcase_04 AC 304 ms
33,204 KB
testcase_05 AC 311 ms
33,204 KB
testcase_06 AC 372 ms
33,204 KB
testcase_07 AC 335 ms
33,204 KB
testcase_08 AC 247 ms
34,272 KB
testcase_09 AC 252 ms
34,240 KB
testcase_10 AC 282 ms
34,324 KB
testcase_11 AC 258 ms
34,164 KB
testcase_12 AC 247 ms
34,420 KB
testcase_13 AC 284 ms
34,296 KB
testcase_14 AC 283 ms
34,248 KB
testcase_15 AC 267 ms
34,292 KB
testcase_16 AC 312 ms
26,652 KB
testcase_17 AC 189 ms
17,344 KB
testcase_18 AC 284 ms
20,884 KB
testcase_19 AC 281 ms
23,752 KB
testcase_20 AC 68 ms
10,132 KB
testcase_21 AC 578 ms
33,204 KB
testcase_22 AC 488 ms
33,204 KB
testcase_23 AC 455 ms
33,204 KB
testcase_24 AC 536 ms
33,204 KB
testcase_25 AC 534 ms
33,204 KB
testcase_26 AC 484 ms
33,204 KB
testcase_27 AC 673 ms
33,204 KB
testcase_28 AC 604 ms
33,204 KB
testcase_29 AC 554 ms
33,204 KB
testcase_30 AC 526 ms
33,264 KB
testcase_31 AC 509 ms
33,264 KB
testcase_32 AC 474 ms
33,268 KB
testcase_33 AC 286 ms
25,708 KB
testcase_34 AC 44 ms
7,760 KB
testcase_35 AC 126 ms
16,636 KB
testcase_36 AC 73 ms
10,804 KB
testcase_37 AC 164 ms
18,672 KB
testcase_38 AC 4 ms
6,676 KB
testcase_39 AC 3 ms
6,676 KB
testcase_40 AC 3 ms
6,676 KB
testcase_41 AC 3 ms
6,676 KB
testcase_42 AC 3 ms
6,676 KB
testcase_43 AC 101 ms
12,760 KB
testcase_44 AC 66 ms
9,480 KB
testcase_45 AC 364 ms
27,940 KB
testcase_46 AC 208 ms
19,424 KB
testcase_47 AC 422 ms
30,768 KB
testcase_48 AC 427 ms
33,264 KB
testcase_49 AC 447 ms
33,264 KB
testcase_50 AC 447 ms
33,264 KB
testcase_51 AC 469 ms
33,264 KB
testcase_52 AC 432 ms
33,268 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 3 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 298 ms
33,204 KB
testcase_61 AC 355 ms
33,204 KB
testcase_62 AC 313 ms
33,204 KB
testcase_63 AC 221 ms
34,100 KB
testcase_64 AC 141 ms
22,620 KB
testcase_65 AC 226 ms
31,188 KB
testcase_66 AC 52 ms
11,620 KB
testcase_67 AC 43 ms
10,256 KB
testcase_68 AC 240 ms
33,744 KB
testcase_69 AC 231 ms
33,744 KB
testcase_70 AC 235 ms
33,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #define INTERACTIVE

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

struct LCA {
    int n;
    int logn;
    std::vector<std::vector<int>> par;
    std::vector<std::vector<int>> edges;
    std::vector<int> depth;
    LCA(int n) : n(n) {
        logn  = 0;
        int x = 1;
        while (x < n) {
            x *= 2;
            logn++;
        }
        par.assign(logn, std::vector<int>(n, -1));
        edges.resize(n);
        depth.assign(n, -1);
    }

    void read_edges(int indexed = 1) {
        int u, v;
        for (int i = 0; i < n - 1; i++) {
            std::cin >> u >> v;
            u -= indexed;
            v -= indexed;
            edges[u].push_back(v);
            edges[v].push_back(u);
        }
    }

    void add_edge(int u, int v) {
        edges[u].push_back(v);
        edges[v].push_back(u);
    }

    void build(int root = 0) {
        std::stack<int> st;
        st.push(root);
        depth[root] = 0;
        while (!st.empty()) {
            int pos = st.top();
            st.pop();
            for (auto npos : edges[pos]) {
                if (depth[npos] == -1) {
                    depth[npos]  = depth[pos] + 1;
                    par[0][npos] = pos;
                    st.push(npos);
                }
            }
        }

        for (int i = 1; i < logn; i++) {
            for (int j = 0; j < n; j++) {
                int p = par[i - 1][j];
                if (p != -1) {
                    par[i][j] = par[i - 1][p];
                }
            }
        }
    }

    int lca(int u, int v) {
        int du = depth[u];
        int dv = depth[v];
        if (du > dv) {
            std::swap(u, v);
            std::swap(du, dv);
        }
        int d = dv - du;
        int i = 0;
        while (d > 0) {
            if (d & 1) v = par[i][v];
            d >>= 1;
            i++;
        }

        if (u == v) return u;
        for (int i = logn - 1; i >= 0; i--) {
            int pu = par[i][u];
            int pv = par[i][v];
            if (pu != pv) {
                u = pu;
                v = pv;
            }
        }
        return par[0][u];
    }

    int dist(int u, int v) {
        int p = lca(u, v);
        return depth[u] + depth[v] - 2 * depth[p];
    }

    int jump(int u, int v, int k) {
        if (k == 0) return u;
        int p  = lca(u, v);
        int du = depth[u] - depth[p];
        int dv = depth[v] - depth[p];
        if (du + dv < k) return -1;
        int d;
        if (k <= du) {
            d = k;
        } else {
            u = v;
            d = du + dv - k;
        }

        int i = 0;
        while (d > 0) {
            if (d & 1) u = par[i][u];
            d >>= 1;
            i++;
        }

        return u;
    }
};

void solve() {
    INT(n);
    VEC(ll, A, n);
    LCA G(n);
    G.read_edges();
    G.build();

    A.push_back(-1);
    vec(int, ind, n + 1, 0);
    iota(all(ind), 0);
    sort(all(ind), [&](int i, int j) { return A[i] > A[j]; });
    vec(int, ans, n);
    int b = A[ind[0]];
    vec(int, inds, 0);
    int u = ind[0];
    int v = ind[0];
    for (auto i : ind) {
        if (A[i] == b) {
            inds.push_back(i);
            continue;
        }
        for (auto j : inds) {
            int du = G.dist(u, j);
            int dv = G.dist(v, j);
            if (du < dv) swap(u, v);
            dv     = G.dist(u, v);
            int dj = G.dist(u, j);
            if (dj > dv) {
                v = j;
            }
        }

        for (auto j : inds) {
            ans[j] = max(G.dist(u, j), G.dist(v, j));
        }

        inds = {i};
        b    = A[i];
    }
    print(ans);
}

int main() {
#ifndef INTERACTIVE
    cin.tie(0)->sync_with_stdio(0);
#endif
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}
0