Submission #1185274

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185274		thelegendary08	Sprinkler (JOI22_sprinkler)	C++17	100 / 100	781 ms	93772 KiB

sprinkler

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;
vi adj[mxn];
vi par(mxn);
void dfs(int node, int from){
	par[node] = from;
	for(auto u : adj[node]){
		if(u != from)dfs(u, node);
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,mod);
	f0r(i,n-1){
		in2(a,b);
		a--; b--;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	dfs(0, -1);
	
	vin(v,n);
	in(q);
	
	vvi w(n, vi(41, 1));
	while(q--){
		in(t);
		if(t==1){
			in3(x,d,m);
			
			x--;
			while(d >= 0){
				if(x == -1)break;
				w[x][d] = w[x][d] * m % mod;
				if(d != 0)w[x][d-1] = w[x][d-1] * m % mod;
				if(x == 0){
					f0r(i, d-1)w[x][i] = w[x][i] * m % mod;
				}
				x = par[x];
				d--;
			}
			
		}
		else{
			in(x);
			x--;
			int cur = 0;
			int ans = v[x];
			while(x != -1 && cur <= 40){
				ans *= w[x][cur];
				ans %= mod;
				cur++;
				x = par[x];
			}
			out(ans);
		}
	}
	
}

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