oj.uz

Submission #558515

# Submission time Handle Problem Language Result Execution time Memory
558515 2022-05-07T13:37:56 Z savacska Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 111904 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
const int MAXD = 40;
const int MAXN = 200000;
int MOD = 0;
 
vector <int> g[MAXN + 5];
int height[MAXN + 5], position[MAXN + 5], parent[MAXN + 5], start_height[MAXN + 5], rows[MAXN + 5];
pair <int, int> subtree[MAXD + 5][MAXN + 5];
vector <int> tree[MAXN + 5];
 
void dfs(int v, int pr, int hei)
{
	parent[v] = pr;
	height[v] = hei;
	position[v] = rows[hei];
	rows[hei]++;
 
	int pos = -1;
	for (int i = 0; i < (int) g[v].size(); i++)
		if (g[v][i] == pr) pos = i;
	if (pos != -1)
	{
	 	swap(g[v][pos], g[v].back());
	 	g[v].pop_back();
	}
 
	for (int u : g[v])
		dfs(u, v, hei + 1);
 
	subtree[0][v] = mp(position[v], position[v]);
	if (!g[v].empty())
	{
	 	subtree[1][v] = mp(position[g[v][0]], position[g[v].back()]);
	 	int lef = 0, rig = (int) g[v].size() - 1;
	 	for (int i = 2; i <= MAXD; i++)
	 	{
	 	 	while (lef <= rig && subtree[i - 1][g[v][lef]] == mp(-1, -1)) lef++;
	 	 	while (lef <= rig && subtree[i - 1][g[v][rig]] == mp(-1, -1)) rig--;
	 	 	if (lef <= rig) subtree[i][v] = mp(subtree[i - 1][g[v][lef]].x, subtree[i - 1][g[v][rig]].y);
	 	 	else break;
	 	}
	}
	return;
}
 
int get_height(vector <int> &tree, int v, int lef, int rig, int pos, int cur_val)
{
 	if (tree[v] != 1) cur_val = (ll) cur_val * (ll) tree[v] % (ll) MOD;
 	if (lef == rig) return cur_val;
 	int mid = (lef + rig) / 2;
 	if (pos <= mid) return get_height(tree, 2 * v, lef, mid, pos, cur_val);
 	else return get_height(tree, 2 * v + 1, mid + 1, rig, pos, cur_val);
}
 
void update(vector <int> &tree, int v, int lef, int rig, int A, int B, int mn)
{
 	if (lef > B || rig < A) return;
 	if (A <= lef && rig <= B)
 	{
 	 	tree[v] = (ll) tree[v] * (ll) mn % (ll) MOD;
 	 	return;
 	}
 	int mid = (lef + rig) / 2;
 	if (tree[v] != 1)
 	{
 	 	tree[2 * v] = (ll) tree[2 * v] * (ll) tree[v] % (ll) MOD;
 	 	tree[2 * v + 1] = (ll) tree[2 * v + 1] * (ll) tree[v] % (ll) MOD;
 	 	tree[v] = 1;
 	}
 	update(tree, 2 * v, lef, mid, A, B, mn);
 	update(tree, 2 * v + 1, mid + 1, rig, A, B, mn);
 	return;
}
 
