結果

問題 No.2634 Tree Distance 3
ユーザー ebi_flyebi_fly
提出日時 2024-02-16 14:56:56
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,704 ms / 3,000 ms
コード長 18,122 bytes
コンパイル時間 3,454 ms
コンパイル使用メモリ 277,692 KB
実行使用メモリ 48,416 KB
最終ジャッジ日時 2024-09-28 19:32:35
合計ジャッジ時間 62,887 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,596 ms
47,324 KB
testcase_01 AC 1,653 ms
47,328 KB
testcase_02 AC 1,697 ms
47,452 KB
testcase_03 AC 1,652 ms
47,324 KB
testcase_04 AC 1,639 ms
47,324 KB
testcase_05 AC 931 ms
27,848 KB
testcase_06 AC 962 ms
28,124 KB
testcase_07 AC 958 ms
27,972 KB
testcase_08 AC 912 ms
48,352 KB
testcase_09 AC 849 ms
48,392 KB
testcase_10 AC 871 ms
48,388 KB
testcase_11 AC 815 ms
48,312 KB
testcase_12 AC 758 ms
48,284 KB
testcase_13 AC 397 ms
30,536 KB
testcase_14 AC 375 ms
28,880 KB
testcase_15 AC 383 ms
29,836 KB
testcase_16 AC 1,378 ms
39,216 KB
testcase_17 AC 708 ms
24,964 KB
testcase_18 AC 951 ms
30,492 KB
testcase_19 AC 1,134 ms
35,068 KB
testcase_20 AC 317 ms
13,908 KB
testcase_21 AC 974 ms
30,288 KB
testcase_22 AC 983 ms
30,396 KB
testcase_23 AC 1,003 ms
30,312 KB
testcase_24 AC 1,560 ms
47,448 KB
testcase_25 AC 1,611 ms
47,452 KB
testcase_26 AC 1,704 ms
47,324 KB
testcase_27 AC 928 ms
28,516 KB
testcase_28 AC 931 ms
28,636 KB
testcase_29 AC 900 ms
29,504 KB
testcase_30 AC 812 ms
29,996 KB
testcase_31 AC 827 ms
30,360 KB
testcase_32 AC 824 ms
30,372 KB
testcase_33 AC 304 ms
23,256 KB
testcase_34 AC 59 ms
7,536 KB
testcase_35 AC 176 ms
15,536 KB
testcase_36 AC 100 ms
10,172 KB
testcase_37 AC 205 ms
16,740 KB
testcase_38 AC 5 ms
6,820 KB
testcase_39 AC 5 ms
6,820 KB
testcase_40 AC 3 ms
6,816 KB
testcase_41 AC 3 ms
6,820 KB
testcase_42 AC 3 ms
6,816 KB
testcase_43 AC 361 ms
18,216 KB
testcase_44 AC 227 ms
13,112 KB
testcase_45 AC 1,185 ms
40,944 KB
testcase_46 AC 717 ms
28,256 KB
testcase_47 AC 1,389 ms
45,072 KB
testcase_48 AC 1,388 ms
47,384 KB
testcase_49 AC 1,413 ms
47,384 KB
testcase_50 AC 1,498 ms
47,512 KB
testcase_51 AC 1,422 ms
47,380 KB
testcase_52 AC 1,415 ms
47,424 KB
testcase_53 AC 5 ms
6,816 KB
testcase_54 AC 5 ms
6,820 KB
testcase_55 AC 5 ms
6,816 KB
testcase_56 AC 5 ms
6,820 KB
testcase_57 AC 5 ms
6,820 KB
testcase_58 AC 2 ms
6,820 KB
testcase_59 AC 2 ms
6,820 KB
testcase_60 AC 1,278 ms
47,324 KB
testcase_61 AC 1,293 ms
47,456 KB
testcase_62 AC 1,314 ms
47,324 KB
testcase_63 AC 517 ms
48,416 KB
testcase_64 AC 308 ms
33,072 KB
testcase_65 AC 496 ms
45,920 KB
testcase_66 AC 111 ms
16,420 KB
testcase_67 AC 93 ms
14,284 KB
testcase_68 AC 290 ms
29,172 KB
testcase_69 AC 292 ms
29,036 KB
testcase_70 AC 303 ms
29,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)
#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)
#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#line 2 "template/debug_template.hpp"

