#686544 (C++17) No.1641 Tree Xor Query

提出ソース
結果

問題	No.1641 Tree Xor Query
ユーザー	bond_cmprog
提出日時	2021-08-06 21:57:28
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	237 ms / 5,000 ms
コード長	12,419 bytes
コンパイル時間	4,104 ms
コンパイル使用メモリ	275,912 KB
実行使用メモリ	19,584 KB
最終ジャッジ日時	2024-09-17 01:56:02
合計ジャッジ時間	5,618 ms
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	1 ms 6,940 KB
testcase_10	AC	1 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	237 ms 19,584 KB
testcase_14	AC	231 ms 19,584 KB
testcase_15	AC	5 ms 6,940 KB
testcase_16	AC	13 ms 6,940 KB
testcase_17	AC	10 ms 6,940 KB
testcase_18	AC	8 ms 6,940 KB
testcase_19	AC	8 ms 6,940 KB
testcase_20	AC	168 ms 15,372 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <stdio.h>
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint = boost::multiprecision::cpp_int;
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
inline constexpr ll ceil_div(const ll a, const ll b) {return (a + b - 1) / b - !!((a + b - 1) % b < 0);}// return ceil(a/b)
inline constexpr ll floor_div(const ll a, const ll b) {return a / b - !!(a % b < 0);}// return floor(a/b)

