제출 #890632

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890632		MinaRagy06	Sprinkler (JOI22_sprinkler)	C++17	3 / 100	4059 ms	24572 KiB

sprinkler

#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 200'005;
vector<int> adj[N];
int mod;
int a[N];
void dfs(int i, int mx, int w, int d = 0, int par = 0) {
	a[i] = 1ll * a[i] * w % mod;
	for (auto nxt : adj[i]) {
		if (nxt == par || d + 1 > mx) continue;
		dfs(nxt, mx, w, d + 1, i);
	}
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n;
	cin >> n >> mod;
	for (int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int m;
	cin >> m;
	while (m--) {
		int t;
		cin >> t;
		if (t == 1) {
			int x, d, w;
			cin >> x >> d >> w;
			dfs(x, d, w);
		} else {
			int x;
			cin >> x;
			cout << a[x] << '\n';
		}
	}
	return 0;
}

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