#997953 (C++23) No.2822 Lights Up! (Tree Edition)

提出ソース

結果

問題	No.2822 Lights Up! (Tree Edition)
ユーザー	👑 rin204
提出日時	2024-07-26 23:36:33
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	153 ms / 2,000 ms
コード長	21,570 bytes
コンパイル時間	4,723 ms
コンパイル使用メモリ	289,780 KB
実行使用メモリ	37,628 KB
最終ジャッジ日時	2024-07-26 23:36:44
合計ジャッジ時間	10,772 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	130 ms 37,588 KB
testcase_03	AC	124 ms 37,628 KB
testcase_04	AC	153 ms 37,440 KB
testcase_05	AC	141 ms 37,584 KB
testcase_06	AC	124 ms 37,432 KB
testcase_07	AC	130 ms 37,468 KB
testcase_08	AC	44 ms 13,260 KB
testcase_09	AC	113 ms 35,960 KB
testcase_10	AC	91 ms 23,616 KB
testcase_11	AC	82 ms 22,480 KB
testcase_12	AC	54 ms 16,992 KB
testcase_13	AC	54 ms 10,368 KB
testcase_14	AC	134 ms 20,192 KB
testcase_15	AC	68 ms 20,132 KB
testcase_16	AC	3 ms 6,944 KB
testcase_17	AC	5 ms 6,944 KB
testcase_18	AC	9 ms 6,944 KB
testcase_19	AC	7 ms 6,944 KB
testcase_20	AC	5 ms 6,940 KB
testcase_21	AC	11 ms 6,940 KB
testcase_22	AC	10 ms 6,944 KB
testcase_23	AC	8 ms 6,940 KB
testcase_24	AC	9 ms 6,944 KB
testcase_25	AC	5 ms 6,944 KB
testcase_26	AC	9 ms 6,940 KB
testcase_27	AC	3 ms 6,944 KB
testcase_28	AC	13 ms 6,940 KB
testcase_29	AC	19 ms 6,944 KB
testcase_30	AC	18 ms 6,940 KB
testcase_31	AC	4 ms 6,940 KB
testcase_32	AC	11 ms 6,944 KB
testcase_33	AC	11 ms 6,940 KB
testcase_34	AC	11 ms 6,944 KB
testcase_35	AC	11 ms 6,944 KB
testcase_36	AC	12 ms 6,944 KB
testcase_37	AC	12 ms 6,940 KB
testcase_38	AC	12 ms 6,944 KB
testcase_39	AC	11 ms 6,944 KB
testcase_40	AC	12 ms 6,944 KB
testcase_41	AC	11 ms 6,940 KB
testcase_42	AC	11 ms 6,944 KB
testcase_43	AC	12 ms 6,940 KB
testcase_44	AC	11 ms 6,944 KB
testcase_45	AC	15 ms 6,944 KB
testcase_46	AC	12 ms 6,944 KB
testcase_47	AC	16 ms 6,944 KB
testcase_48	AC	3 ms 6,940 KB
testcase_49	AC	3 ms 6,944 KB
testcase_50	AC	3 ms 6,940 KB
testcase_51	AC	3 ms 6,940 KB
testcase_52	AC	3 ms 6,944 KB
testcase_53	AC	3 ms 6,940 KB
testcase_54	AC	3 ms 6,944 KB
testcase_55	AC	3 ms 6,944 KB
testcase_56	AC	3 ms 6,940 KB
testcase_57	AC	3 ms 6,940 KB
testcase_58	AC	2 ms 6,940 KB
testcase_59	AC	3 ms 6,940 KB
testcase_60	AC	3 ms 6,944 KB
testcase_61	AC	3 ms 6,944 KB
testcase_62	AC	3 ms 6,944 KB
testcase_63	AC	3 ms 6,944 KB
testcase_64	AC	3 ms 6,940 KB
testcase_65	AC	3 ms 6,944 KB
testcase_66	AC	3 ms 6,940 KB
testcase_67	AC	3 ms 6,940 KB
testcase_68	AC	3 ms 6,944 KB
testcase_69	AC	2 ms 6,944 KB
testcase_70	AC	3 ms 6,940 KB
testcase_71	AC	3 ms 6,940 KB
testcase_72	AC	3 ms 6,944 KB
testcase_73	AC	3 ms 6,944 KB
testcase_74	AC	3 ms 6,944 KB
testcase_75	AC	2 ms 6,944 KB
testcase_76	AC	11 ms 6,944 KB
testcase_77	AC	4 ms 6,940 KB
testcase_78	AC	3 ms 6,944 KB
testcase_79	AC	3 ms 6,940 KB
testcase_80	AC	2 ms 6,940 KB
testcase_81	AC	2 ms 6,944 KB
testcase_82	AC	2 ms 6,940 KB
testcase_83	AC	2 ms 6,944 KB
testcase_84	AC	2 ms 6,940 KB
testcase_85	AC	2 ms 6,944 KB
testcase_86	AC	2 ms 6,944 KB
testcase_87	AC	2 ms 6,940 KB
testcase_88	AC	2 ms 6,944 KB
testcase_89	AC	2 ms 6,944 KB
testcase_90	AC	2 ms 6,944 KB
testcase_91	AC	2 ms 6,940 KB
testcase_92	AC	2 ms 6,940 KB
testcase_93	AC	2 ms 6,940 KB
testcase_94	AC	2 ms 6,940 KB
testcase_95	AC	2 ms 6,940 KB
testcase_96	AC	2 ms 6,940 KB
testcase_97	AC	2 ms 6,944 KB
testcase_98	AC	2 ms 6,940 KB
testcase_99	AC	2 ms 6,940 KB
testcase_100	AC	2 ms 6,944 KB
testcase_101	AC	2 ms 6,940 KB
testcase_102	AC	2 ms 6,944 KB
testcase_103	AC	2 ms 6,940 KB
testcase_104	AC	2 ms 6,944 KB
testcase_105	AC	2 ms 6,940 KB
testcase_106	AC	2 ms 6,940 KB
testcase_107	AC	2 ms 6,944 KB
testcase_108	AC	2 ms 6,940 KB
testcase_109	AC	2 ms 6,944 KB
testcase_110	AC	2 ms 6,940 KB
testcase_111	AC	2 ms 6,940 KB
testcase_112	AC	2 ms 6,940 KB
testcase_113	AC	2 ms 6,944 KB
testcase_114	AC	2 ms 6,940 KB
testcase_115	AC	3 ms 6,944 KB
testcase_116	AC	2 ms 6,944 KB
testcase_117	AC	2 ms 6,940 KB
testcase_118	AC	2 ms 6,940 KB
testcase_119	AC	2 ms 6,944 KB
testcase_120	AC	2 ms 6,940 KB
testcase_121	AC	2 ms 6,944 KB
testcase_122	AC	2 ms 6,940 KB
testcase_123	AC	2 ms 6,944 KB
testcase_124	AC	2 ms 6,940 KB
testcase_125	AC	2 ms 6,944 KB
testcase_126	AC	2 ms 6,944 KB
testcase_127	AC	2 ms 6,944 KB
testcase_128	AC	2 ms 6,940 KB
testcase_129	AC	2 ms 6,944 KB
testcase_130	AC	2 ms 6,940 KB
testcase_131	AC	2 ms 6,940 KB
testcase_132	AC	2 ms 6,940 KB
testcase_133	AC	2 ms 6,940 KB
testcase_134	AC	3 ms 6,940 KB
testcase_135	AC	2 ms 6,944 KB
testcase_136	AC	2 ms 6,940 KB
testcase_137	AC	3 ms 6,940 KB
testcase_138	AC	2 ms 6,944 KB
testcase_139	AC	2 ms 6,944 KB
testcase_140	AC	2 ms 6,944 KB
testcase_141	AC	2 ms 6,940 KB
testcase_142	AC	2 ms 6,940 KB
testcase_143	AC	2 ms 6,940 KB

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

