oj.uz

Submission #561258

# Submission time Handle Problem Language Result Execution time Memory
561258 2022-05-12T14:23:26 Z DanShaders Sprinkler (JOI22_sprinkler) C++17
12 / 100
 4000 ms 113796 KB 
//bs:sanitizers
#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, EULER = 2 * N, LOG = 19;

int n, modulo;

vector<int> g[N];
int ipow[EULER], depth[N];
pair<int, int> sp[LOG][EULER];
int order[N], timer = 0, parent[N];

void dfs_euler(int u, int d = 0, int p = -1) {
	order[u] = timer;
	parent[u] = p;
	depth[u] = d;
	sp[0][timer++] = {d, u};
	for (int v : g[u]) {
		if (v != p) {
			dfs_euler(v, d + 1, u);
			sp[0][timer++] = {d, u};
		}
	}
}

int lca(int u, int v) {
	if (u == v) {
		return u;
	}
	u = order[u];
	v = order[v];
	if (u > v) {
		swap(u, v);
	}
	++v;
	int pw = ipow[v - u];
	return min(sp[pw][u], sp[pw][v - (1 << pw)]).y;
}

int dist(int u, int v) {
	return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}

vector<int> layer[N];
pair<int, int> inv[N];
int layer_start[N];
int lnk[N];

ll t[2 * N];

int get(int u) {
	auto [x, y] = inv[u];
	return layer_start[x] + y;
}