#line 4 "template/debug_template.hpp"

namespace ebi {

#ifdef LOCAL
#define debug(...)                                                      \
    std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
        debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() {
    std::cerr << std::endl;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
    std::cerr << " " << h;
    if (sizeof...(t) > 0) std::cerr << " :";
    debug_out(t...);
}

}  // namespace ebi
#line 2 "template/int_alias.hpp"

#line 4 "template/int_alias.hpp"

namespace ebi {

using ld = long double;
using std::size_t;
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

}  // namespace ebi
#line 2 "template/io.hpp"

#line 5 "template/io.hpp"
#include <optional>
#line 7 "template/io.hpp"

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi
#line 2 "template/utility.hpp"

#line 5 "template/utility.hpp"

#line 7 "template/utility.hpp"

namespace ebi {

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T safe_ceil(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return (a / b) + 1;
    else
        return -((-a) / b);
}

template <class T> T safe_floor(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return a / b;
    else
        return -((-a) / b) - 1;
}

constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;

constexpr int INF = std::numeric_limits<int>::max() / 2;

const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};
const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};

}  // namespace ebi
#line 2 "a.cpp"

#line 2 "data_structure/segtree.hpp"

#line 5 "data_structure/segtree.hpp"

namespace ebi {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  private:
    int n;
    int sz;
    std::vector<S> data;

    void update(int i) {
        data[i] = op(data[2 * i], data[2 * i + 1]);
    }

  public:
    segtree(int n_) : segtree(std::vector<S>(n_, e())) {}
    segtree(const std::vector<S> &v) : n((int)v.size()), sz(1) {
        while (sz < n) sz *= 2;
        data = std::vector<S>(2 * sz, e());
        for (int i = 0; i < n; i++) {
            data[sz + i] = v[i];
        }
        for (int i = sz - 1; i >= 1; i--) update(i);
    }

    void set(int p, S x) {
        assert(0 <= p && p < n);
        p += sz;
        data[p] = x;
        while (p > 1) {
            p >>= 1;
            update(p);
        }
    }

    S get(int p) const {
        assert(0 <= p && p < n);
        return data[p + sz];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= n);
        S sml = e(), smr = e();
        l += sz;
        r += sz;
        while (l < r) {
            if (l & 1) sml = op(sml, data[l++]);
            if (r & 1) smr = op(data[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const {
        return data[1];
    }

    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l < n);
        assert(f(e()));
        if (l == n) return n;
        l += sz;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, data[l]))) {
                while (l < sz) {
                    l = 2 * l;
                    if (f(op(sm, data[l]))) {
                        sm = op(sm, data[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            sm = op(sm, data[l]);
            l++;
        } while ((l & -l) != l);
        return n;
    }

    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= n);
        assert(f(e()));
        if (r == 0) return 0;
        r += sz;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(data[r], sm))) {
                while (r < sz) {
                    r = 2 * r + 1;
                    if (f(op(data[r], sm))) {
                        sm = op(data[r], sm);
                        r--;
                    }
                }
                return r + 1 - sz;
            }
            sm = op(data[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

    S operator[](int p) const {
        return data[sz + p];
    }
};

}  // namespace ebi
#line 2 "tree/centroid_decomposition.hpp"

#line 5 "tree/centroid_decomposition.hpp"
#include <ranges>
#line 7 "tree/centroid_decomposition.hpp"

