제출 #568222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
568222		zaneyu	Sprinkler (JOI22_sprinkler)	C++14	100 / 100	1550 ms	105860 KiB

sprinkler

/*input
4 7
1 2
2 3
3 4
1
1
1
1
11
1 2 1 2
1 1 0 2
2 1
2 2
2 3
2 4
1 4 10 2
2 1
2 2
2 3
2 4
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
 int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
vector<int> v[maxn];
int par[maxn];
void dfs(int u,int p){
    par[u]=p;
    for(int x:v[u]){
        if(x==p) continue;
        dfs(x,u);
    }
}
ll upd[maxn][45];
int main(){
    int n;
    cin>>n>>MOD;
    REP(i,n-1){
        int a,b;
        cin>>a>>b;
        --a,--b;
        v[a].pb(b),v[b].pb(a);
    }
    dfs(0,-1);
    REP(i,n) REP(j,45) upd[i][j]=1;
    REP(i,n) cin>>upd[i][0];
    int q;
    cin>>q;
    while(q--){
        int t;
        cin>>t;
        if(t==1){
            int u,d,x;
            cin>>u>>d>>x;
            --u;
            while(par[u]!=-1 and d){
                upd[u][d]*=x;
                upd[u][d-1]*=x;
                upd[u][d]%=MOD,upd[u][d-1]%=MOD;
                u=par[u];
                --d;
            }
            REP(i,d+1) upd[u][i]*=x,upd[u][i]%=MOD;
        }
        else{
            int u;
            cin>>u;
            --u;
            ll ans=1;
            int d=0;
            while(u!=-1 and d<=40){
                ans*=upd[u][d];
                ans%=MOD;
                u=par[u];
                ++d;
            }
            cout<<ans<<'\n';
        }
    }
} 

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