oj.uz

답안 #558508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558508 2022-05-07T13:32:06 Z savacska Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 110444 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)
{
 	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;
 	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;
 	 	 	 	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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 10028 KB Output is correct
4 Correct 7 ms 10452 KB Output is correct
5 Correct 7 ms 10376 KB Output is correct
6 Correct 7 ms 10324 KB Output is correct
7 Correct 7 ms 10452 KB Output is correct
8 Correct 6 ms 10452 KB Output is correct
9 Correct 6 ms 9940 KB Output is correct
10 Correct 6 ms 9992 KB Output is correct
11 Correct 6 ms 9992 KB Output is correct
12 Correct 8 ms 9940 KB Output is correct
13 Correct 6 ms 10084 KB Output is correct
14 Correct 5 ms 9940 KB Output is correct
15 Correct 5 ms 9984 KB Output is correct
16 Correct 6 ms 9940 KB Output is correct
17 Correct 6 ms 10044 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9988 KB Output is correct
20 Correct 6 ms 9984 KB Output is correct
21 Correct 6 ms 10096 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9984 KB Output is correct
24 Correct 6 ms 9976 KB Output is correct
25 Correct 6 ms 9940 KB Output is correct
26 Correct 6 ms 9980 KB Output is correct
27 Correct 5 ms 9940 KB Output is correct
28 Correct 6 ms 9932 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 385 ms 91984 KB Output is correct
3 Correct 472 ms 87912 KB Output is correct
4 Correct 553 ms 101560 KB Output is correct
5 Correct 532 ms 89628 KB Output is correct
6 Correct 445 ms 89772 KB Output is correct
7 Correct 426 ms 90040 KB Output is correct
8 Correct 453 ms 90476 KB Output is correct
9 Correct 590 ms 110316 KB Output is correct
10 Correct 625 ms 105160 KB Output is correct
11 Correct 445 ms 91360 KB Output is correct
12 Correct 635 ms 88292 KB Output is correct
13 Correct 353 ms 88380 KB Output is correct
14 Correct 413 ms 88388 KB Output is correct
15 Correct 470 ms 88180 KB Output is correct
16 Correct 497 ms 88448 KB Output is correct
17 Correct 536 ms 89052 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 7 ms 9940 KB Output is correct
20 Correct 6 ms 9940 KB Output is correct
21 Correct 7 ms 9940 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 385 ms 91984 KB Output is correct
3 Correct 472 ms 87912 KB Output is correct
4 Correct 553 ms 101560 KB Output is correct
5 Correct 532 ms 89628 KB Output is correct
6 Correct 445 ms 89772 KB Output is correct
7 Correct 426 ms 90040 KB Output is correct
8 Correct 453 ms 90476 KB Output is correct
9 Correct 590 ms 110316 KB Output is correct
10 Correct 625 ms 105160 KB Output is correct
11 Correct 445 ms 91360 KB Output is correct
12 Correct 635 ms 88292 KB Output is correct
13 Correct 353 ms 88380 KB Output is correct
14 Correct 413 ms 88388 KB Output is correct
15 Correct 470 ms 88180 KB Output is correct
16 Correct 497 ms 88448 KB Output is correct
17 Correct 536 ms 89052 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 7 ms 9940 KB Output is correct
20 Correct 6 ms 9940 KB Output is correct
21 Correct 7 ms 9940 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 7 ms 9980 KB Output is correct
24 Correct 510 ms 91084 KB Output is correct
25 Correct 838 ms 87824 KB Output is correct
26 Correct 645 ms 107404 KB Output is correct
27 Correct 664 ms 89960 KB Output is correct
28 Correct 642 ms 90116 KB Output is correct
29 Correct 629 ms 90012 KB Output is correct
30 Correct 439 ms 90680 KB Output is correct
31 Correct 631 ms 105052 KB Output is correct
32 Correct 800 ms 107208 KB Output is correct
33 Correct 514 ms 92916 KB Output is correct
34 Correct 808 ms 91492 KB Output is correct
35 Correct 6 ms 9968 KB Output is correct
36 Correct 6 ms 10048 KB Output is correct
37 Correct 7 ms 10068 KB Output is correct
38 Correct 6 ms 9940 KB Output is correct
39 Correct 6 ms 9984 KB Output is correct
40 Correct 6 ms 9984 KB Output is correct
41 Correct 7 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 6 ms 9940 KB Output is correct
45 Correct 6 ms 9940 KB Output is correct
46 Correct 6 ms 9940 KB Output is correct
47 Correct 7 ms 9988 KB Output is correct
48 Correct 6 ms 9940 KB Output is correct
49 Correct 6 ms 9980 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9940 KB Output is correct
2 Correct 830 ms 108708 KB Output is correct
3 Correct 2942 ms 104204 KB Output is correct
4 Correct 1164 ms 104628 KB Output is correct
5 Correct 1870 ms 89868 KB Output is correct
6 Correct 998 ms 89936 KB Output is correct
7 Correct 645 ms 89996 KB Output is correct
8 Correct 337 ms 90556 KB Output is correct
9 Correct 903 ms 103372 KB Output is correct
10 Correct 2482 ms 106140 KB Output is correct
11 Correct 984 ms 90316 KB Output is correct
12 Execution timed out 4014 ms 89860 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 848 ms 105768 KB Output is correct
3 Correct 3219 ms 99060 KB Output is correct
4 Correct 1291 ms 102884 KB Output is correct
5 Correct 1820 ms 91544 KB Output is correct
6 Correct 966 ms 91432 KB Output is correct
7 Correct 704 ms 91516 KB Output is correct
8 Correct 328 ms 91868 KB Output is correct
9 Correct 762 ms 110444 KB Output is correct
10 Correct 2429 ms 107432 KB Output is correct
11 Correct 998 ms 92928 KB Output is correct
12 Execution timed out 4106 ms 90144 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 5 ms 9940 KB Output is correct
3 Correct 5 ms 10028 KB Output is correct
4 Correct 7 ms 10452 KB Output is correct
5 Correct 7 ms 10376 KB Output is correct
6 Correct 7 ms 10324 KB Output is correct
7 Correct 7 ms 10452 KB Output is correct
8 Correct 6 ms 10452 KB Output is correct
9 Correct 6 ms 9940 KB Output is correct
10 Correct 6 ms 9992 KB Output is correct
11 Correct 6 ms 9992 KB Output is correct
12 Correct 8 ms 9940 KB Output is correct
13 Correct 6 ms 10084 KB Output is correct
14 Correct 5 ms 9940 KB Output is correct
15 Correct 5 ms 9984 KB Output is correct
16 Correct 6 ms 9940 KB Output is correct
17 Correct 6 ms 10044 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 6 ms 9988 KB Output is correct
20 Correct 6 ms 9984 KB Output is correct
21 Correct 6 ms 10096 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9984 KB Output is correct
24 Correct 6 ms 9976 KB Output is correct
25 Correct 6 ms 9940 KB Output is correct
26 Correct 6 ms 9980 KB Output is correct
27 Correct 5 ms 9940 KB Output is correct
28 Correct 6 ms 9932 KB Output is correct
29 Correct 5 ms 9940 KB Output is correct
30 Correct 385 ms 91984 KB Output is correct
31 Correct 472 ms 87912 KB Output is correct
32 Correct 553 ms 101560 KB Output is correct
33 Correct 532 ms 89628 KB Output is correct
34 Correct 445 ms 89772 KB Output is correct
35 Correct 426 ms 90040 KB Output is correct
36 Correct 453 ms 90476 KB Output is correct
37 Correct 590 ms 110316 KB Output is correct
38 Correct 625 ms 105160 KB Output is correct
39 Correct 445 ms 91360 KB Output is correct
40 Correct 635 ms 88292 KB Output is correct
41 Correct 353 ms 88380 KB Output is correct
42 Correct 413 ms 88388 KB Output is correct
43 Correct 470 ms 88180 KB Output is correct
44 Correct 497 ms 88448 KB Output is correct
45 Correct 536 ms 89052 KB Output is correct
46 Correct 6 ms 9940 KB Output is correct
47 Correct 7 ms 9940 KB Output is correct
48 Correct 6 ms 9940 KB Output is correct
49 Correct 7 ms 9940 KB Output is correct
50 Correct 6 ms 9940 KB Output is correct
51 Correct 7 ms 9980 KB Output is correct
52 Correct 510 ms 91084 KB Output is correct
53 Correct 838 ms 87824 KB Output is correct
54 Correct 645 ms 107404 KB Output is correct
55 Correct 664 ms 89960 KB Output is correct
56 Correct 642 ms 90116 KB Output is correct
57 Correct 629 ms 90012 KB Output is correct
58 Correct 439 ms 90680 KB Output is correct
59 Correct 631 ms 105052 KB Output is correct
60 Correct 800 ms 107208 KB Output is correct
61 Correct 514 ms 92916 KB Output is correct
62 Correct 808 ms 91492 KB Output is correct
63 Correct 6 ms 9968 KB Output is correct
64 Correct 6 ms 10048 KB Output is correct
65 Correct 7 ms 10068 KB Output is correct
66 Correct 6 ms 9940 KB Output is correct
67 Correct 6 ms 9984 KB Output is correct
68 Correct 6 ms 9984 KB Output is correct
69 Correct 7 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 6 ms 9940 KB Output is correct
73 Correct 6 ms 9940 KB Output is correct
74 Correct 6 ms 9940 KB Output is correct
75 Correct 7 ms 9988 KB Output is correct
76 Correct 6 ms 9940 KB Output is correct
77 Correct 6 ms 9980 KB Output is correct
78 Correct 7 ms 9940 KB Output is correct
79 Correct 830 ms 108708 KB Output is correct
80 Correct 2942 ms 104204 KB Output is correct
81 Correct 1164 ms 104628 KB Output is correct
82 Correct 1870 ms 89868 KB Output is correct
83 Correct 998 ms 89936 KB Output is correct
84 Correct 645 ms 89996 KB Output is correct
85 Correct 337 ms 90556 KB Output is correct
86 Correct 903 ms 103372 KB Output is correct
87 Correct 2482 ms 106140 KB Output is correct
88 Correct 984 ms 90316 KB Output is correct
89 Execution timed out 4014 ms 89860 KB Time limit exceeded
90 Halted 0 ms 0 KB -