namespace ebi {

namespace internal {

template <class F>
void centroid_decomposition_dfs_naive(const std::vector<int> &par,
                                      const std::vector<int> &original_vs,
                                      F f) {
    const int n = (int)par.size();
    assert(par.size() == original_vs.size());
    int center = -1;
    std::vector<int> sz(n, 1);
    for (const int v : std::views::iota(0, n) | std::views::reverse) {
        if (sz[v] >= (n + 1) / 2) {
            center = v;
            break;
        }
        sz[par[v]] += sz[v];
    }
    std::vector<int> color(n, -1);
    std::vector<int> vs = {center};
    color[center] = 0;
    int c = 1;
    for (const int v : std::views::iota(1, n)) {
        if (par[v] == center) {
            vs.emplace_back(v);
            color[v] = c++;
        }
    }
    if (center > 0) {
        for (int v = par[center]; v != -1; v = par[v]) {
            vs.emplace_back(v);
            color[v] = c;
        }
        c++;
    }
    for (const int v : std::views::iota(0, n)) {
        if (color[v] == -1) {
            vs.emplace_back(v);
            color[v] = color[par[v]];
        }
    }
    std::vector<int> index_ptr(c + 1, 0);
    for (const int v : std::views::iota(0, n)) {
        index_ptr[color[v] + 1]++;
    }
    for (const int i : std::views::iota(0, c)) {
        index_ptr[i + 1] += index_ptr[i];
    }
    auto counter = index_ptr;
    std::vector<int> ord(n);
    for (auto v : vs) {
        ord[counter[color[v]]++] = v;
    }
    std::vector<int> relabel(n);
    for (const int v : std::views::iota(0, n)) {
        relabel[ord[v]] = v;
    }
    std::vector<int> original_vs2(n);
    for (const int v : std::views::iota(0, n)) {
        original_vs2[relabel[v]] = original_vs[v];
    }
    std::vector<int> relabel_par(n, -1);
    for (int v : std::views::iota(1, n)) {
        int a = relabel[v];
        int b = relabel[par[v]];
        if (a > b) std::swap(a, b);
        relabel_par[b] = a;
    }
    f(relabel_par, original_vs2, index_ptr);
    for (const int i : std::views::iota(1, c)) {
        int l = index_ptr[i], r = index_ptr[i + 1];
        std::vector<int> par1(r - l, -1);
        std::vector<int> original_vs1(r - l, -1);
        for (int v : std::views::iota(l, r)) {
            par1[v - l] = (relabel_par[v] == 0 ? -1 : relabel_par[v] - l);
            original_vs1[v - l] = original_vs2[v];
        }
        centroid_decomposition_dfs_naive(par1, original_vs1, f);
    }
    return;
}

template <class F>
void one_third_centroid_decomposition(const std::vector<int> &par,
                                      const std::vector<int> &original_vs,
                                      F f) {
    const int n = (int)par.size();
    assert(n > 1);
    if (n == 2) return;
    int center = -1;
    std::vector<int> sz(n, 1);

    for (const int v : std::views::iota(0, n) | std::views::reverse) {
        if (sz[v] >= (n + 1) / 2) {
            center = v;
            break;
        }
        sz[par[v]] += sz[v];
    }

    std::vector<int> color(n, -1);
    std::vector<int> ord(n, -1);
    ord[center] = 0;
    int t = 1;
    int red = n - sz[center];
    for (int v = par[center]; v != -1; v = par[v]) {
        ord[v] = t++;
        color[v] = 0;
    }
    for (const int v : std::views::iota(1, n)) {
        if (par[v] == center && 3 * (red + sz[v]) <= 2 * (n - 1)) {
            red += sz[v];
            ord[v] = t++;
            color[v] = 0;
        }
    }
    for (const int v : std::views::iota(1, n)) {
        if (v != center && color[v] == -1 && color[par[v]] == 0) {
            ord[v] = t++;
            color[v] = 0;
        }
    }
    const int n0 = t - 1;
    for (const int v : std::views::iota(1, n)) {
        if (v != center && color[v] == -1) {
            ord[v] = t++;
            color[v] = 1;
        }
    }
    assert(t == n);
    const int n1 = n - 1 - n0;
    std::vector<int> par0(n0 + 1, -1), par1(n1 + 1, -1), par2(n, -1);
    std::vector<int> original_vs0(n0 + 1), original_vs1(n1 + 1),
        original_vs2(n);
    for (const int i : std::views::iota(0, n)) {
        int v = ord[i];
        original_vs2[v] = original_vs[i];
        if (color[i] != 1) {
            original_vs0[v] = original_vs[i];
        }
        if (color[i] != 0) {
            int idx = std::max(v - n0, 0);
            original_vs1[idx] = original_vs[i];
        }
    }
    for (const int v : std::views::iota(1, n)) {
        int a = ord[v], b = ord[par[v]];
        if (a > b) std::swap(a, b);
        par2[b] = a;
        if (color[v] != 1 && color[par[v]] != 1) {
            par0[b] = a;
        }
        if (color[v] != 0 && color[par[v]] != 0) {
            par1[b - n0] = std::max(a - n0, 0);
        }
    }
    f(par2, original_vs2, n0, n1);
    one_third_centroid_decomposition(par0, original_vs0, f);
    one_third_centroid_decomposition(par1, original_vs1, f);
    return;
}

template <class F>
void one_third_centroid_decomposition_virtual_real(
    const std::vector<int> &par, const std::vector<int> &original_vs,
    const std::vector<int> &is_real, F f) {
    const int n = (int)par.size();
    assert(n > 1);
    if (n == 2) {
        if (is_real[0] && is_real[1]) {
            f(par, original_vs, {0, 1});
        }
        return;
    }
    int center = -1;
    std::vector<int> sz(n, 1);

    for (const int v : std::views::iota(0, n) | std::views::reverse) {
        if (sz[v] >= (n + 1) / 2) {
            center = v;
            break;
        }
        sz[par[v]] += sz[v];
    }

    std::vector<int> color(n, -1);
    std::vector<int> ord(n, -1);
    ord[center] = 0;
    int t = 1;
    int red = n - sz[center];
    for (int v = par[center]; v != -1; v = par[v]) {
        ord[v] = t++;
        color[v] = 0;
    }
    for (const int v : std::views::iota(1, n)) {
        if (par[v] == center && 3 * (red + sz[v]) <= 2 * (n - 1)) {
            red += sz[v];
            ord[v] = t++;
            color[v] = 0;
        }
    }
    for (const int v : std::views::iota(1, n)) {
        if (v != center && color[v] == -1 && color[par[v]] == 0) {
            ord[v] = t++;
            color[v] = 0;
        }
    }
    const int n0 = t - 1;
    for (const int v : std::views::iota(1, n)) {
        if (v != center && color[v] == -1) {
            ord[v] = t++;
            color[v] = 1;
        }
    }
    assert(t == n);
    const int n1 = n - 1 - n0;
    std::vector<int> par0(n0 + 1, -1), par1(n1 + 1, -1), par2(n, -1);
    std::vector<int> original_vs0(n0 + 1), original_vs1(n1 + 1),
        original_vs2(n);
    std::vector<int> is_real0(n0 + 1), is_real1(n1 + 1), is_real2(n);
    for (const int i : std::views::iota(0, n)) {
        int v = ord[i];
        original_vs2[v] = original_vs[i];
        is_real2[v] = is_real[i];
        if (color[i] != 1) {
            original_vs0[v] = original_vs[i];
            is_real0[v] = is_real[i];
        }
        if (color[i] != 0) {
            int idx = std::max(v - n0, 0);
            original_vs1[idx] = original_vs[i];
            is_real1[idx] = is_real[i];
        }
    }
    for (const int v : std::views::iota(1, n)) {
        int a = ord[v], b = ord[par[v]];
        if (a > b) std::swap(a, b);
        par2[b] = a;
        if (color[v] != 1 && color[par[v]] != 1) {
            par0[b] = a;
        }
        if (color[v] != 0 && color[par[v]] != 0) {
            par1[b - n0] = std::max(a - n0, 0);
        }
    }
    if (is_real[center]) {
        color.assign(n, -1);
        color[0] = 0;
        for (const int v : std::views::iota(1, n)) {
            if (is_real2[v]) color[v] = 1;
        }
        f(par2, original_vs2, color);
        is_real0[0] = is_real1[0] = is_real2[0] = 0;
    }
    color.assign(n, -1);
    for (const int v : std::views::iota(1, n)) {
        if (is_real2[v]) {
            color[v] = int(v > n0);
        }
    }
    f(par2, original_vs2, color);
    one_third_centroid_decomposition_virtual_real(par0, original_vs0, is_real0,
                                                  f);
    one_third_centroid_decomposition_virtual_real(par1, original_vs1, is_real1,
                                                  f);
    return;
}

}  // namespace internal

template <int MODE, class F>
void centroid_decomposition(const std::vector<std::vector<int>> &tree, F f) {
    int n = (int)tree.size();
    if (n == 1) return;
    std::vector<int> bfs_order(n), par(n, -1);
    bfs_order[0] = 0;
    int l = 0, r = 1;
    while (l < r) {
        int v = bfs_order[l++];
        for (auto nv : tree[v]) {
            if (nv == par[v]) continue;
            bfs_order[r++] = nv;
            par[nv] = v;
        }
    }
    assert(l == n && r == n);
    {
        std::vector<int> relabel(n);
        for (int i : std::views::iota(0, n)) {
            relabel[bfs_order[i]] = i;
        }
        std::vector<int> relabel_par(n, -1);
        for (int i : std::views::iota(1, n)) {
            relabel_par[relabel[i]] = relabel[par[i]];
        }
        std::swap(par, relabel_par);
    }
    static_assert(MODE == 0 || MODE == 1 || MODE == 2);
    if constexpr (MODE == 0) {
        internal::centroid_decomposition_dfs_naive(par, bfs_order, f);
    } else if constexpr (MODE == 1) {
        internal::one_third_centroid_decomposition(par, bfs_order, f);
    } else {
        internal::one_third_centroid_decomposition_virtual_real(
            par, bfs_order, std::vector<int>(n, 1), f);
    }
}

}  // namespace ebi
#line 2 "graph/template.hpp"

