제출 #1177661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177661		thelegendary08	Sprinkler (JOI22_sprinkler)	C++17	9 / 100	259 ms	28040 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 pout(a) cout<<a.first<<' '<<a.second<<'\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';}
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);
	// f0r(i,n)cout<<par[i]<<' ';
	// cout<<'\n';z
	vin(h, n);
	vi a(n, 1);
	vi b(n, 1);
	vi c(n,1);
	f0r(i,n){
		a[i] = h[i];
	}
	in(q);
	while(q--){
		in(t);
		if(t == 1){
			in3(x,d,w);
			x--;
			a[x] *= w;
			a[x] %= mod;
			if(d==1){
				c[x] *= w;
				c[x] %= mod;
			}
			if(d == 1 && x != 0){
				b[par[x]] *= w;
				b[par[x]] %= mod;
			}
			// vout(a);
			// vout(b);
		}
		else{
			in(x);
			x--;
			int ans = b[x] * a[x] % mod;
			if(x != 0){
				ans *= c[par[x]];
				ans %= mod;
			}
			out(ans);
		}
		
	}
}

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