結果

問題 No.2340 Triple Tree Query (Easy)
ユーザー heno239heno239
提出日時 2023-06-02 23:28:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 313 ms / 5,000 ms
コード長 12,422 bytes
コンパイル時間 3,001 ms
コンパイル使用メモリ 175,596 KB
実行使用メモリ 32,072 KB
最終ジャッジ日時 2024-06-09 01:36:19
合計ジャッジ時間 13,307 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
11,848 KB
testcase_01 AC 11 ms
11,976 KB
testcase_02 AC 11 ms
11,976 KB
testcase_03 AC 11 ms
11,976 KB
testcase_04 AC 11 ms
12,104 KB
testcase_05 AC 12 ms
11,976 KB
testcase_06 AC 220 ms
22,856 KB
testcase_07 AC 227 ms
22,984 KB
testcase_08 AC 215 ms
22,860 KB
testcase_09 AC 225 ms
22,984 KB
testcase_10 AC 218 ms
22,856 KB
testcase_11 AC 202 ms
22,904 KB
testcase_12 AC 214 ms
22,860 KB
testcase_13 AC 224 ms
22,984 KB
testcase_14 AC 227 ms
22,852 KB
testcase_15 AC 237 ms
22,988 KB
testcase_16 AC 313 ms
32,072 KB
testcase_17 AC 290 ms
29,128 KB
testcase_18 AC 299 ms
28,356 KB
testcase_19 AC 303 ms
31,172 KB
testcase_20 AC 288 ms
28,176 KB
testcase_21 AC 180 ms
23,188 KB
testcase_22 AC 187 ms
23,056 KB
testcase_23 AC 180 ms
23,188 KB
testcase_24 AC 272 ms
23,244 KB
testcase_25 AC 262 ms
22,892 KB
testcase_26 AC 263 ms
22,984 KB
testcase_27 AC 265 ms
23,072 KB
testcase_28 AC 267 ms
22,984 KB
testcase_29 AC 188 ms
23,212 KB
testcase_30 AC 189 ms
23,216 KB
testcase_31 AC 191 ms
23,088 KB
testcase_32 AC 234 ms
22,984 KB
testcase_33 AC 239 ms
22,984 KB
testcase_34 AC 212 ms
23,108 KB
testcase_35 AC 229 ms
23,112 KB
testcase_36 AC 230 ms
23,108 KB
権限があれば一括ダウンロードができます

ソースコード

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

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


#define ftt function<T(T,T)>
#define ftu function<T(T,U,int,int)>
#define fuu function<U(U,U)>

