結果

問題 No.2341 Triple Tree Query (Medium)
コンテスト
ユーザー heno239
提出日時 2023-06-03 00:06:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 514 ms / 5,000 ms
コード長 12,900 bytes
コンパイル時間 3,588 ms
コンパイル使用メモリ 188,576 KB
最終ジャッジ日時 2025-02-13 21:40:45
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------


//双対セグ木
//区間更新1点取得に使える
//verified with https://codeforces.com/contest/1555/problem/F

template<typename T>
struct SegT {
private:
    int n;
    vector<T> node;
    T e;
    function<T(T, T)> f;
public:
    void init(int sz, T _e, function<T(T, T)> _f) {
        e = _e, f = _f;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, _e);
    }
    void eval(int k, int l, int r) {
        if (node[k] == e || l + 1 == r)return;
        node[2 * k + 1] = f(node[k], node[2 * k + 1]);
        node[2 * k + 2] = f(node[k], node[2 * k + 2]);
        node[k] = e;
    }
    void add(T x, int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)r = n;
        eval(k, l, r);
        if (r <= a || b <= l)return;
        if (a <= l && r <= b) {
            node[k] = f(x, node[k]);
            eval(k, l, r);
        }
        else {
            add(x, a, b, k * 2 + 1, l, (l + r) / 2);
            add(x, a, b, k * 2 + 2, (l + r) / 2, r);
        }
    }
    T query(int loc) {
        int k = 0, l = 0, r = n;
        while (r - l > 1) {
            eval(k, l, r);
            int m = (l + r) / 2;
            if (loc < m) {
                k = 2 * k + 1;
                r = m;
            }
            else {
                k = 2 * k + 2;
                l = m;
            }
        }
        return node[k];
    }
    void finupd(int loc) {
        node[loc + n - 1] = e;
    }
};

