Submission #966645

#TimeUsernameProblemLanguageResultExecution timeMemory
966645PM1Sprinkler (JOI22_sprinkler)C++17
41 / 100
4054 ms74960 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int mxn=2e5+5,sq=448; int n,M,q,h[mxn],st[mxn],fn[mxn],cnt,dis[mxn],par[mxn]; vector<ll>v[mxn],d[mxn],res[mxn],lazy[mxn]; void dfs(int z){ st[z]=++cnt; d[dis[z]].push_back(st[z]); res[dis[z]].push_back(h[z]); for(auto i:v[z]){ if(i!=par[z]){ par[i]=z; dis[i]=dis[z]+1; dfs(i); } } fn[z]=cnt; } void add(int x,int L,int R,ll w){ if(d[x].size()==0)return; int l=lower_bound(d[x].begin(),d[x].end(),L)-d[x].begin(); int r=upper_bound(d[x].begin(),d[x].end(),R)-d[x].begin()-1; r=min((int)d[x].size()-1,r); for(;l<=r && l%sq!=0;l++) res[x][l]=(res[x][l]*w)%M; for(;l+sq-1<=r;l+=sq) lazy[x][l/sq]=(lazy[x][l/sq]*w)%M; for(;l<=r;l++) res[x][l]=(res[x][l]*w)%M; } void up(int x,int dd,int w){ for(;dd>=1 && x!=1;dd--){ int z=dis[x]+dd,zz=dis[x]+dd-1; add(z,st[x],fn[x],w); add(zz,st[x],fn[x],w); x=par[x]; } for(;dd>=0;dd--){ add(dis[x]+dd,st[x],fn[x],w); } } ll get(int z,int x){ int l=lower_bound(d[z].begin(),d[z].end(),st[x])-d[z].begin(); return (res[z][l]*lazy[z][l/sq])%M; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>M; for(int i=1;i<n;i++){ int x,y; cin>>x>>y; v[x].push_back(y); v[y].push_back(x); } for(int i=1;i<=n;i++) cin>>h[i]; dfs(1); for(int i=0;i<=n;i++){ int x=d[i].size(); while(x>0){ x-=sq; lazy[i].push_back(1); } } cin>>q; while(q--){ int ty,x,dd,w; cin>>ty; if(ty==1){ cin>>x>>dd>>w; up(x,dd,w); } else{ cin>>x; cout<<get(dis[x],x)<<'\n'; } } 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...