#950080 (C++23) No.2634 Tree Distance 3

提出ソース

結果

問題	No.2634 Tree Distance 3
ユーザー	ebi_fly
提出日時	2024-02-11 15:14:40
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,400 ms / 3,000 ms
コード長	16,172 bytes
コンパイル時間	4,019 ms
コンパイル使用メモリ	284,968 KB
実行使用メモリ	125,732 KB
最終ジャッジ日時	2024-09-28 19:22:29
合計ジャッジ時間	56,316 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,022 ms 116,316 KB
testcase_01	AC	991 ms 116,376 KB
testcase_02	AC	1,069 ms 116,244 KB
testcase_03	AC	1,049 ms 116,372 KB
testcase_04	AC	1,001 ms 116,200 KB
testcase_05	AC	794 ms 106,660 KB
testcase_06	AC	777 ms 110,888 KB
testcase_07	AC	737 ms 110,884 KB
testcase_08	AC	895 ms 100,240 KB
testcase_09	AC	948 ms 100,160 KB
testcase_10	AC	884 ms 100,192 KB
testcase_11	AC	895 ms 100,200 KB
testcase_12	AC	866 ms 99,936 KB
testcase_13	AC	620 ms 91,496 KB
testcase_14	AC	614 ms 89,964 KB
testcase_15	AC	610 ms 91,028 KB
testcase_16	AC	759 ms 95,280 KB
testcase_17	AC	395 ms 50,584 KB
testcase_18	AC	543 ms 62,932 KB
testcase_19	AC	612 ms 75,716 KB
testcase_20	AC	175 ms 26,784 KB
testcase_21	AC	742 ms 125,732 KB
testcase_22	AC	752 ms 125,604 KB
testcase_23	AC	749 ms 125,608 KB
testcase_24	AC	946 ms 110,944 KB
testcase_25	AC	963 ms 120,184 KB
testcase_26	AC	979 ms 121,572 KB
testcase_27	AC	726 ms 113,832 KB
testcase_28	AC	700 ms 115,956 KB
testcase_29	AC	783 ms 106,532 KB
testcase_30	AC	840 ms 115,676 KB
testcase_31	AC	824 ms 114,276 KB
testcase_32	AC	802 ms 115,420 KB
testcase_33	AC	502 ms 74,920 KB
testcase_34	AC	89 ms 17,280 KB
testcase_35	AC	299 ms 43,732 KB
testcase_36	AC	162 ms 25,988 KB
testcase_37	AC	371 ms 50,880 KB
testcase_38	AC	6 ms 6,816 KB
testcase_39	AC	6 ms 6,816 KB
testcase_40	AC	5 ms 6,820 KB
testcase_41	AC	4 ms 6,820 KB
testcase_42	AC	4 ms 6,816 KB
testcase_43	AC	298 ms 35,056 KB
testcase_44	AC	183 ms 24,808 KB
testcase_45	AC	1,010 ms 99,808 KB
testcase_46	AC	607 ms 63,216 KB
testcase_47	AC	1,177 ms 114,036 KB
testcase_48	AC	1,202 ms 121,428 KB
testcase_49	AC	1,239 ms 121,848 KB
testcase_50	AC	1,231 ms 122,084 KB
testcase_51	AC	1,400 ms 122,432 KB
testcase_52	AC	1,381 ms 122,428 KB
testcase_53	AC	6 ms 6,820 KB
testcase_54	AC	5 ms 6,816 KB
testcase_55	AC	6 ms 6,820 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,301 ms 120,872 KB
testcase_61	AC	1,170 ms 119,944 KB
testcase_62	AC	1,221 ms 118,464 KB
testcase_63	AC	926 ms 95,600 KB
testcase_64	AC	625 ms 64,964 KB
testcase_65	AC	841 ms 90,320 KB
testcase_66	AC	205 ms 29,284 KB
testcase_67	AC	166 ms 24,724 KB
testcase_68	AC	664 ms 87,480 KB
testcase_69	AC	644 ms 87,484 KB
testcase_70	AC	734 ms 87,484 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 1 "/home/ebi/procon/Library/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 "/home/ebi/procon/Library/template/debug_template.hpp"

#line 4 "/home/ebi/procon/Library/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 "/home/ebi/procon/Library/template/int_alias.hpp"

#line 4 "/home/ebi/procon/Library/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 "/home/ebi/procon/Library/template/io.hpp"

#line 5 "/home/ebi/procon/Library/template/io.hpp"
#include <optional>
#line 7 "/home/ebi/procon/Library/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 "/home/ebi/procon/Library/template/utility.hpp"

#line 5 "/home/ebi/procon/Library/template/utility.hpp"

#line 7 "/home/ebi/procon/Library/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 "sol.cpp"

#line 2 "/home/ebi/procon/Library/tree/centroid_decomposition.hpp"

#line 5 "/home/ebi/procon/Library/tree/centroid_decomposition.hpp"
#include <ranges>
#line 7 "/home/ebi/procon/Library/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 "/home/ebi/procon/Library/graph/template.hpp"

#line 4 "/home/ebi/procon/Library/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 5 "sol.cpp"

namespace ebi {

void main_() {
    int n;
    std::cin >> n;
    std::vector<i64> 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);
    }
    int t = 0;
    std::vector table(n, std::vector<std::pair<int,int>>());
    auto f = [&](const std::vector<int> &par, const std::vector<int> &vs, const std::vector<int> &color) {
        int sz = (int)par.size();
        std::vector<int> depth(sz, 0);
        rep(i,1,sz) {
            depth[i] = depth[par[i]] + 1;
        }
        std::vector<int> red, blue;
        rep(i,0,sz) {
            if(color[i] == 0) red.emplace_back(i);
            else if(color[i] == 1) blue.emplace_back(i);
            else assert(color[i] == -1);
        }
        if(red.empty() || blue.empty()) return;
        for(auto v: red) {
            table[vs[v]].emplace_back(t, depth[v]);
        }
        t++;
        for(auto v: blue) {
            table[vs[v]].emplace_back(t, depth[v]);
        }
        t++;
    };
    centroid_decomposition<2>(g, f);
    std::vector<int> s(t, -1);
    std::map<int, std::vector<int>> map;
    rep(i,0,n) {
        map[a[i]].emplace_back(i);
    }
    std::vector<int> ans(n, 0);
    for(auto [x, vs]: map | std::views::reverse) {
        for(auto v: vs) {
            for(auto [label, d]: table[v]) {
                chmax(s[label], d);
            }
        }
        for(auto v: vs) {
            for(auto [label, d]: table[v]) {
                label ^= 1;
                if(s[label] == -1) continue;
                chmax(ans[v], d + s[label]);
            }
        }
    }
    std::cout << ans << '\n';
}

}  // namespace ebi

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

yukicoder

結果

テストケース

ソースコード