Submission #998410

#TimeUsernameProblemLanguageResultExecution timeMemory
998410efishelSprinkler (JOI22_sprinkler)C++17
9 / 100
709 ms59732 KiB
//Emmanuel B //Sprinker #include <bits/stdc++.h> using namespace std; using lli=long long int; #define pb push_back #define deb(x) cout<<#x<<": "<<x<<endl; #define deb2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl; void dfs(lli n, lli par, vector<lli> &parent, vector<vector<lli>> &adj, vector<vector<lli>> &sons){ parent[n]=par; for(lli x: adj[n]){ if(x==par) continue; sons[n].pb(x); dfs(x,n,parent,adj,sons); } } lli L; void update(lli n, lli p, vector<vector<lli>> &adj, lli c, vector<lli> &values, lli &w){ if(c<0) return; values[n]*=w; values[n]%=L; if(c==0) return; for(lli x: adj[n]){ if(x==p) continue; update(x,n,adj,c-1, values, w); } } int main(){ lli N; cin>>N>>L; vector<vector<lli>> adj (N+5); for(lli i=0; i<N-1; ++i){ lli a,b; cin>>a>>b; adj[a].pb(b); adj[b].pb(a); } vector<lli> parent (N+5); vector<vector<lli>> sons (N+5); vector<lli> mult1 (N+5,1); vector<lli> mult2 (N+5,1); dfs(1,0,parent,adj,sons); vector<lli> values (N+5); for(lli i=1; i<=N; ++i){ cin>>values[i]; } lli Q; cin>>Q; while(Q--){ lli type; cin>>type; if(type==1){ lli x,d,w; cin>>x>>d>>w; if(d==0){ values[x]*=w; values[x]%=L; } else{ values[x]*=w; values[x]%=L; mult1[x]*=w; mult1[x]%=L; if(x!=1){ mult2[parent[x]]*=w; mult2[parent[x]]%=L; } } } else{ lli x; cin>>x; lli ans=values[x]*mult2[x]; ans%=L; if(x!=1){ ans*=mult1[parent[x]]; ans%=L; } cout<<ans<<endl; } } }
#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...