void upd(int l, int r, int w) {
	l += n;
	r += n;
	while (l <= r) {
		if (l & 1)	(t[l] *= w) %= modulo;
		if (!(r & 1))	(t[r] *= w) %= modulo;
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> modulo;
	fill(t, t + 2 * n, 1);
	for (int i = 1; i < n; ++i) {
		int u, v;
		cin >> u >> v;
		g[--u].push_back(--v);
		g[v].push_back(u);
	}
	
	dfs_euler(0);
	for (int i = 1; i < LOG; ++i) {
		for (int j = 0; j <= timer - (1 << i); ++j) {
			sp[i][j] = min(sp[i - 1][j], sp[i - 1][j + (1 << (i - 1))]);
		}
	}
	for (int i = 2; i <= timer; ++i) {
		ipow[i] = ipow[i / 2] + 1;
	}

	queue<tuple<int, int, int>> bfs;
	bfs.push({0, -1, 0});
	layer[0].push_back(0);
	while (sz(bfs)) {
		auto [u, p, dst] = bfs.front();
		bfs.pop();
		lnk[u] = sz(layer[dst + 1]);
		for (int v : g[u]) {
			if (v != p) {
				bfs.push({v, u, dst + 1});
				inv[v] = {dst + 1, sz(layer[dst + 1])};
				layer[dst + 1].push_back(v);
			}
		}
	}
	for (int i = 1; i < N; ++i) {
		layer_start[i] = layer_start[i - 1] + sz(layer[i - 1]);
	}

	for (int i = 0; i < n; ++i) {
		int x;
		cin >> x;
		t[get(i) + n] = x;
	}

	int queries;
	cin >> queries;
	while (queries--) {
		int type;
		cin >> type;
		if (type == 1) {
			int x, d, w;
			cin >> x >> d >> w;
			--x;

			auto upd_with_base = [&](int where, int index) {
				int lef = -1, rig = index;
				while (rig - lef > 1) {
					int mid = (lef + rig) / 2;
					if (dist(layer[where][mid], x) <= d) {
						rig = mid;
					} else {
						lef = mid;
					}
				}
				bool flag = (rig != index);
				upd(layer_start[where] + rig, layer_start[where] + index - 1, w);
			
				lef = index - 1, rig = sz(layer[where]);
				while (rig - lef > 1) {
					int mid = (lef + rig) / 2;
					if (dist(layer[where][mid], x) <= d) {
						lef = mid;
					} else {
						rig = mid;
					}
				}
				flag |= index - 1 != lef;
				upd(layer_start[where] + index, layer_start[where] + lef, w);
				return flag;
			};

			for (int u = parent[x]; u != -1; u = parent[u]) {
				if (!upd_with_base(inv[u].x, inv[u].y)) {
					break;
				}
			}
			int where = inv[x].x, index = inv[x].y;
			while (1) {
				// cout << where << " " << index << endl;
				// cout << layer[where][index] << endl;
				if (!upd_with_base(where, index)) {
					break;
				}
				if (index == sz(layer[where])) {
					++where;
					index = sz(layer[where]);
				} else {
					index = lnk[layer[where][index]];
					++where;
				}
			}
		} else {
			int x;
			cin >> x;
			int i = get(x - 1) + n;
			ll res = 1;
			while (i) {
				(res *= t[i]) %= modulo;
				i /= 2;
			}
			cout << res << "\n";
		}
		// for (int j = 0; j < n; ++j) {
		// 	int i = get(j) + n;
		// 	ll res = 1;
		// 	while (i) {
		// 		(res *= t[i]) %= modulo;
		// 		i /= 2;
		// 	}
		// 	cout << res << " ";
		// }
		// cout << endl;
	}
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 6 ms 10452 KB Output is correct
3 Correct 5 ms 10452 KB Output is correct
4 Correct 8 ms 10836 KB Output is correct
5 Correct 10 ms 10912 KB Output is correct
6 Correct 10 ms 10900 KB Output is correct
7 Correct 8 ms 10836 KB Output is correct
8 Correct 7 ms 10900 KB Output is correct
9 Correct 6 ms 10452 KB Output is correct
10 Correct 7 ms 10580 KB Output is correct
11 Correct 6 ms 10580 KB Output is correct
12 Correct 6 ms 10504 KB Output is correct
13 Correct 6 ms 10484 KB Output is correct
14 Correct 6 ms 10580 KB Output is correct
15 Correct 6 ms 10580 KB Output is correct
16 Correct 6 ms 10580 KB Output is correct
17 Correct 6 ms 10580 KB Output is correct
18 Correct 7 ms 10580 KB Output is correct
19 Correct 6 ms 10452 KB Output is correct
20 Correct 6 ms 10472 KB Output is correct
21 Correct 7 ms 10580 KB Output is correct
22 Correct 6 ms 10580 KB Output is correct
23 Correct 6 ms 10500 KB Output is correct
24 Correct 6 ms 10452 KB Output is correct
25 Correct 6 ms 10580 KB Output is correct
26 Correct 6 ms 10528 KB Output is correct
27 Correct 7 ms 10580 KB Output is correct
28 Correct 6 ms 10580 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 680 ms 86420 KB Output is correct
3 Correct 3103 ms 84212 KB Output is correct
4 Correct 573 ms 98512 KB Output is correct
5 Correct 1668 ms 85824 KB Output is correct
6 Correct 3103 ms 85708 KB Output is correct
7 Correct 3187 ms 86180 KB Output is correct
8 Correct 1479 ms 88444 KB Output is correct
9 Correct 450 ms 107292 KB Output is correct
10 Correct 659 ms 102404 KB Output is correct
11 Correct 697 ms 87232 KB Output is correct
12 Correct 2869 ms 84256 KB Output is correct
13 Correct 1012 ms 86664 KB Output is correct
14 Correct 1670 ms 85820 KB Output is correct
15 Correct 2363 ms 85184 KB Output is correct
16 Correct 2975 ms 84936 KB Output is correct
17 Correct 3425 ms 85368 KB Output is correct
18 Correct 7 ms 10524 KB Output is correct
19 Correct 8 ms 10580 KB Output is correct
20 Correct 7 ms 10508 KB Output is correct
21 Correct 7 ms 10580 KB Output is correct
22 Correct 6 ms 10504 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 680 ms 86420 KB Output is correct
3 Correct 3103 ms 84212 KB Output is correct
4 Correct 573 ms 98512 KB Output is correct
5 Correct 1668 ms 85824 KB Output is correct
6 Correct 3103 ms 85708 KB Output is correct
7 Correct 3187 ms 86180 KB Output is correct
8 Correct 1479 ms 88444 KB Output is correct
9 Correct 450 ms 107292 KB Output is correct
10 Correct 659 ms 102404 KB Output is correct
11 Correct 697 ms 87232 KB Output is correct
12 Correct 2869 ms 84256 KB Output is correct
13 Correct 1012 ms 86664 KB Output is correct
14 Correct 1670 ms 85820 KB Output is correct
15 Correct 2363 ms 85184 KB Output is correct
16 Correct 2975 ms 84936 KB Output is correct
17 Correct 3425 ms 85368 KB Output is correct
18 Correct 7 ms 10524 KB Output is correct
19 Correct 8 ms 10580 KB Output is correct
20 Correct 7 ms 10508 KB Output is correct
21 Correct 7 ms 10580 KB Output is correct
22 Correct 6 ms 10504 KB Output is correct
23 Correct 6 ms 10452 KB Output is correct
24 Correct 827 ms 87276 KB Output is correct
25 Correct 3710 ms 93764 KB Output is correct
26 Correct 632 ms 113796 KB Output is correct
27 Correct 1825 ms 94076 KB Output is correct
28 Correct 3498 ms 94540 KB Output is correct
29 Correct 3696 ms 94820 KB Output is correct
30 Correct 1496 ms 96928 KB Output is correct
31 Correct 497 ms 107676 KB Output is correct
32 Correct 775 ms 112332 KB Output is correct
33 Correct 842 ms 94316 KB Output is correct
34 Execution timed out 4026 ms 94212 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 873 ms 103436 KB Output is correct
3 Execution timed out 4056 ms 100400 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 898 ms 99052 KB Output is correct
3 Execution timed out 4045 ms 95680 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 6 ms 10452 KB Output is correct
3 Correct 5 ms 10452 KB Output is correct
4 Correct 8 ms 10836 KB Output is correct
5 Correct 10 ms 10912 KB Output is correct
6 Correct 10 ms 10900 KB Output is correct
7 Correct 8 ms 10836 KB Output is correct
8 Correct 7 ms 10900 KB Output is correct
9 Correct 6 ms 10452 KB Output is correct
10 Correct 7 ms 10580 KB Output is correct
11 Correct 6 ms 10580 KB Output is correct
12 Correct 6 ms 10504 KB Output is correct
13 Correct 6 ms 10484 KB Output is correct
14 Correct 6 ms 10580 KB Output is correct
15 Correct 6 ms 10580 KB Output is correct
16 Correct 6 ms 10580 KB Output is correct
17 Correct 6 ms 10580 KB Output is correct
18 Correct 7 ms 10580 KB Output is correct
19 Correct 6 ms 10452 KB Output is correct
20 Correct 6 ms 10472 KB Output is correct
21 Correct 7 ms 10580 KB Output is correct
22 Correct 6 ms 10580 KB Output is correct
23 Correct 6 ms 10500 KB Output is correct
24 Correct 6 ms 10452 KB Output is correct
25 Correct 6 ms 10580 KB Output is correct
26 Correct 6 ms 10528 KB Output is correct
27 Correct 7 ms 10580 KB Output is correct
28 Correct 6 ms 10580 KB Output is correct
29 Correct 5 ms 10452 KB Output is correct
30 Correct 680 ms 86420 KB Output is correct
31 Correct 3103 ms 84212 KB Output is correct
32 Correct 573 ms 98512 KB Output is correct
33 Correct 1668 ms 85824 KB Output is correct
34 Correct 3103 ms 85708 KB Output is correct
35 Correct 3187 ms 86180 KB Output is correct
36 Correct 1479 ms 88444 KB Output is correct
37 Correct 450 ms 107292 KB Output is correct
38 Correct 659 ms 102404 KB Output is correct
39 Correct 697 ms 87232 KB Output is correct
40 Correct 2869 ms 84256 KB Output is correct
41 Correct 1012 ms 86664 KB Output is correct
42 Correct 1670 ms 85820 KB Output is correct
43 Correct 2363 ms 85184 KB Output is correct
44 Correct 2975 ms 84936 KB Output is correct
45 Correct 3425 ms 85368 KB Output is correct
46 Correct 7 ms 10524 KB Output is correct
47 Correct 8 ms 10580 KB Output is correct
48 Correct 7 ms 10508 KB Output is correct
49 Correct 7 ms 10580 KB Output is correct
50 Correct 6 ms 10504 KB Output is correct
51 Correct 6 ms 10452 KB Output is correct
52 Correct 827 ms 87276 KB Output is correct
53 Correct 3710 ms 93764 KB Output is correct
54 Correct 632 ms 113796 KB Output is correct
55 Correct 1825 ms 94076 KB Output is correct
56 Correct 3498 ms 94540 KB Output is correct
57 Correct 3696 ms 94820 KB Output is correct
58 Correct 1496 ms 96928 KB Output is correct
59 Correct 497 ms 107676 KB Output is correct
60 Correct 775 ms 112332 KB Output is correct
61 Correct 842 ms 94316 KB Output is correct
62 Execution timed out 4026 ms 94212 KB Time limit exceeded
63 Halted 0 ms 0 KB -