/*  ----------------------- DEBUG FUNCTION ---------------------------- */
#define DUMPOUT cerr
void dump_function() { DUMPOUT << ' '; }
void dump_function(bool a) { DUMPOUT << a; }
void dump_function(int a) { DUMPOUT << a; }
void dump_function(long long a) { DUMPOUT << a; }
void dump_function(char a) { DUMPOUT << a; }
void dump_function(string &a) { DUMPOUT << a; }
void dump_function(double a) { DUMPOUT << a; }
template <class T> void dump_function(const vector<T> &);
template <class T, size_t size> void dump_function(const array<T, size> &);
template <class T, class L> void dump_function(const pair<T, L> &p);
template <class T, size_t size> void dump_function(const T (&)[size]);
template <class T> void dump_function(const vector<T> &a) {
    if(a.empty()) return;
    dump_function(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
    DUMPOUT << endl;
}
template <class T> void dump_function(const deque<T> &a) {
    if(a.empty()) return;
    dump_function(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template <class T, size_t size> void dump_function(const array<T, size> &a) {
    dump_function(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template <class T, class L> void dump_function(const pair<T, L> &p) {
    DUMPOUT << '(';
    dump_function(p.first);
    DUMPOUT << ",";
    dump_function(p.second);
    DUMPOUT << ')';
}
template <class T> void dump_function(set<T> &x) {
    for(auto e : x) dump_function(e), DUMPOUT << " ";
    DUMPOUT << endl;
}
template <class T> void dump_function(multiset<T> &x) {
    for(auto e : x) dump_function(e), DUMPOUT << " ";
    DUMPOUT << endl;
}
template <class T, size_t size> void dump_function(const T (&a)[size]) {
    dump_function(a[0]);
    for(auto i = a; ++i != end(a);) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template <class T> void dump_function(const T &a) { DUMPOUT << a; }
int dump_out() {
    DUMPOUT << '\n';
    return 0;
}
template <class T> int dump_out(const T &t) {
    dump_function(t);
    DUMPOUT << '\n';
    return 0;
}
template <class Head, class... Tail> int dump_out(const Head &head, const Tail &... tail) {
    dump_function(head);
    DUMPOUT << ' ';
    dump_out(tail...);
    return 0;
}

#ifdef DEBUG_
#define dump(x)                                                                                                                                               \
    DUMPOUT << #x << ": ";                                                                                                                                        \
    dump_function(x);                                                                                                                                                  \
    DUMPOUT << endl;
void dumps() {}
template <class T> void dumps(const T &t) {
    dump_function(t);
    DUMPOUT << " ";
}
template <class Head, class... Tail> void dumps(const Head &head, const Tail &... tail) {
    dump_function(head);
    DUMPOUT << ' ';
    dump_out(tail...);
}
#else
#define dump(x)
template <class... T> void dumps(const T &...) {}
#endif
/*  ----------------------- DEBUG FUNCTION ---------------------------- */

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() const { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0) x.val += MOD;
        return is;
    }
    friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(r, n / 2);
        t = t * t;
        if (n & 1) t = t * r;
        return t;
    }
    friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Fp<MOD>(u);
    }
};


template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T nCr(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        int MOD = fact_[0].getmod();
        if(n < MOD) return fact_[n] * finv_[k] * finv_[n-k];

        // Lucasの定理
        T ret = 1;
        while(n || k){
            int _n = n % MOD, _k = k % MOD;
            n /= MOD;
            k /= MOD;
            ret *= nCr(_n, _k);
        }
        return ret;
    }
    constexpr T nPr(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[n-k];
    }
    constexpr T nHr(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};

/* ----------------------------- MOD ----------------------------------- */
const int MOD = 1000000007;
const int MOD2 = 998244353;
using mint = Fp<MOD>;
// BiCoef<mint> bc;
// using vec = vector<int>;
// using mat = vector<vec>;
/* ----------------------------- MOD ----------------------------------- */

/*  ----------------------- AtCoder Library ---------------------------- */
#include <atcoder/all>
using namespace atcoder;
/*  ----------------------- AtCoder Library ---------------------------- */
class HLD{
    void dfs_sz(int v, int p){
        if(g[v].size() and g[v][0] == p) swap(g[v][0], g[v].back());
        for(auto &to : g[v]){
            if(to == p) continue;
            dfs_sz(to, v);
            sz[v] += sz[to];
            if(sz[to] > sz[g[v][0]]) swap(to, g[v][0]);
        }
    }

    void dfs_hld(int v, int p, int &k){
        par[v] = p; vid[v] = k++, inv[vid[v]] = v;
        for(auto to : g[v]){
            if(to == p) continue;
            head[to] = (to == g[v][0] ? head[v] : to);
            dfs_hld(to, v, k);
        }
    }
public:
    int n;
    vector<vector<int>> g;
    vector<int> vid, head, sz, par, inv;
    HLD() {}
    HLD(int sz) : n(sz), g(n), vid(n, -1), head(n), sz(n, 1), par(n), inv(n) {}

    void add_edge(int u, int v){
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }

    void build(vector<int> rs=vector<int>(1,0)){
        int k = 0;
        for(int r : rs){
            dfs_sz(r, -1);
            head[r] = r;
            dfs_hld(r, -1, k);
        }
    }

    // パスu-vの頂点属性クエリ　区間[l, r) を返す
    vector<pair<int, int>> for_each(int u, int v){
        vector<pair<int, int>> res;
        while(1){
            if(vid[u] > vid[v]) swap(u, v);
            res.emplace_back(max(vid[head[v]], vid[u]), vid[v] + 1);
            if(head[u] != head[v]) v = par[head[v]];
            else break;
        }
        return res;
    }

    // パスu-vの辺属性クエリ 区間[l, r）を返す
    vector<pair<int, int>> for_each_edge(int u, int v){
        vector<pair<int, int>> res;
        while(1){
            if(vid[u] > vid[v]) swap(u, v);
            if(head[u] != head[v]){
                res.emplace_back(vid[head[v]], vid[v] + 1);
                v = par[head[v]];
            }
            else{
                if(u != v) res.emplace_back(vid[u] + 1, vid[v] + 1);
                break;
            }
        }
        return res;
    }

    // 頂点uの部分木に対する頂点属性クエリ 区間[l, r) を返す
    pair<int, int> subtree(int u){
        return {vid[u], vid[u] + sz[u]};
    }

    // 頂点uの部分木に対する辺属性クエリ 区間[l, r) を返す
    pair<int, int> subtree_edge(int u){
        return {vid[u] + 1, vid[u] + sz[u]};
    }

    int lca(int u, int v){
        while(1){
            if(vid[u] > vid[v]) swap(u, v);
            if(head[u] == head[v]) return u;
            v = par[head[v]];
        }
    }
};

struct S{
    int value;
    int size;
};
using F = long long;
const F ID = 0;

S op(S a, S b){ return {a.value ^ b.value, a.size + b.size}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){
    if(x.size & 1) x.value ^= f;
    return x;
}
F composition(F f, F g){ return f ^ g; }
F id(){ return ID; }

void solve(){
    int N, Q;
    cin >> N >> Q;
    vector<int> C(N);
    REP(i,N) cin >> C[i];

    HLD hld(N);
    REP(i,N-1){
        int u, v;
        cin >> u >> v;
        hld.add_edge(--u, --v);
    }
    hld.build();

    vector<S> v(N, {0, 1});
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
    REP(i,N){
        int id = hld.vid[i];
        seg.apply(id, id+1, C[i]);
    }
    while(Q--){
        int q;
        cin >> q;
        if(q == 1){
            int x, y;
            cin >> x >> y;
            --x;
            int id = hld.vid[x];
            seg.apply(id, id+1, y);
        }
        else{
            int x, y;
            cin >> x >> y;
            --x;
            auto [l, r] = hld.subtree(x);
            auto res = seg.prod(l, r);
            cout << res.value << endl;
        }
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    // int T; cin >> T; REP(t,T) solve();
}
yukicoder

結果

テストケース

ソースコード
