Submission #998419

#TimeUsernameProblemLanguageResultExecution timeMemory
998419efishelSprinkler (JOI22_sprinkler)C++17
3 / 100
4090 ms25544 KiB
//Logan/Sprinkler
#include<bits/stdc++.h>
using namespace std;

#define nl '\n'

int N,L,Q,t,a,b;
long long h[200005];
vector<int>ad[200005];

void dfs(int u,int p,int d,int w){
    h[u]=(h[u]*w)%L;
    if(0<d)for(auto v:ad[u])if(v!=p){
        dfs(v,u,d-1,w);
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>N>>L;
    for(int i=1;i<N;i++){
        cin>>a>>b;
        ad[a].push_back(b);
        ad[b].push_back(a);
    }
    for(int i=1;i<=N;i++)cin>>h[i];
    cin>>Q;
    for(int i=0;i<Q;i++){
        cin>>t;
        if(t==1){
            cin>>t>>a>>b;
            dfs(t,-1,a,b);
        }else{
            cin>>t;
            cout<<h[t]<<nl;
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...