void solve() {
    int n, q; cin >> n >> q;
    vector<vector<int>> G(n);
    rep(i, n - 1) {
        int a, b; cin >> a >> b; a--; b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    vector<int> par(n);
    vector<int> nex(n);
    vector<int> sz(n);
    function<void(int, int)> initdfs = [&](int id, int fr) {
        par[id] = fr;
        nex[id] = -1;
        sz[id] = 1;
        int ma = -1;
        for (int to : G[id])if (to != fr) {
            initdfs(to, id);
            sz[id] += sz[to];
            if (ma < sz[to]) {
                nex[id] = to; ma = sz[to];
            }
        }
    };
    initdfs(0, -1);
    //coutarray(nex);
    vector<int> htrans(n, -1);
    vector<int> hl(n), hr(n);
    vector<int> hcr(n);
    vector<bool> isr(n);
    isr[0] = true;
    int tmp = 0;
    htrans[0] = tmp; tmp++;
    vector<int> dep;
    dep.push_back(0);
    function<void(int, int,int)> hldfs = [&](int id, int fr,int cd) {
        //cout << "?? " << id << " " << fr << "\n";
        hl[id] = tmp;
        for (int to : G[id])if (to != fr) {
            if (to == nex[id]) {
                //
            }
            else {
                dep.push_back(cd + 1);
                isr[to] = true;
                htrans[to] = tmp; tmp++;
            }
        }
        hcr[id] = tmp;
        if (nex[id] >= 0) {
            hldfs(nex[id], id,cd);
        }
        for (int to : G[id])if (to != fr) {
            if (to == nex[id]) {
                //
            }
            else {
                hldfs(to, id,cd+1);
            }
        }

        hr[id] = tmp;
    };
    hldfs(0, -1,0);
    //rep(i, n)cout << hl[i] << " " << hcr[i] <<" "<<hr[i]<< "\n";

    vector<vector<int>> mapto(tmp);
    vector<P> mapfrom(n);
    rep(i, n) {
        if (!isr[i])continue;
        vector<int> cur;
        int cop = i;
        int col = htrans[i];
        while (cop >= 0) {
            mapfrom[cop] = { col,cur.size() };
            cur.push_back(cop);
            cop = nex[cop];
        }
        mapto[col] = cur;
    }

    //coutarray(htrans);
    //coutarray(isr);
    auto f = [&](mP a, mP b) {
        mP res;
        res.first = a.first * b.first;
        res.second = b.second * a.first + a.second;
        return res;
    };
    vector<int> sx(n);
    rep(i, n) {
        cin >> sx[i];
    }
    vector<SegT<mP>> vh(tmp);
    rep(i, tmp) {
        vh[i].init(mapto[i].size(), { 1,0 }, f);
    }
    SegT<mP> stal;
    stal.init(tmp, { 1,0 }, f);
    SegT<mP> stalroot;
    stalroot.init(tmp, { 1,0 }, f);
    auto eval = [&](int loc) {
        mP vroot = stalroot.query(loc);
        vh[loc].add(vroot, 0, 1);
        mP val = stal.query(loc);
        vh[loc].add(val, 1, mapto[loc].size());
        stalroot.finupd(loc);
        stal.finupd(loc);
    };
    auto add1 = [&](int v, mP ad) {
        int id = mapfrom[v].first;
        int loc = mapfrom[v].second;
        eval(id);
        vh[id].add(ad, loc, loc + 1);
    };
    auto query1 = [&](int v) {
        int id = mapfrom[v].first;
        eval(id);
        int loc = mapfrom[v].second;
        mP p = vh[id].query(loc);
        modint res = (modint)sx[v] * p.first + p.second;
        return res;
    };
    auto query2 = [&](int v, mP ad) {
        add1(v, ad);
        if (par[v] >= 0)add1(par[v], ad);
        if (nex[v] >= 0)add1(nex[v], ad);
        stalroot.add(ad, hl[v], hcr[v]);
    };
    auto query3 = [&](int v, mP ad) {
        int id = mapfrom[v].first;
        eval(id);
        int loc = mapfrom[v].second;
        vh[id].add(ad, loc, mapto[id].size());
        stal.add(ad, hl[v], hr[v]);
        stalroot.add(ad, hl[v], hr[v]);
    };
    auto cdep = [&](int a) {
        return dep[mapfrom[a].first];
    };
    auto query4 = [&](int a,int b, mP ad) {
        if (cdep(a) > cdep(b))swap(a, b);
        using ar = array<int, 3>;
        vector<ar> mem;
        while (cdep(a) < cdep(b)) {
            int id = mapfrom[b].first;
            int loc = mapfrom[b].second;
            mem.push_back({ id,0,loc + 1 });
            b = par[mapto[id][0]];
        }
        while (mapfrom[a].first != mapfrom[b].first) {
            int id = mapfrom[b].first;
            int loc = mapfrom[b].second;
            mem.push_back({ id,0,loc + 1 });
            b = par[mapto[id][0]];
            id = mapfrom[a].first;
            loc = mapfrom[a].second;
            mem.push_back({ id,0,loc + 1 });
            a = par[mapto[id][0]];
        }
        int le = mapfrom[a].second;
        int ri = mapfrom[b].second;
        if (le > ri)swap(le, ri);
        mem.push_back({ mapfrom[a].first,le,ri + 1 });
        for (auto a : mem) {
            int id = a[0];
            eval(id);
            vh[id].add(ad, a[1], a[2]);
        }
    };
    rep(i, q) {
        int typ; cin >> typ;
        if (typ == 1) {
            int v; cin >> v; v--;
            cout << query1(v) << "\n";
        }
        else if (typ == 2) {
            int v; cin >> v; v--;
            int k, c, d; cin >> k >> c >> d;
            mP ad = { c,d };
            query2(v, ad);
        }
        else if (typ == 3) {
            int v; cin >> v; v--;
            int c, d; cin >> c >> d; mP ad = { c,d };
            query3(v, ad);
        }
        else if (typ == 4) {
            int a, b, c, d; cin >> a >> b >> c >> d; a--; b--;
            mP ad = { c,d };
            query4(a, b, ad);
        }
    }
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0