#line 4 "graph/template.hpp"

namespace ebi {

template <class T> struct Edge {
    int to;
    T cost;
    Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}
};

template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {
    using std::vector<std::vector<Edge<T>>>::vector;
    void add_edge(int u, int v, T w, bool directed = false) {
        (*this)[u].emplace_back(v, w);
        if (directed) return;
        (*this)[v].emplace_back(u, w);
    }
};

struct graph : std::vector<std::vector<int>> {
    using std::vector<std::vector<int>>::vector;
    void add_edge(int u, int v, bool directed = false) {
        (*this)[u].emplace_back(v);
        if (directed) return;
        (*this)[v].emplace_back(u);
    }
};

}  // namespace ebi
#line 6 "a.cpp"

namespace ebi {

int op(int a, int b) {
    return a > b ? a : b;
}

int e() {
    return -1;
}

void main_() {
    int n;
    std::cin >> n;
    std::vector<int> a(n);
    std::cin >> a;
    graph g(n);
    rep(i,0,n-1) {
        int u,v;
        std::cin >> u >> v;
        u--; v--;
        g.add_edge(u, v);
    }
    std::vector<int> ans(n, 0);
    auto f = [&](const std::vector<int> &par, const std::vector<int> &vs, const std::vector<int> &idxs) -> void {
        int sz = par.size();
        std::vector<int> dist(sz, 0);
        rep(i,1,sz) {
            dist[i] = dist[par[i]] + 1;
        }
        segtree<int, op, e> seg(sz);
        std::map<int, std::vector<int>> map;
        rep(i,0,sz) {
            map[a[vs[i]]].emplace_back(i);
        }
        for(auto [val, p]: map | std::views::reverse) {
            for(auto v: p) {
                seg.set(v, dist[v]);    
            }
            for(auto v: p) {
                int ret = std::upper_bound(all(idxs), v) - idxs.begin() - 1;
                int l = idxs[ret], r = idxs[ret + 1];
                int res = op(seg.prod(0, l), seg.prod(r, sz));
                if(res != e()) chmax(ans[vs[v]], res + dist[v]);
            }
        }
    };
    centroid_decomposition<0>(g, f);
    std::cout << ans << '\n';
}

}  // namespace ebi

int main() {
    ebi::fast_io();
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ebi::main_();
    }
    return 0;
}
0