結果

問題 No.2634 Tree Distance 3
ユーザー dyktr_06dyktr_06
提出日時 2024-02-16 22:38:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,308 bytes
コンパイル時間 4,974 ms
コンパイル使用メモリ 280,128 KB
実行使用メモリ 51,300 KB
最終ジャッジ日時 2024-09-28 21:13:58
合計ジャッジ時間 29,657 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 539 ms
47,744 KB
testcase_01 AC 595 ms
47,720 KB
testcase_02 AC 617 ms
47,788 KB
testcase_03 AC 617 ms
47,788 KB
testcase_04 AC 575 ms
47,712 KB
testcase_05 AC 292 ms
28,468 KB
testcase_06 AC 287 ms
28,280 KB
testcase_07 AC 307 ms
28,360 KB
testcase_08 AC 461 ms
48,624 KB
testcase_09 WA -
testcase_10 AC 443 ms
48,856 KB
testcase_11 WA -
testcase_12 AC 426 ms
48,556 KB
testcase_13 AC 169 ms
29,352 KB
testcase_14 AC 168 ms
29,160 KB
testcase_15 AC 175 ms
29,392 KB
testcase_16 AC 351 ms
46,940 KB
testcase_17 WA -
testcase_18 AC 247 ms
35,340 KB
testcase_19 AC 271 ms
41,648 KB
testcase_20 AC 71 ms
16,992 KB
testcase_21 AC 184 ms
34,580 KB
testcase_22 WA -
testcase_23 AC 198 ms
37,580 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 445 ms
51,300 KB
testcase_27 WA -
testcase_28 AC 187 ms
31,440 KB
testcase_29 AC 182 ms
30,664 KB
testcase_30 AC 238 ms
28,548 KB
testcase_31 AC 239 ms
28,492 KB
testcase_32 WA -
testcase_33 AC 140 ms
21,816 KB
testcase_34 AC 26 ms
7,384 KB
testcase_35 AC 78 ms
14,600 KB
testcase_36 AC 44 ms
9,964 KB
testcase_37 AC 92 ms
16,416 KB
testcase_38 AC 3 ms
6,820 KB
testcase_39 AC 3 ms
6,816 KB
testcase_40 AC 3 ms
6,820 KB
testcase_41 AC 3 ms
6,820 KB
testcase_42 AC 2 ms
6,816 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 AC 426 ms
40,964 KB
testcase_46 AC 248 ms
28,764 KB
testcase_47 AC 482 ms
45,560 KB
testcase_48 WA -
testcase_49 AC 507 ms
47,872 KB
testcase_50 AC 501 ms
47,908 KB
testcase_51 AC 510 ms
47,996 KB
testcase_52 WA -
testcase_53 AC 3 ms
6,820 KB
testcase_54 AC 3 ms
6,820 KB
testcase_55 WA -
testcase_56 AC 3 ms
6,816 KB
testcase_57 WA -
testcase_58 AC 2 ms
6,816 KB
testcase_59 AC 2 ms
6,820 KB
testcase_60 AC 554 ms
47,816 KB
testcase_61 AC 558 ms
47,780 KB
testcase_62 AC 570 ms
47,744 KB
testcase_63 AC 416 ms
47,152 KB
testcase_64 AC 243 ms
32,732 KB
testcase_65 AC 381 ms
44,664 KB
testcase_66 AC 85 ms
16,296 KB
testcase_67 AC 66 ms
14,020 KB
testcase_68 AC 163 ms
29,060 KB
testcase_69 AC 161 ms
29,124 KB
testcase_70 AC 165 ms
29,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

class HeavyLightDecomposition{
protected:
    int V;
    vector<vector<int>> G;
    vector<int> stsize, parent, pathtop, depth, in, reverse_in, out;
    int root;

private:
    // Subtree Size
    void buildStsize(int curr, int prev){
        stsize[curr] = 1, parent[curr] = prev;
        for(int &v : G[curr]){
            if(v == prev){
                if(v == G[curr].back()) break;
                else swap(v, G[curr].back());
            }
            buildStsize(v, curr);
            stsize[curr] += stsize[v];
            if(stsize[v] > stsize[G[curr][0]]){
                swap(v, G[curr][0]);
            }
        }
    }

    void buildPath(int curr, int prev, int &t){
        in[curr] = t++;
        reverse_in[in[curr]] = curr;
        for(int v : G[curr]){
            if(v == prev) continue;
            
            if(v == G[curr][0]){
                pathtop[v] = pathtop[curr];
            }else{
                pathtop[v] = v;
            }
            depth[v] = depth[curr] + 1;
            buildPath(v, curr, t);
        }
        out[curr] = t;
    }

public:
    HeavyLightDecomposition(int node_size) : V(node_size), G(V), stsize(V, 0), parent(V, -1),
    pathtop(V, -1), depth(V, 0), in(V, -1), reverse_in(V, -1), out(V, -1){}

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

