제출 #550790

#제출 시각아이디문제언어결과실행 시간메모리
550790inksamuraiSprinkler (JOI22_sprinkler)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> #define int ll using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define rng(i,x,n) for(int i=x;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3xxEYjy ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e int mod; //snuke's mod int // template <ll mod> struct modint{ ll x; // typedef long long ll; modint(ll x=0):x((x%mod+mod)%mod){} modint operator-()const{return modint(-x);} modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;} modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;} modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;} modint operator+(const modint a)const{modint res(*this); return res+=a;} modint operator-(const modint a)const{modint res(*this); return res-=a;} modint operator*(const modint a)const{modint res(*this); return res*=a;} modint pow(ll n)const{ modint res=1,x(*this); while(n){ if(n&1)res*=x; x*=x; n>>=1; } return res; } modint inv()const{return pow(mod-2);} }; signed main(){ _3xxEYjy; int n; cin>>n>>mod; vec(vi) adj(n); rep(i,n-1){ int u,v; cin>>u>>v; u-=1;v-=1; adj[u].pb(v); adj[v].pb(u); } vi a(n); rep(i,n){ cin>>a[i]; } vi par; { rep(i,50){ adj.pb({}); if(i==0){ adj[n].pb(0); adj[0].pb(n); }else{ adj[n-1].pb(n); adj[n].pb(n-1); } n+=1; } par=vi(n,-1); auto dfs=[&](auto self,int v,int _par)->void{ for(auto u:adj[v]){ if(u==_par) continue; par[u]=v; self(self,u,v); } };dfs(dfs,n-1,-1); while(sz(a)<n){ a.pb(0); } } using mint=modint; vec(vec(mint)) dp(n,vec(mint)(50,1)); auto add=[&](int v,int d,int x){ if(d==0){ a[v]*=x%mod; a[v]%=mod; return; } while(1){ if(v==-1) break; // print(v); if(d==0){ a[v]*=x; a[v]%=mod; break; } dp[v][d]*=mint(x); d-=1; v=par[v]; } }; auto get=[&](int v)->mint{ int d=0; mint res=1; while(d<50){ res*=dp[v][d]; res*=dp[v][d+1]; v=par[v]; if(v==-1) break; d+=1; } return res; }; int q; cin>>q; rep(_,q){ int t,v,x,d; cin>>t; if(t==1){ cin>>v>>d>>x; v-=1; add(v,d,x); }else{ cin>>v; v-=1; mint res=get(v); res*=mint(a[v]); print(res.x); } } // 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...