template<typename T, typename U>
struct SegT {
private:
    int n;
    vector<T> node;
    vector<U> lazy;
    T et; U eu;
    ftt f;
    ftu g;
    fuu h;
public:
    SegT(vector<T> ori, T _et, U _eu, ftt _f, ftu _g, fuu _h) {
        int sz = ori.size();
        et = _et, eu = _eu; f = _f, g = _g, h = _h;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, et);
        lazy.resize(2 * n - 1, eu);
        rep(i, sz) {
            node[i + n - 1] = ori[i];
        }
        per(i, n - 1) {
            node[i] = f(node[2 * i + 1], node[2 * i + 2]);
        }
    }
    SegT(int sz, T _et, U _eu, ftt _f, ftu _g, fuu _h) {
        et = _et, eu = _eu; f = _f, g = _g, h = _h;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, et);
        lazy.resize(2 * n - 1, eu);
    }
    void eval(int k, int l, int r) {
        if (lazy[k] == eu)return;
        node[k] = g(node[k], lazy[k], l, r);
        if (r - l > 1) {
            lazy[2 * k + 1] = h(lazy[k], lazy[2 * k + 1]);
            lazy[2 * k + 2] = h(lazy[k], lazy[2 * k + 2]);
        }
        lazy[k] = eu;
    }
    void add(U 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) {
            lazy[k] = h(x, lazy[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);
            node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
        }
    }
    T query(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 et;
        if (a <= l && r <= b)return node[k];
        else {
            T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
            T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
            return f(vl, vr);
        }
    }
    void update(int loc, T x) {
        int k = 0, l = 0, r = n;
        stack<P> st;
        while (k < n - 1) {
            eval(k, l, r);
            st.push({ l,r });
            if (loc < (l + r) / 2) {
                k = 2 * k + 1;
                r = (l + r) / 2;
            }
            else {
                k = 2 * k + 2;
                l = (l + r) / 2;
            }
        }
        eval(k, l, r);
        st.push({ l,r });
        node[k] = x;
        while (k > 0) {
            k = (k - 1) / 2;
            st.pop();
            l = st.top().first, r = st.top().second;
            eval(2 * k + 1, l, (l + r) / 2);
            eval(2 * k + 2, (l + r) / 2, r);
            node[k] = f(node[2 * k + 1], node[2 * k + 2]);
        }
    }
    //k以上でf(x,node[y+sz-1])をtrueにするような最小のy
    int searchloc(int le, T x, function<bool(T, T)> comp) {
        int k = 0, l = 0, r = n;
        while (k < n - 1) {
            eval(k, l, r);
            int m = (l + r) / 2;
            if (le < m) {
                k = 2 * k + 1; r = m;
            }
            else {
                k = 2 * k + 2; l = m;
            }
        }
        assert(k == le + n - 1);
        eval(k, l, r);
        if (comp(x, node[k]))return le;
        //x=f(x,node[k]);
        while (k > 0) {
            int mem = k;
            k = (k - 1) / 2;
            if (2 * k + 1 == mem) {
                r += r - l;
            }
            else {
                l -= r - l;
            }
            if (2 * k + 1 == mem) {
                eval(2 * k + 2, (l + r) / 2, r);
                if (comp(x, node[2 * k + 2])) {
                    k = 2 * k + 2;
                    l = (l + r) / 2;
                    break;
                }
                //x=f(x,node[2*k+2]);
            }
        }
        if (k == 0)return n;
        while (k < n - 1) {
            eval(2 * k + 1, l, (l + r) / 2);
            eval(2 * k + 2, (l + r) / 2, r);
            if (comp(x, node[2 * k + 1])) {
                k = 2 * k + 1;
                r = (l + r) / 2;
            }
            else {
                k = 2 * k + 2;
                l = (l + r) / 2;
                //x=f(x,node[2*k+1]);
            }
        }
        return k - (n - 1);
    }
};


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> trans(n);
    vector<int> le(n);
    vector<int> ri(n);
    vector<int> cr(n);
    int tmp = 0;
    trans[0] = 0; tmp++;
    function<void(int, int)> initdfs = [&](int id, int fr) {
        par[id] = fr;
        le[id] = tmp;
        for (int to : G[id])if (to != fr) {
            trans[to] = tmp; tmp++;
        }
        cr[id] = tmp;
        for (int to : G[id])if (to != fr) {
            initdfs(to, id);
        }
        ri[id] = tmp;
    };
    initdfs(0, -1);

    auto f = [&](modint a, modint b) {
        return a + b;
    };
    auto g = [&](modint a, mP b, int l, int r) {
        a = a * b.first + b.second;
        return a;
    };
    auto h = [&](mP a, mP b) {
        mP res;
        res.first = a.first * b.first;
        res.second = b.second * a.first + a.second;
        return res;
    };
    vector<modint> ori(n);
    rep(i, n) {
        int x; cin >> x; ori[trans[i]] = x;
    }
    SegT<modint, mP> st(ori, 0, { 1,0 }, f, g, h);
    auto add1 = [&](int v, mP ad) {
        st.add(ad, trans[v], trans[v] + 1);
    };
    auto query1 = [&](int v) {
        modint res = st.query(trans[v], trans[v] + 1);
        return res;
    };
    auto query2 = [&](int v, mP ad) {
        add1(v, ad);
        if (par[v] >= 0)add1(par[v], ad);
        st.add(ad, le[v], cr[v]);
    };
    auto query3 = [&](int v, mP ad) {
        add1(v, ad);
        st.add(ad, le[v], ri[v]);
    };
    rep(i, q) {
        int typ; cin >> typ;
        int v; cin >> v; v--;
        if (typ == 1) {
            cout << query1(v) << "\n";
        }
        else if (typ == 2) {
            int k, c, d; cin >> k >> c >> d;
            mP ad = { c,d };
            query2(v, ad);
        }
        else if (typ == 3) {
            int c, d; cin >> c >> d; mP ad = { c,d };
            query3(v, 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