#979201 (C++23) No.1718 Random Squirrel

提出ソース
結果

問題	No.1718 Random Squirrel
ユーザー	👑 rin204
提出日時	2024-05-06 00:20:28
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	15,806 bytes
コンパイル時間	4,366 ms
コンパイル使用メモリ	286,904 KB
実行使用メモリ	14,292 KB
最終ジャッジ日時	2024-11-28 01:48:49
合計ジャッジ時間	7,148 ms
ジャッジサーバーID （参考情報）	judge1 / judge3
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	1 ms 5,248 KB
testcase_04	WA	-
testcase_05	AC	2 ms 5,248 KB
testcase_06	AC	2 ms 5,248 KB
testcase_07	AC	2 ms 5,248 KB
testcase_08	AC	2 ms 5,248 KB
testcase_09	AC	2 ms 5,248 KB
testcase_10	AC	2 ms 5,248 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	AC	78 ms 13,240 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	73 ms 13,116 KB
testcase_25	WA	-
testcase_26	AC	42 ms 14,284 KB
testcase_27	AC	42 ms 14,292 KB
testcase_28	AC	41 ms 14,288 KB
testcase_29	AC	45 ms 12,708 KB
testcase_30	AC	47 ms 13,600 KB
testcase_31	AC	45 ms 12,580 KB
testcase_32	AC	45 ms 12,640 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
// #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 {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

// 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 HLD {
    int n, path;
    std::vector<std::vector<int>> edges;
    std::vector<int> siz;
    std::vector<int> par;
    std::vector<int> depth;
    std::vector<int> path_ind;
    std::vector<int> path_root;
    std::vector<int> heavy_child;
    std::vector<bool> isheavy;
    std::vector<int> L;
    std::vector<int> R;

    HLD(int n) : n(n) {
        edges.resize(n);
        siz.assign(n, -1);
        par.assign(n, -1);
        depth.assign(n, -1);
        path_ind.assign(n, -1);
        heavy_child.assign(n, -1);
        isheavy.assign(n, false);
        L.assign(n, -1);
        R.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) {
        depth[root] = 0;
        std::stack<int> st;
        std::vector<int> route;
        st.push(root);
        route.push_back(root);
        while (!st.empty()) {
            int pos = st.top();
            st.pop();
            for (auto npos : edges[pos]) {
                if (depth[npos] == -1) {
                    depth[npos] = depth[pos] + 1;
                    par[npos]   = pos;
                    st.push(npos);
                    route.push_back(npos);
                }
            }
        }
        reverse(route.begin(), route.end());
        for (auto pos : route) {
            siz[pos] = 1;
            int ma   = -1;
            for (auto npos : edges[pos]) {
                if (depth[npos] > depth[pos]) siz[pos] += siz[npos];
                if (siz[npos] > ma) {
                    ma               = siz[npos];
                    heavy_child[pos] = npos;
                }
            }
            if (heavy_child[pos] != -1) isheavy[heavy_child[pos]] = true;
        }
        isheavy[root] = true;

        path = 0;
        st.push(~root);
        st.push(root);
        path_root.push_back(root);
        int cc = 0;
        while (!st.empty()) {
            int pos = st.top();
            st.pop();
            if (pos >= 0) {
                L[pos] = cc++;
                if (!isheavy[pos]) {
                    path++;
                    path_root.push_back(pos);
                }
                path_ind[pos] = path;
                for (auto npos : edges[pos]) {
                    if (npos == par[pos] || npos == heavy_child[pos]) continue;
                    st.push(~npos);
                    st.push(npos);
                }
                if (heavy_child[pos] != -1) {
                    int npos = heavy_child[pos];
                    st.push(~npos);
                    st.push(npos);
                }
            } else {
                pos    = ~pos;
                R[pos] = cc;
            }
        }
    }

    std::vector<std::pair<int, int>> get_path(int u, int v) {
        std::vector<int> ll;
        std::vector<int> rr;
        ll.push_back(u);
        rr.push_back(v);
        while (path_ind[u] != path_ind[v]) {
            if (depth[path_root[path_ind[u]]] >= depth[path_root[path_ind[v]]]) {
                u = path_root[path_ind[u]];
                ll.push_back(u);
                u = par[u];
                ll.push_back(u);
            } else {
                v = path_root[path_ind[v]];
                rr.push_back(v);
                v = par[v];
                rr.push_back(v);
            }
        }
        reverse(rr.begin(), rr.end());
        ll.insert(ll.end(), rr.begin(), rr.end());
        int n = ll.size();
        std::vector<std::pair<int, int>> res(n / 2);
        for (int i = 0; i < n; i += 2) {
            res[i / 2] = {ll[i], ll[i + 1]};
        }
        return res;
    }

    int lca(int u, int v) {
        while (path_ind[u] != path_ind[v]) {
            if (depth[path_root[path_ind[u]]] >= depth[path_root[path_ind[v]]])
                u = par[path_root[path_ind[u]]];
            else
                v = par[path_root[path_ind[v]]];
        }
        return (depth[u] <= depth[v]) ? u : v;
    }

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

    template <typename T>
    std::vector<T> reorder(std::vector<T> &A, bool rev = false) {
        assert(int(A.size()) == n);
        std::vector<T> ret(n);
        for (int i = 0; i < n; i++) {
            ret[L[i]] = A[i];
        }
        if (rev) reverse(ret.begin(), ret.end());
        return ret;
    }
};

void solve() {
    LL(n, K);
    HLD hld(n);
    hld.read_edges();
    hld.build();
    VEC(ll, D, K);
    for (auto &d : D) d--;
    sort(all(D), [&](ll a, ll b) { return hld.L[a] < hld.L[b]; });
    if (len(D) >= 3) {
        vec(ll, E, 0);
        fori(i, K) {
            int a = D[(i + K - 1) % K];
            int b = D[i];
            int c = D[(i + 1) % K];
            if (hld.dist(a, c) != hld.dist(a, b) + hld.dist(b, c)) {
                E.push_back(b);
            }
        }
        swap(D, E);
    }
    vec(ll, dist, n, -1);
    vec(int, used, n, 0);
    ll b   = D.back();
    ll ans = 0;
    for (auto d : D) {
        ll p = hld.lca(b, d);
        ll x = hld.dist(b, d);
        ans += x;
        for (auto z : {b, d}) {
            ll y = 0;
            while (z != p) {
                used[z] = 1;
                chmax(dist[z], y);
                chmax(dist[z], x - y);
                y++;
                z = hld.par[z];
            }
            used[p] = 1;
            chmax(dist[p], y);
            chmax(dist[p], x - y);
        }
        b = d;
    }

    queue<Pii> q;
    fori(i, n) {
        if (used[i] == 1) q.push({-dist[i], i});
    }
    while (!q.empty()) {
        auto [d, pos] = q.front();
        q.pop();
        for (auto npos : hld.edges[pos]) {
            if (used[npos] != 0) continue;
            used[npos] = 2;
            dist[npos] = d + 1;
            q.push({d + 1, npos});
        }
    }

    fori(i, n) {
        if (used[i] == 1) {
            print(ans - dist[i]);
        } else {
            print(ans + dist[i]);
        }
    }
}

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;
}
yukicoder

結果

テストケース

ソースコード
