제출 #558473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
558473		DanShaders	Sprinkler (JOI22_sprinkler)	C++17	0 / 100	4082 ms	15608 KiB

sprinkler

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;

namespace x = __gnu_pbds;
template <typename T>
using ordered_set = x::tree<T, x::null_type, less<T>, x::rb_tree_tag, x::tree_order_statistics_node_update>;

template <typename T>
using normal_queue = priority_queue<T, vector<T>, greater<>>;

#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())
#define x first
#define y second
using ll = long long;
using ld = long double;

const int N = 2e5 + 10;

vector<int> g[N];
int h[N];

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, l;
	cin >> n >> l;
	for (int i = 1; i < n; ++i) {
		int u, v;
		cin >> u >> v;
		g[--u].push_back(--v);
		g[v].push_back(u);
	}
	for (int i = 0; i < n; ++i) {
		cin >> h[i];
	}
	int queries;
	cin >> queries;
	while (queries--) {
		int type;
		cin >> type;
		if (type == 1) {
			int x, d, w;
			cin >> x >> d >> w;
			--x;
			queue<tuple<int, int, int>> bfs;
			bfs.push({0, x, -1});
			while (sz(bfs)) {
				auto [cd, u, p] = bfs.front();
				bfs.pop();
				(h[u] *= w) %= l;
				if (cd == d) {
					continue;
				}
				for (int v : g[u]) {
					if (v != p) {
						bfs.push({cd + 1, v, u});
					}
				}
			}
		} else {
			int x;
			cin >> x;
			cout << h[x - 1] << "\n";
		}
	}
}

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