oj.uz

답안 #558470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558470 2022-05-07T12:24:12 Z savacska Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 126400 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];
vector <int> rows[MAXN + 5];
pair <int, int> subtree[MAXD + 5][MAXN + 5];
vector <pair <int, int> > tree[MAXN + 5];
int path[MAXN + 5];

void dfs(int v, int pr, int hei)
{
	parent[v] = pr;
	height[v] = hei;
	position[v] = (int) rows[hei].size();
	rows[hei].pb(v);

	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;
}

void build(vector <pair <int, int> > &tree, int v, int lef, int rig, const vector <int> &num)
{
 	if (lef == rig)
 	{
 		int vv = num[lef];
 		tree[v] = mp(start_height[vv], 1);
 		return; 	
 	}
 	int mid = (lef + rig) / 2;
 	build(tree, 2 * v, lef, mid, num);
 	build(tree, 2 * v + 1, mid + 1, rig, num);
 	tree[v] = mp((ll) tree[2 * v].x * (ll) tree[2 * v + 1].x % (ll) MOD, 1);
 	return;
}

int get_height(vector <pair <int, int> > &tree, int v, int lef, int rig, int pos, int cur_val)
{
 	cur_val = (ll) cur_val * (ll) tree[v].y % (ll) MOD;
 	if (lef == rig) return (ll) cur_val * (ll) tree[v].x % (ll) MOD;
 	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 <pair <int, 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].y = (ll) tree[v].y * (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].empty())
 	 	{
 	 	 	int sz = (int) rows[h].size();
 	 	 	tree[h].resize(4 * sz, mp(0, 0));
 	 	 	build(tree[h], 1, 0, sz - 1, rows[h]);
 	 		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 tek = vert;
 	 	 	int uk = 0;
 	 	 	path[uk] = tek;
 	 	 	uk++;
 	 	 	for (int i = 1; i <= dist; i++)
 	 	 	{
 	 	 		if (parent[tek] == -1) break;
 	 	 		tek = parent[tek];
 	 	 		path[uk] = tek;
 	 	 		uk++;
 	 	 	}
 	 	 	for (int fin = height[vert] - dist; fin <= height[vert] + dist; fin++)
 	 	 	{
 	 	 	 	int x = (dist + height[vert] - fin) / 2;
 	 	 	 	if (x >= uk) x = uk - 1;
 	 	 	 	if (height[path[x]] > fin) continue;

 	 	 	 	int y = fin - height[path[x]];
 	 	 	 	pair <int, int> bounds = subtree[y][path[x]];
 	 	 	 	if (bounds.x == -1) continue;
 	 	 	 	update(tree[fin], 1, 0, (int) rows[fin].size() - 1, bounds.x, bounds.y, mn);
 	 	 	}
 	 	}
 	 	else
 	 	{
 	 		int vert;
 	 		cin >> vert;

 	 		cout << get_height(tree[height[vert]], 1, 0, (int) rows[height[vert]].size() - 1, position[vert], 1) << '\n';
 	 	}
 	}
 	return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14676 KB Output is correct
