제출 #1266481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266481		Tymond	Sprinkler (JOI22_sprinkler)	C++20	100 / 100	590 ms	98372 KiB

sprinkler

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 2e5 + 7;
const int MAXD = 50;
ll A[MAXN][MAXD];
vi g[MAXN];
int parent[MAXN];
int n;
ll L;

void dfs(int v, int p){
    parent[v] = p;
    for(auto u : g[v]){
        if(u != p){
            dfs(u, v);
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> L;
    for(int i = 1; i < n; i++){
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }

    dfs(1, 0);
    for(int i = 1; i <= n; i++){
        cin >> A[i][0];
        for(int j = 1; j < MAXD; j++){
            A[i][j] = 1LL;
        }
    }

    int Q;
    cin >> Q;
    while(Q--){
        int type;
        cin >> type;
        if(type == 1){
            int i, d;
            ll w;
            cin >> i >> d >> w;
            
            while(d + 1 > 0){
                A[i][d] = (ll)A[i][d] * w % L;
                if(d - 1 >= 0){
                    A[i][d - 1] = (ll)A[i][d - 1] * w % L;
                }

                if(parent[i]){
                    d--;
                    i = parent[i];
                }else{
                    d -= 2;
                }
            }
        }else{
            ll ans = 1LL;
            int x;
            cin >> x;

            for(int j = 0; j < MAXD; j++){
                ans = (ll)ans * A[x][j] % L;
                if(!parent[x]){
                    break;
                }
                x = parent[x];
            }

            cout << ans << '\n';
        }
    }

    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 9 / 9
• Subtask 3: 29 / 29
• Subtask 4: 12 / 12
• Subtask 5: 30 / 30
• Subtask 6: 17 / 17