ソースコード

raw source code

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE

#include <bits/stdc++.h>
using namespace std;

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 UnionFind {
    int n;
    std::vector<int> par;
    int group;

    UnionFind() = default;
    UnionFind(int n) : n(n) {
        par.assign(n, -1);
        group = n;
    }

    int find(int x) {
        if (par[x] < 0) return x;
        par[x] = find(par[x]);
        return par[x];
    }

    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (par[x] > par[y]) std::swap(x, y);
        group--;
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }

    int size(int x) {
        return -par[find(x)];
    }

    std::vector<int> roots() {
        std::vector<int> ret;
        for (int i = 0; i < n; i++) {
            if (i == find(i)) ret.push_back(i);
        }
        return ret;
    }

    bool isroot(int x) {
        return x == find(x);
    }
};

template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F),
          F (*id)()>
struct lazy_segtree {
  public:
    explicit lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
        size = 1;
        log  = 0;
        while (size < _n) {
            log++;
            size <<= 1;
        }
        d  = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) update(i);
    }
    explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}

    S prod(int l, int r) {
        if (l == r) return e();

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S get(int x) {
        return prod(x, x + 1);
    }

    S all_prod() {
        return d[1];
    }

    void apply(int l, int r, F f) {
        if (l == r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

  private:
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;
    void update(int k) {
        d[k] = op(d[2 * k], d[2 * k + 1]);
    }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
};

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

struct S {
    ll c0;
    ll c1;
};
S op(S a, S b) {
    return S{a.c0 + b.c0, a.c1 + b.c1};
}
S e() {
    return S{0, 0};
}
using F = bool;
S mapping(F f, S x) {
    if (!f) return x;
    return S{x.c1, x.c0};
}
F composition(F f, F g) {
    return f ^ g;
}
F id() {
    return false;
}

void solve() {
    INT(n);
    HLD hld(2 * n - 1);
    fori(i, n - 1) {
        INT(p);
        p--;
        hld.add_edge(i + n, i + 1);
        hld.add_edge(i + n, p);
    }
    hld.build();
    vec(S, ini, 2 * n - 1, e());
    STRING(T);
    fori(i, n - 1) {
        if (T[i] == '.') {
            ini[i + n] = S{1, 0};
        } else {
            ini[i + n] = S{0, 1};
        }
    }

    ini = hld.reorder(ini);
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(ini);
    INT(K);
    UnionFind UF(n);
    fori(K) {
        INT(u, v);
        UF.unite(u - 1, v - 1);
    }

    vec(int, to, n, -1);
    {
        vvec(int, child, n);
        fori(i, n) {
            child[UF.find(i)].push_back(i);
        }
        fori(i, n) {
            if (child[i].size() <= 1) continue;
            sort(all(child[i]));
            fori(j, child[i].size() - 1) {
                to[child[i][j + 1]] = child[i][j];
            }
        }
    }

    fori(i, n - 1, 0, -1) {
        if (to[i] == -1) continue;
        auto p = seg.get(hld.L[i + n - 1]);
        if (p.c1 == 0) continue;

        for (auto [u, v] : hld.get_path(i, to[i])) {
            u = hld.L[u];
            v = hld.L[v];
            if (u > v) swap(u, v);
            seg.apply(u, v + 1, true);
        }
    }

    auto res = seg.prod(0, 2 * n - 1);
    Yes(res.c1 == 0);
}

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

// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// #include "data_structure/UnionFind.hpp"
// #include "data_structure/lazySegTree.hpp"
// #include "tree/HLD.hpp"
//
// struct S {
//     ll c0;
//     ll c1;
// };
// S op(S a, S b) {
//     return S{a.c0 + b.c0, a.c1 + b.c1};
// }
// S e() {
//     return S{0, 0};
// }
// using F = bool;
// S mapping(F f, S x) {
//     if (!f) return x;
//     return S{x.c1, x.c0};
// }
// F composition(F f, F g) {
//     return f ^ g;
// }
// F id() {
//     return false;
// }
//
// void solve() {
//     INT(n);
//     HLD hld(2 * n - 1);
//     fori(i, n - 1) {
//         INT(p);
//         p--;
//         hld.add_edge(i + n, i + 1);
//         hld.add_edge(i + n, p);
//     }
//     hld.build();
//     vec(S, ini, 2 * n - 1, e());
//     STRING(T);
//     fori(i, n - 1) {
//         if (T[i] == '.') {
//             ini[i + n] = S{1, 0};
//         } else {
//             ini[i + n] = S{0, 1};
//         }
//     }
//
//     ini = hld.reorder(ini);
//     lazy_segtree<S, op, e, F, mapping, composition, id> seg(ini);
//     INT(K);
//     UnionFind UF(n);
//     fori(K) {
//         INT(u, v);
//         UF.unite(u - 1, v - 1);
//     }
//
//     vec(int, to, n, -1);
//     {
//         vvec(int, child, n);
//         fori(i, n) {
//             child[UF.find(i)].push_back(i);
//         }
//         fori(i, n) {
//             if (child[i].size() <= 1) continue;
//             sort(all(child[i]));
//             fori(j, child[i].size() - 1) {
//                 to[child[i][j + 1]] = child[i][j];
//             }
//         }
//     }
//
//     fori(i, n - 1, 0, -1) {
//         if (to[i] == -1) continue;
//         auto p = seg.get(hld.L[i + n - 1]);
//         if (p.c1 == 0) continue;
//
//         for (auto [u, v] : hld.get_path(i, to[i])) {
//             u = hld.L[u];
//             v = hld.L[v];
//             if (u > v) swap(u, v);
//             seg.apply(u, v + 1, true);
//         }
//     }
//
//     auto res = seg.prod(0, 2 * n - 1);
//     Yes(res.c1 == 0);
// }
//
// int main() {
// #ifndef INTERACTIVE
//     std::cin.tie(0)->sync_with_stdio(0);
// #endif
//     // std::cout << std::fixed << std::setprecision(12);
//     int t;
//     t = 1;
//     // std::cin >> t;
//     while (t--) solve();
//     return 0;
// }

yukicoder

結果

テストケース

ソースコード