    void build(int _root = 0){
        root = _root;
        int t = 0;
        buildStsize(root, -1);
        pathtop[root] = root;
        buildPath(root, -1, t);
    }

    inline int get(int a){
        return in[a];
    }

    int la(int a, int k) {
        while(true){
            int u = pathtop[a];
            if(in[a] - k >= in[u]) return reverse_in[in[a] - k];
            k -= in[a] - in[u] + 1;
            a = parent[u];
        }
    }

    int lca(int a, int b){
        int pa = pathtop[a], pb = pathtop[b];
        while(pathtop[a] != pathtop[b]){
            if(in[pa] > in[pb]){
                a = parent[pa], pa = pathtop[a];
            }else{
                b = parent[pb], pb = pathtop[b];
            }
        }
        if(in[a] > in[b]) swap(a, b);
        return a;
    }

    int dist(int a, int b){ return depth[a] + depth[b] - 2 * depth[lca(a, b)]; }

    int jump(int from, int to, int k) {
        if(!k) return from;
        int l = lca(from, to);
        int d = dist(from, to);
        if(d < k) return -1;
        if(depth[from] - depth[l] >= k) return la(from, k);
        k -= depth[from] - depth[l];
        return la(to, depth[to] - depth[l] - k);
    }

    void subtree_query(int a, const function<void(int, int)> &func){
        func(in[a], out[a]);
    }

    void path_query(int a, int b, const function<void(int, int)> &func, bool include_root = true, bool reverse_path = false){
        vector<pair<int, int>> path;
        int pa = pathtop[a], pb = pathtop[b];
        while(pathtop[a] != pathtop[b]){
            if(in[pa] > in[pb]){
                path.emplace_back(in[pa], in[a] + 1);
                a = parent[pa], pa = pathtop[a];
            }else{
                path.emplace_back(in[pb], in[b] + 1);
                b = parent[pb], pb = pathtop[b];
            }
        }
        if(in[a] > in[b]) swap(a, b);

        if(include_root) path.emplace_back(in[a], in[b] + 1);
        else path.emplace_back(in[a] + 1, in[b] + 1);
        
        if(!reverse_path) reverse(path.begin(), path.end());
        else for(auto& p : path) p = make_pair(V - p.second, V - p.first);

        for(auto [u, v] : path){
            func(u, v);
        }
    }

    void path_noncommutative_query(int a, int b, const function<void(int, int)> &func, const function<void(int, int)> &func2){
        int l = lca(a, b);
        path_query(a, l, func2, false, true);
        path_query(l, b, func, true, false);
    }
};

ll n;
vll a;
vll u, v;

void input(){
    in(n);
    vin(a, n);
    u.resize(n - 1);
    v.resize(n - 1);
    rep(i, n - 1) in(u[i], v[i]);
}

void solve(){
    rep(i, n - 1) u[i]--, v[i]--;
    rep(i, n){
        a[i] = 1000000000LL - a[i];
    }
    HeavyLightDecomposition hld(n);
    rep(i, n - 1){
        hld.add_edge(u[i], v[i]);
    }
    hld.build();
    map<ll, vll> mp;
    rep(i, n){
        mp[a[i]].push_back(i);
    }
    ll mx = -1, d1 = -1, d2 = -1;
    vll ans(n);
    for(auto [k, v] : mp){
        ll mx1 = -1, mx2 = -1, dd1 = -1, dd2 = -1;
        for(auto x : v){
            if(chmax(mx1, (ll) hld.dist(0, x))){
                dd1 = x;
            }
        }
        for(auto x : v){
            if(chmax(mx2, (ll) hld.dist(dd1, x))){
                dd2 = x;
            }
        }
        if(chmax(mx, mx2)){
            d1 = dd1, d2 = dd2;
        }
        ll dist = hld.dist(d1, dd1);
        if(chmax(mx, dist)) d2 = dd1;
        dist = hld.dist(d1, dd2);
        if(chmax(mx, dist)) d2 = dd2;
        dist = hld.dist(dd1, d2);
        if(chmax(mx, dist)) d1 = dd1;
        dist = hld.dist(dd2, d2);
        if(chmax(mx, dist)) d1 = dd2;
        
        for(auto x : v){
            chmax(ans[x], (ll) max(hld.dist(x, d1), hld.dist(x, d2)));
        }
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0