int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);
 	
 	int n, mod;
 	cin >> n >> mod;
 	MOD = mod;
 	
 	for (int i = 0; i <= MAXD; i++)
 		for (int j = 1; j <= n; j++)
 			subtree[i][j] = mp(-1, -1);
 
 	for (int i = 1; i < n; i++)
 	{
 	 	int u, v;
 	 	cin >> u >> v;
 	 	g[u].pb(v), g[v].pb(u);
 	}
 
 	for (int i = 1; i <= n; i++) cin >> start_height[i];
 
 	dfs(1, -1, 0);
 	
 	{
 	 	int h = 0;
 	 	while (rows[h] > 0)
 	 	{
 	 	 	tree[h].resize(4 * rows[h], 1);
 	 	 	h++;
 	 	}
 	}
 	
 	int quer;
 	cin >> quer;
 	
 	for (int rep = 1; rep <= quer; rep++)
 	{
 	 	int typ;
 	 	cin >> typ;
 	 	if (typ == 1)
 	 	{
 	 	 	int vert, dist, mn;
 	 	 	cin >> vert >> dist >> mn;
 
            int cur = 0, curv = vert;
 	 	 	for (int fin = height[vert] + dist; fin >= height[vert] - dist; fin--)
 	 	 	{
 	 	 	 	int x = (dist + height[vert] - fin) / 2;
 	 	 	 	if (x > cur)
 	 	 	 	{
 	 	 	 	 	if (parent[curv] != -1) curv = parent[curv], cur++;
 	 	 	 	} 
 	 	 	 	if (height[curv] > fin) break;
 
 	 	 	 	int y = fin - height[curv];
 	 	 	 	pair <int, int> bounds = subtree[y][curv];
 	 	 	 	if (bounds.x == -1) continue;
 	 	 	 	if (mn != 1) update(tree[fin], 1, 0, rows[fin] - 1, bounds.x, bounds.y, mn);
 	 	 	}
 	 	}
 	 	else
 	 	{
 	 		int vert;
 	 		cin >> vert;
 
 	 		int ans = get_height(tree[height[vert]], 1, 0, rows[height[vert]] - 1, position[vert], 1);
 	 		ans = (ll) ans * (ll) start_height[vert] % (ll) MOD;
 	 		cout << ans << '\n';
 	 	}
 	}
 	return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9980 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 9940 KB Output is correct
