oj.uz

Submission #558547

# Submission time Handle Problem Language Result Execution time Memory
558547 2022-05-07T14:00:04 Z savacska Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 513360 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];
deque <pair <pair <int, int>, int> > ququ[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 (cur_val == 0) return 0;
 	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) ququ[fin].pb(mp(mp(bounds.x, bounds.y), mn));
 	 	 	}
 	 	}
 	 	else
 	 	{
 	 		int vert;
 	 		cin >> vert;
 
            int heh = height[vert];
            while (!ququ[heh].empty())
            {
             	pair <pair <int, int>, int> A = ququ[heh].front();
             	ququ[heh].pop_front();
             	update(tree[heh], 1, 0, rows[heh] - 1, A.x.x, A.x.y, A.y);
            }
 	 		int ans = get_height(tree[heh], 1, 0, rows[heh] - 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 131 ms 141476 KB Output is correct
2 Correct 85 ms 141456 KB Output is correct
3 Correct 85 ms 141484 KB Output is correct
4 Correct 104 ms 142048 KB Output is correct
5 Correct 91 ms 141896 KB Output is correct
6 Correct 95 ms 141900 KB Output is correct
7 Correct 92 ms 141824 KB Output is correct
8 Correct 96 ms 141928 KB Output is correct
9 Correct 83 ms 141512 KB Output is correct
10 Correct 82 ms 141524 KB Output is correct
11 Correct 84 ms 141436 KB Output is correct
12 Correct 86 ms 141444 KB Output is correct
13 Correct 82 ms 141500 KB Output is correct
14 Correct 83 ms 141464 KB Output is correct
15 Correct 93 ms 141448 KB Output is correct
16 Correct 92 ms 141532 KB Output is correct
17 Correct 95 ms 141532 KB Output is correct
18 Correct 89 ms 141528 KB Output is correct
19 Correct 88 ms 141524 KB Output is correct
20 Correct 93 ms 141444 KB Output is correct
21 Correct 87 ms 141528 KB Output is correct
22 Correct 83 ms 141404 KB Output is correct
23 Correct 87 ms 141516 KB Output is correct
24 Correct 88 ms 141532 KB Output is correct
25 Correct 83 ms 141456 KB Output is correct
26 Correct 81 ms 141460 KB Output is correct
27 Correct 84 ms 141464 KB Output is correct
28 Correct 83 ms 141452 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 141496 KB Output is correct
2 Correct 454 ms 221716 KB Output is correct
3 Correct 568 ms 218860 KB Output is correct
4 Correct 623 ms 232548 KB Output is correct
5 Correct 492 ms 220060 KB Output is correct
6 Correct 487 ms 219996 KB Output is correct
7 Correct 497 ms 220412 KB Output is correct
8 Correct 434 ms 221976 KB Output is correct
9 Correct 617 ms 240484 KB Output is correct
10 Correct 636 ms 235908 KB Output is correct
11 Correct 431 ms 221640 KB Output is correct
12 Correct 530 ms 218820 KB Output is correct
13 Correct 380 ms 226276 KB Output is correct
14 Correct 469 ms 223112 KB Output is correct
15 Correct 503 ms 220456 KB Output is correct
16 Correct 520 ms 219632 KB Output is correct
17 Correct 542 ms 219628 KB Output is correct
18 Correct 81 ms 141528 KB Output is correct
19 Correct 87 ms 141536 KB Output is correct
20 Correct 79 ms 141500 KB Output is correct
21 Correct 83 ms 141516 KB Output is correct
22 Correct 82 ms 141508 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 141496 KB Output is correct
2 Correct 454 ms 221716 KB Output is correct
3 Correct 568 ms 218860 KB Output is correct
4 Correct 623 ms 232548 KB Output is correct
5 Correct 492 ms 220060 KB Output is correct
6 Correct 487 ms 219996 KB Output is correct
7 Correct 497 ms 220412 KB Output is correct
8 Correct 434 ms 221976 KB Output is correct
9 Correct 617 ms 240484 KB Output is correct
10 Correct 636 ms 235908 KB Output is correct
11 Correct 431 ms 221640 KB Output is correct
12 Correct 530 ms 218820 KB Output is correct
13 Correct 380 ms 226276 KB Output is correct
14 Correct 469 ms 223112 KB Output is correct
15 Correct 503 ms 220456 KB Output is correct
16 Correct 520 ms 219632 KB Output is correct
17 Correct 542 ms 219628 KB Output is correct
18 Correct 81 ms 141528 KB Output is correct
19 Correct 87 ms 141536 KB Output is correct
20 Correct 79 ms 141500 KB Output is correct
21 Correct 83 ms 141516 KB Output is correct
22 Correct 82 ms 141508 KB Output is correct
23 Correct 81 ms 141424 KB Output is correct
24 Correct 465 ms 221636 KB Output is correct
25 Correct 659 ms 219052 KB Output is correct
26 Correct 656 ms 237960 KB Output is correct
27 Correct 516 ms 220292 KB Output is correct
28 Correct 516 ms 220108 KB Output is correct
29 Correct 518 ms 220296 KB Output is correct
30 Correct 463 ms 221944 KB Output is correct
31 Correct 579 ms 234684 KB Output is correct
32 Correct 659 ms 235796 KB Output is correct
33 Correct 446 ms 221644 KB Output is correct
34 Correct 614 ms 218968 KB Output is correct
35 Correct 90 ms 141536 KB Output is correct
36 Correct 84 ms 141644 KB Output is correct
37 Correct 82 ms 141432 KB Output is correct
38 Correct 82 ms 141516 KB Output is correct
39 Correct 84 ms 141516 KB Output is correct
40 Correct 81 ms 141524 KB Output is correct
41 Correct 82 ms 141516 KB Output is correct
42 Correct 84 ms 141532 KB Output is correct
43 Correct 84 ms 141428 KB Output is correct
44 Correct 84 ms 141456 KB Output is correct
45 Correct 87 ms 141532 KB Output is correct
46 Correct 82 ms 141488 KB Output is correct
47 Correct 86 ms 141528 KB Output is correct
48 Correct 85 ms 141536 KB Output is correct
49 Correct 87 ms 141512 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 141416 KB Output is correct
2 Correct 865 ms 237512 KB Output is correct
3 Correct 2817 ms 512528 KB Output is correct
4 Correct 1286 ms 273096 KB Output is correct
5 Correct 1811 ms 218908 KB Output is correct
6 Correct 1351 ms 220268 KB Output is correct
7 Correct 889 ms 222316 KB Output is correct
8 Correct 426 ms 223872 KB Output is correct
9 Correct 998 ms 233408 KB Output is correct
10 Correct 3148 ms 513360 KB Output is correct
11 Correct 1086 ms 219024 KB Output is correct
12 Execution timed out 4045 ms 231012 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 141524 KB Output is correct
2 Correct 954 ms 235444 KB Output is correct
3 Correct 3011 ms 512068 KB Output is correct
4 Correct 1285 ms 269400 KB Output is correct
5 Correct 1480 ms 220812 KB Output is correct
6 Correct 1193 ms 223884 KB Output is correct
7 Correct 874 ms 224420 KB Output is correct
8 Correct 411 ms 224340 KB Output is correct
9 Correct 838 ms 239568 KB Output is correct
10 Correct 2567 ms 512704 KB Output is correct
11 Correct 1049 ms 221756 KB Output is correct
12 Execution timed out 4030 ms 225592 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 141476 KB Output is correct
2 Correct 85 ms 141456 KB Output is correct
3 Correct 85 ms 141484 KB Output is correct
4 Correct 104 ms 142048 KB Output is correct
5 Correct 91 ms 141896 KB Output is correct
6 Correct 95 ms 141900 KB Output is correct
7 Correct 92 ms 141824 KB Output is correct
8 Correct 96 ms 141928 KB Output is correct
9 Correct 83 ms 141512 KB Output is correct
10 Correct 82 ms 141524 KB Output is correct
11 Correct 84 ms 141436 KB Output is correct
12 Correct 86 ms 141444 KB Output is correct
13 Correct 82 ms 141500 KB Output is correct
14 Correct 83 ms 141464 KB Output is correct
15 Correct 93 ms 141448 KB Output is correct
16 Correct 92 ms 141532 KB Output is correct
17 Correct 95 ms 141532 KB Output is correct
18 Correct 89 ms 141528 KB Output is correct
19 Correct 88 ms 141524 KB Output is correct
20 Correct 93 ms 141444 KB Output is correct
21 Correct 87 ms 141528 KB Output is correct
22 Correct 83 ms 141404 KB Output is correct
23 Correct 87 ms 141516 KB Output is correct
24 Correct 88 ms 141532 KB Output is correct
25 Correct 83 ms 141456 KB Output is correct
26 Correct 81 ms 141460 KB Output is correct
27 Correct 84 ms 141464 KB Output is correct
28 Correct 83 ms 141452 KB Output is correct
29 Correct 92 ms 141496 KB Output is correct
30 Correct 454 ms 221716 KB Output is correct
31 Correct 568 ms 218860 KB Output is correct
32 Correct 623 ms 232548 KB Output is correct
33 Correct 492 ms 220060 KB Output is correct
34 Correct 487 ms 219996 KB Output is correct
35 Correct 497 ms 220412 KB Output is correct
36 Correct 434 ms 221976 KB Output is correct
37 Correct 617 ms 240484 KB Output is correct
38 Correct 636 ms 235908 KB Output is correct
39 Correct 431 ms 221640 KB Output is correct
40 Correct 530 ms 218820 KB Output is correct
41 Correct 380 ms 226276 KB Output is correct
42 Correct 469 ms 223112 KB Output is correct
43 Correct 503 ms 220456 KB Output is correct
44 Correct 520 ms 219632 KB Output is correct
45 Correct 542 ms 219628 KB Output is correct
46 Correct 81 ms 141528 KB Output is correct
47 Correct 87 ms 141536 KB Output is correct
48 Correct 79 ms 141500 KB Output is correct
49 Correct 83 ms 141516 KB Output is correct
50 Correct 82 ms 141508 KB Output is correct
51 Correct 81 ms 141424 KB Output is correct
52 Correct 465 ms 221636 KB Output is correct
53 Correct 659 ms 219052 KB Output is correct
54 Correct 656 ms 237960 KB Output is correct
55 Correct 516 ms 220292 KB Output is correct
56 Correct 516 ms 220108 KB Output is correct
57 Correct 518 ms 220296 KB Output is correct
58 Correct 463 ms 221944 KB Output is correct
59 Correct 579 ms 234684 KB Output is correct
60 Correct 659 ms 235796 KB Output is correct
61 Correct 446 ms 221644 KB Output is correct
62 Correct 614 ms 218968 KB Output is correct
63 Correct 90 ms 141536 KB Output is correct
64 Correct 84 ms 141644 KB Output is correct
65 Correct 82 ms 141432 KB Output is correct
66 Correct 82 ms 141516 KB Output is correct
67 Correct 84 ms 141516 KB Output is correct
68 Correct 81 ms 141524 KB Output is correct
69 Correct 82 ms 141516 KB Output is correct
70 Correct 84 ms 141532 KB Output is correct
71 Correct 84 ms 141428 KB Output is correct
72 Correct 84 ms 141456 KB Output is correct
73 Correct 87 ms 141532 KB Output is correct
74 Correct 82 ms 141488 KB Output is correct
75 Correct 86 ms 141528 KB Output is correct
76 Correct 85 ms 141536 KB Output is correct
77 Correct 87 ms 141512 KB Output is correct
78 Correct 92 ms 141416 KB Output is correct
79 Correct 865 ms 237512 KB Output is correct
80 Correct 2817 ms 512528 KB Output is correct
81 Correct 1286 ms 273096 KB Output is correct
82 Correct 1811 ms 218908 KB Output is correct
83 Correct 1351 ms 220268 KB Output is correct
84 Correct 889 ms 222316 KB Output is correct
85 Correct 426 ms 223872 KB Output is correct
86 Correct 998 ms 233408 KB Output is correct
87 Correct 3148 ms 513360 KB Output is correct
88 Correct 1086 ms 219024 KB Output is correct
89 Execution timed out 4045 ms 231012 KB Time limit exceeded
90 Halted 0 ms 0 KB -