2 Correct 8 ms 14676 KB Output is correct
3 Correct 8 ms 14676 KB Output is correct
4 Correct 9 ms 15188 KB Output is correct
5 Correct 9 ms 15076 KB Output is correct
6 Correct 9 ms 15088 KB Output is correct
7 Correct 8 ms 15096 KB Output is correct
8 Correct 9 ms 15188 KB Output is correct
9 Correct 8 ms 14680 KB Output is correct
10 Correct 8 ms 14804 KB Output is correct
11 Correct 9 ms 14700 KB Output is correct
12 Correct 8 ms 14708 KB Output is correct
13 Correct 8 ms 14676 KB Output is correct
14 Correct 8 ms 14708 KB Output is correct
15 Correct 8 ms 14676 KB Output is correct
16 Correct 11 ms 14708 KB Output is correct
17 Correct 8 ms 14676 KB Output is correct
18 Correct 8 ms 14676 KB Output is correct
19 Correct 8 ms 14676 KB Output is correct
20 Correct 8 ms 14696 KB Output is correct
21 Correct 8 ms 14752 KB Output is correct
22 Correct 8 ms 14740 KB Output is correct
23 Correct 8 ms 14700 KB Output is correct
24 Correct 8 ms 14696 KB Output is correct
25 Correct 8 ms 14676 KB Output is correct
26 Correct 8 ms 14676 KB Output is correct
27 Correct 8 ms 14676 KB Output is correct
28 Correct 8 ms 14676 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14676 KB Output is correct
2 Correct 402 ms 100296 KB Output is correct
3 Correct 560 ms 97168 KB Output is correct
4 Correct 567 ms 111792 KB Output is correct
5 Correct 501 ms 98648 KB Output is correct
6 Correct 507 ms 98972 KB Output is correct
7 Correct 506 ms 98892 KB Output is correct
8 Correct 365 ms 99396 KB Output is correct
9 Correct 534 ms 120544 KB Output is correct
10 Correct 551 ms 115392 KB Output is correct
11 Correct 411 ms 100704 KB Output is correct
12 Correct 503 ms 97684 KB Output is correct
13 Correct 344 ms 97480 KB Output is correct
14 Correct 369 ms 97360 KB Output is correct
15 Correct 443 ms 97760 KB Output is correct
16 Correct 436 ms 102204 KB Output is correct
17 Correct 503 ms 103396 KB Output is correct
18 Correct 8 ms 14676 KB Output is correct
19 Correct 10 ms 14676 KB Output is correct
20 Correct 8 ms 14676 KB Output is correct
21 Correct 8 ms 14708 KB Output is correct
22 Correct 8 ms 14700 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14676 KB Output is correct
2 Correct 402 ms 100296 KB Output is correct
3 Correct 560 ms 97168 KB Output is correct
4 Correct 567 ms 111792 KB Output is correct
5 Correct 501 ms 98648 KB Output is correct
6 Correct 507 ms 98972 KB Output is correct
7 Correct 506 ms 98892 KB Output is correct
8 Correct 365 ms 99396 KB Output is correct
9 Correct 534 ms 120544 KB Output is correct
10 Correct 551 ms 115392 KB Output is correct
11 Correct 411 ms 100704 KB Output is correct
12 Correct 503 ms 97684 KB Output is correct
13 Correct 344 ms 97480 KB Output is correct
14 Correct 369 ms 97360 KB Output is correct
15 Correct 443 ms 97760 KB Output is correct
16 Correct 436 ms 102204 KB Output is correct
17 Correct 503 ms 103396 KB Output is correct
18 Correct 8 ms 14676 KB Output is correct
19 Correct 10 ms 14676 KB Output is correct
20 Correct 8 ms 14676 KB Output is correct
21 Correct 8 ms 14708 KB Output is correct
22 Correct 8 ms 14700 KB Output is correct
23 Correct 8 ms 14676 KB Output is correct
24 Correct 423 ms 107148 KB Output is correct
25 Correct 665 ms 106536 KB Output is correct
26 Correct 601 ms 126400 KB Output is correct
27 Correct 506 ms 106944 KB Output is correct
28 Correct 561 ms 106984 KB Output is correct
29 Correct 519 ms 106728 KB Output is correct
30 Correct 380 ms 107300 KB Output is correct
31 Correct 516 ms 120500 KB Output is correct
32 Correct 636 ms 123452 KB Output is correct
33 Correct 419 ms 106920 KB Output is correct
34 Correct 694 ms 104772 KB Output is correct
35 Correct 8 ms 14676 KB Output is correct
36 Correct 9 ms 14676 KB Output is correct
37 Correct 9 ms 14756 KB Output is correct
38 Correct 8 ms 14704 KB Output is correct
39 Correct 8 ms 14720 KB Output is correct
40 Correct 8 ms 14700 KB Output is correct
41 Correct 8 ms 14676 KB Output is correct
42 Correct 10 ms 14704 KB Output is correct
43 Correct 8 ms 14676 KB Output is correct
44 Correct 8 ms 14676 KB Output is correct
45 Correct 8 ms 14676 KB Output is correct
46 Correct 8 ms 14692 KB Output is correct
47 Correct 8 ms 14676 KB Output is correct
48 Correct 9 ms 14692 KB Output is correct
49 Correct 9 ms 14644 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14676 KB Output is correct
2 Correct 760 ms 116548 KB Output is correct
3 Correct 3064 ms 117788 KB Output is correct
4 Correct 1247 ms 119300 KB Output is correct
5 Correct 2130 ms 104204 KB Output is correct
6 Correct 1103 ms 103852 KB Output is correct
7 Correct 723 ms 103976 KB Output is correct
8 Correct 375 ms 104112 KB Output is correct
9 Correct 815 ms 117712 KB Output is correct
10 Correct 2830 ms 122128 KB Output is correct
11 Correct 1124 ms 103736 KB Output is correct
12 Execution timed out 4074 ms 102744 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14676 KB Output is correct
2 Correct 871 ms 112032 KB Output is correct
3 Correct 3561 ms 114652 KB Output is correct
4 Correct 1342 ms 117208 KB Output is correct
5 Correct 2174 ms 105676 KB Output is correct
6 Correct 1102 ms 105632 KB Output is correct
7 Correct 815 ms 105240 KB Output is correct
8 Correct 378 ms 105648 KB Output is correct
9 Correct 787 ms 124980 KB Output is correct
10 Correct 2660 ms 123028 KB Output is correct
11 Correct 1114 ms 106416 KB Output is correct
12 Execution timed out 4062 ms 103524 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14676 KB Output is correct
2 Correct 8 ms 14676 KB Output is correct
3 Correct 8 ms 14676 KB Output is correct
4 Correct 9 ms 15188 KB Output is correct
5 Correct 9 ms 15076 KB Output is correct
6 Correct 9 ms 15088 KB Output is correct
7 Correct 8 ms 15096 KB Output is correct
8 Correct 9 ms 15188 KB Output is correct
9 Correct 8 ms 14680 KB Output is correct
10 Correct 8 ms 14804 KB Output is correct
11 Correct 9 ms 14700 KB Output is correct
12 Correct 8 ms 14708 KB Output is correct
13 Correct 8 ms 14676 KB Output is correct
14 Correct 8 ms 14708 KB Output is correct
15 Correct 8 ms 14676 KB Output is correct
16 Correct 11 ms 14708 KB Output is correct
17 Correct 8 ms 14676 KB Output is correct
18 Correct 8 ms 14676 KB Output is correct
19 Correct 8 ms 14676 KB Output is correct
20 Correct 8 ms 14696 KB Output is correct
21 Correct 8 ms 14752 KB Output is correct
22 Correct 8 ms 14740 KB Output is correct
23 Correct 8 ms 14700 KB Output is correct
24 Correct 8 ms 14696 KB Output is correct
25 Correct 8 ms 14676 KB Output is correct
26 Correct 8 ms 14676 KB Output is correct
27 Correct 8 ms 14676 KB Output is correct
28 Correct 8 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 402 ms 100296 KB Output is correct
31 Correct 560 ms 97168 KB Output is correct
32 Correct 567 ms 111792 KB Output is correct
33 Correct 501 ms 98648 KB Output is correct
34 Correct 507 ms 98972 KB Output is correct
35 Correct 506 ms 98892 KB Output is correct
36 Correct 365 ms 99396 KB Output is correct
37 Correct 534 ms 120544 KB Output is correct
38 Correct 551 ms 115392 KB Output is correct
39 Correct 411 ms 100704 KB Output is correct
40 Correct 503 ms 97684 KB Output is correct
41 Correct 344 ms 97480 KB Output is correct
42 Correct 369 ms 97360 KB Output is correct
43 Correct 443 ms 97760 KB Output is correct
44 Correct 436 ms 102204 KB Output is correct
45 Correct 503 ms 103396 KB Output is correct
46 Correct 8 ms 14676 KB Output is correct
47 Correct 10 ms 14676 KB Output is correct
48 Correct 8 ms 14676 KB Output is correct
49 Correct 8 ms 14708 KB Output is correct
50 Correct 8 ms 14700 KB Output is correct
51 Correct 8 ms 14676 KB Output is correct
52 Correct 423 ms 107148 KB Output is correct
53 Correct 665 ms 106536 KB Output is correct
54 Correct 601 ms 126400 KB Output is correct
55 Correct 506 ms 106944 KB Output is correct
56 Correct 561 ms 106984 KB Output is correct
57 Correct 519 ms 106728 KB Output is correct
58 Correct 380 ms 107300 KB Output is correct
59 Correct 516 ms 120500 KB Output is correct
60 Correct 636 ms 123452 KB Output is correct
61 Correct 419 ms 106920 KB Output is correct
62 Correct 694 ms 104772 KB Output is correct
63 Correct 8 ms 14676 KB Output is correct
64 Correct 9 ms 14676 KB Output is correct
65 Correct 9 ms 14756 KB Output is correct
66 Correct 8 ms 14704 KB Output is correct
67 Correct 8 ms 14720 KB Output is correct
68 Correct 8 ms 14700 KB Output is correct
69 Correct 8 ms 14676 KB Output is correct
70 Correct 10 ms 14704 KB Output is correct
71 Correct 8 ms 14676 KB Output is correct
72 Correct 8 ms 14676 KB Output is correct
73 Correct 8 ms 14676 KB Output is correct
74 Correct 8 ms 14692 KB Output is correct
75 Correct 8 ms 14676 KB Output is correct
76 Correct 9 ms 14692 KB Output is correct
77 Correct 9 ms 14644 KB Output is correct
78 Correct 8 ms 14676 KB Output is correct
79 Correct 760 ms 116548 KB Output is correct
80 Correct 3064 ms 117788 KB Output is correct
81 Correct 1247 ms 119300 KB Output is correct
82 Correct 2130 ms 104204 KB Output is correct
83 Correct 1103 ms 103852 KB Output is correct
84 Correct 723 ms 103976 KB Output is correct
85 Correct 375 ms 104112 KB Output is correct
86 Correct 815 ms 117712 KB Output is correct
87 Correct 2830 ms 122128 KB Output is correct
88 Correct 1124 ms 103736 KB Output is correct
89 Execution timed out 4074 ms 102744 KB Time limit exceeded
90 Halted 0 ms 0 KB -