4 Correct 7 ms 10376 KB Output is correct
5 Correct 7 ms 10452 KB Output is correct
6 Correct 6 ms 10452 KB Output is correct
7 Correct 7 ms 10324 KB Output is correct
8 Correct 7 ms 10452 KB Output is correct
9 Correct 5 ms 9988 KB Output is correct
10 Correct 6 ms 9968 KB Output is correct
11 Correct 5 ms 9940 KB Output is correct
12 Correct 7 ms 9988 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 9940 KB Output is correct
15 Correct 7 ms 9988 KB Output is correct
16 Correct 6 ms 9940 KB Output is correct
17 Correct 6 ms 9988 KB Output is correct
18 Correct 5 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 6 ms 9960 KB Output is correct
21 Correct 6 ms 10032 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 6 ms 9984 KB Output is correct
25 Correct 6 ms 9980 KB Output is correct
26 Correct 6 ms 9984 KB Output is correct
27 Correct 5 ms 9940 KB Output is correct
28 Correct 6 ms 9976 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 397 ms 93032 KB Output is correct
3 Correct 533 ms 89864 KB Output is correct
4 Correct 523 ms 104092 KB Output is correct
5 Correct 424 ms 91468 KB Output is correct
6 Correct 480 ms 91288 KB Output is correct
7 Correct 435 ms 91736 KB Output is correct
8 Correct 349 ms 92184 KB Output is correct
9 Correct 503 ms 111904 KB Output is correct
10 Correct 588 ms 107212 KB Output is correct
11 Correct 380 ms 93168 KB Output is correct
12 Correct 514 ms 89828 KB Output is correct
13 Correct 293 ms 90508 KB Output is correct
14 Correct 421 ms 90468 KB Output is correct
15 Correct 436 ms 88908 KB Output is correct
16 Correct 469 ms 90080 KB Output is correct
17 Correct 493 ms 90700 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 6 ms 9988 KB Output is correct
21 Correct 6 ms 9940 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 397 ms 93032 KB Output is correct
3 Correct 533 ms 89864 KB Output is correct
4 Correct 523 ms 104092 KB Output is correct
5 Correct 424 ms 91468 KB Output is correct
6 Correct 480 ms 91288 KB Output is correct
7 Correct 435 ms 91736 KB Output is correct
8 Correct 349 ms 92184 KB Output is correct
9 Correct 503 ms 111904 KB Output is correct
10 Correct 588 ms 107212 KB Output is correct
11 Correct 380 ms 93168 KB Output is correct
12 Correct 514 ms 89828 KB Output is correct
13 Correct 293 ms 90508 KB Output is correct
14 Correct 421 ms 90468 KB Output is correct
15 Correct 436 ms 88908 KB Output is correct
16 Correct 469 ms 90080 KB Output is correct
17 Correct 493 ms 90700 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 6 ms 9988 KB Output is correct
21 Correct 6 ms 9940 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct
23 Correct 5 ms 9944 KB Output is correct
24 Correct 390 ms 92772 KB Output is correct
25 Correct 621 ms 89092 KB Output is correct
26 Correct 575 ms 108704 KB Output is correct
27 Correct 466 ms 89728 KB Output is correct
28 Correct 463 ms 89780 KB Output is correct
29 Correct 456 ms 89764 KB Output is correct
30 Correct 375 ms 90360 KB Output is correct
31 Correct 499 ms 104560 KB Output is correct
32 Correct 590 ms 104720 KB Output is correct
33 Correct 373 ms 90172 KB Output is correct
34 Correct 723 ms 87044 KB Output is correct
35 Correct 6 ms 10016 KB Output is correct
36 Correct 6 ms 9940 KB Output is correct
37 Correct 7 ms 9940 KB Output is correct
38 Correct 8 ms 9996 KB Output is correct
39 Correct 9 ms 9948 KB Output is correct
40 Correct 6 ms 9940 KB Output is correct
41 Correct 8 ms 9940 KB Output is correct
42 Correct 7 ms 9940 KB Output is correct
43 Correct 6 ms 9940 KB Output is correct
44 Correct 5 ms 9940 KB Output is correct
45 Correct 5 ms 9940 KB Output is correct
46 Correct 5 ms 9940 KB Output is correct
47 Correct 6 ms 9940 KB Output is correct
48 Correct 5 ms 9940 KB Output is correct
49 Correct 5 ms 9940 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9992 KB Output is correct
2 Correct 732 ms 106132 KB Output is correct
3 Correct 2668 ms 100776 KB Output is correct
4 Correct 1081 ms 102176 KB Output is correct
5 Correct 1885 ms 87080 KB Output is correct
6 Correct 1158 ms 87148 KB Output is correct
7 Correct 680 ms 87188 KB Output is correct
8 Correct 337 ms 87576 KB Output is correct
9 Correct 750 ms 100592 KB Output is correct
10 Correct 2381 ms 103840 KB Output is correct
11 Correct 973 ms 87368 KB Output is correct
12 Execution timed out 4080 ms 86868 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 766 ms 102340 KB Output is correct
3 Correct 3306 ms 96664 KB Output is correct
4 Correct 1351 ms 99812 KB Output is correct
5 Correct 2168 ms 88512 KB Output is correct
6 Correct 1138 ms 88740 KB Output is correct
7 Correct 781 ms 88584 KB Output is correct
8 Correct 317 ms 88896 KB Output is correct
9 Correct 692 ms 107468 KB Output is correct
10 Correct 2302 ms 104636 KB Output is correct
11 Correct 977 ms 90188 KB Output is correct
12 Execution timed out 4085 ms 86988 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9980 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 9940 KB Output is correct
4 Correct 7 ms 10376 KB Output is correct
5 Correct 7 ms 10452 KB Output is correct
6 Correct 6 ms 10452 KB Output is correct
7 Correct 7 ms 10324 KB Output is correct
8 Correct 7 ms 10452 KB Output is correct
9 Correct 5 ms 9988 KB Output is correct
10 Correct 6 ms 9968 KB Output is correct
11 Correct 5 ms 9940 KB Output is correct
12 Correct 7 ms 9988 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 9940 KB Output is correct
15 Correct 7 ms 9988 KB Output is correct
16 Correct 6 ms 9940 KB Output is correct
17 Correct 6 ms 9988 KB Output is correct
18 Correct 5 ms 9940 KB Output is correct
19 Correct 6 ms 9940 KB Output is correct
20 Correct 6 ms 9960 KB Output is correct
21 Correct 6 ms 10032 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 6 ms 9984 KB Output is correct
25 Correct 6 ms 9980 KB Output is correct
26 Correct 6 ms 9984 KB Output is correct
27 Correct 5 ms 9940 KB Output is correct
28 Correct 6 ms 9976 KB Output is correct
29 Correct 5 ms 9940 KB Output is correct
30 Correct 397 ms 93032 KB Output is correct
31 Correct 533 ms 89864 KB Output is correct
32 Correct 523 ms 104092 KB Output is correct
33 Correct 424 ms 91468 KB Output is correct
34 Correct 480 ms 91288 KB Output is correct
35 Correct 435 ms 91736 KB Output is correct
36 Correct 349 ms 92184 KB Output is correct
37 Correct 503 ms 111904 KB Output is correct
38 Correct 588 ms 107212 KB Output is correct
39 Correct 380 ms 93168 KB Output is correct
40 Correct 514 ms 89828 KB Output is correct
41 Correct 293 ms 90508 KB Output is correct
42 Correct 421 ms 90468 KB Output is correct
43 Correct 436 ms 88908 KB Output is correct
44 Correct 469 ms 90080 KB Output is correct
45 Correct 493 ms 90700 KB Output is correct
46 Correct 6 ms 9940 KB Output is correct
47 Correct 6 ms 9940 KB Output is correct
48 Correct 6 ms 9988 KB Output is correct
49 Correct 6 ms 9940 KB Output is correct
50 Correct 5 ms 9940 KB Output is correct
51 Correct 5 ms 9944 KB Output is correct
52 Correct 390 ms 92772 KB Output is correct
53 Correct 621 ms 89092 KB Output is correct
54 Correct 575 ms 108704 KB Output is correct
55 Correct 466 ms 89728 KB Output is correct
56 Correct 463 ms 89780 KB Output is correct
57 Correct 456 ms 89764 KB Output is correct
58 Correct 375 ms 90360 KB Output is correct
59 Correct 499 ms 104560 KB Output is correct
60 Correct 590 ms 104720 KB Output is correct
61 Correct 373 ms 90172 KB Output is correct
62 Correct 723 ms 87044 KB Output is correct
63 Correct 6 ms 10016 KB Output is correct
64 Correct 6 ms 9940 KB Output is correct
65 Correct 7 ms 9940 KB Output is correct
66 Correct 8 ms 9996 KB Output is correct
67 Correct 9 ms 9948 KB Output is correct
68 Correct 6 ms 9940 KB Output is correct
69 Correct 8 ms 9940 KB Output is correct
70 Correct 7 ms 9940 KB Output is correct
71 Correct 6 ms 9940 KB Output is correct
72 Correct 5 ms 9940 KB Output is correct
73 Correct 5 ms 9940 KB Output is correct
74 Correct 5 ms 9940 KB Output is correct
75 Correct 6 ms 9940 KB Output is correct
76 Correct 5 ms 9940 KB Output is correct
77 Correct 5 ms 9940 KB Output is correct
78 Correct 5 ms 9992 KB Output is correct
79 Correct 732 ms 106132 KB Output is correct
80 Correct 2668 ms 100776 KB Output is correct
81 Correct 1081 ms 102176 KB Output is correct
82 Correct 1885 ms 87080 KB Output is correct
83 Correct 1158 ms 87148 KB Output is correct
84 Correct 680 ms 87188 KB Output is correct
85 Correct 337 ms 87576 KB Output is correct
86 Correct 750 ms 100592 KB Output is correct
87 Correct 2381 ms 103840 KB Output is correct
88 Correct 973 ms 87368 KB Output is correct
89 Execution timed out 4080 ms 86868 KB Time limit exceeded
90 Halted 0 ms 0 KB -