oj.uz

답안 #558484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558484 2022-05-07T12:56:04 Z savacska Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 109832 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];
int path[MAXN + 5], bigsize[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 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)
 	 	{
 	 	 	int step = 1;
 	 	 	while (step < rows[h]) step *= 2;
 	 	 	bigsize[h] = step;
 	 	 	tree[h].resize(2 * step, 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 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;

 	 	 	 	int L = bounds.x + bigsize[fin], R = bounds.y + bigsize[fin];
 	 	 	 	while (L <= R)
				{
					if (L % 2 == 1)
					{
						tree[fin][L] = (ll) tree[fin][L] * (ll) mn % (ll) MOD;
						L++;
					}
					if (R % 2 == 0)
					{
					 	tree[fin][R] = (ll) tree[fin][R] * (ll) mn % (ll) MOD;
					 	R--;
				 	}
				 	L /= 2, R /= 2;
				}
 	 	 	}
 	 	}
 	 	else
 	 	{
 	 		int vert;
 	 		cin >> vert;

 	 		int pos = position[vert] + bigsize[height[vert]];
 	 		int ans = start_height[vert];
 	 		while (pos > 0)
 	 		{
 	 		 	ans = (ll) ans * (ll) tree[height[vert]][pos] % (ll) MOD;
 	 		 	pos /= 2;
 	 		}
 	 		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 9940 KB Output is correct
4 Correct 7 ms 10452 KB Output is correct
5 Correct 6 ms 10324 KB Output is correct
6 Correct 6 ms 10324 KB Output is correct
7 Correct 7 ms 10400 KB Output is correct
8 Correct 6 ms 10328 KB Output is correct
9 Correct 6 ms 9940 KB Output is correct
10 Correct 6 ms 9940 KB Output is correct
11 Correct 6 ms 9940 KB Output is correct
12 Correct 7 ms 10040 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 10020 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 5 ms 10040 KB Output is correct
17 Correct 5 ms 9940 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 5 ms 9940 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 5 ms 9940 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 5 ms 9940 KB Output is correct
25 Correct 8 ms 9940 KB Output is correct
26 Correct 6 ms 9940 KB Output is correct
27 Correct 6 ms 10052 KB Output is correct
28 Correct 8 ms 9980 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9940 KB Output is correct
2 Correct 342 ms 89272 KB Output is correct
3 Correct 499 ms 86160 KB Output is correct
4 Correct 598 ms 100360 KB Output is correct
5 Correct 432 ms 87656 KB Output is correct
6 Correct 376 ms 87640 KB Output is correct
7 Correct 406 ms 87824 KB Output is correct
8 Correct 348 ms 88176 KB Output is correct
9 Correct 498 ms 109832 KB Output is correct
10 Correct 564 ms 106392 KB Output is correct
11 Correct 394 ms 91484 KB Output is correct
12 Correct 460 ms 88528 KB Output is correct
13 Correct 319 ms 88448 KB Output is correct
14 Correct 347 ms 88668 KB Output is correct
15 Correct 344 ms 87868 KB Output is correct
16 Correct 365 ms 88100 KB Output is correct
17 Correct 382 ms 88208 KB Output is correct
18 Correct 8 ms 9984 KB Output is correct
19 Correct 6 ms 9980 KB Output is correct
20 Correct 6 ms 10052 KB Output is correct
21 Correct 6 ms 9984 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9940 KB Output is correct
2 Correct 342 ms 89272 KB Output is correct
3 Correct 499 ms 86160 KB Output is correct
4 Correct 598 ms 100360 KB Output is correct
5 Correct 432 ms 87656 KB Output is correct
6 Correct 376 ms 87640 KB Output is correct
7 Correct 406 ms 87824 KB Output is correct
8 Correct 348 ms 88176 KB Output is correct
9 Correct 498 ms 109832 KB Output is correct
10 Correct 564 ms 106392 KB Output is correct
11 Correct 394 ms 91484 KB Output is correct
12 Correct 460 ms 88528 KB Output is correct
13 Correct 319 ms 88448 KB Output is correct
14 Correct 347 ms 88668 KB Output is correct
15 Correct 344 ms 87868 KB Output is correct
16 Correct 365 ms 88100 KB Output is correct
17 Correct 382 ms 88208 KB Output is correct
18 Correct 8 ms 9984 KB Output is correct
19 Correct 6 ms 9980 KB Output is correct
20 Correct 6 ms 10052 KB Output is correct
21 Correct 6 ms 9984 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 5 ms 9940 KB Output is correct
24 Correct 364 ms 90360 KB Output is correct
25 Correct 536 ms 86788 KB Output is correct
26 Correct 605 ms 107744 KB Output is correct
27 Correct 487 ms 88348 KB Output is correct
28 Correct 449 ms 88528 KB Output is correct
29 Correct 381 ms 88656 KB Output is correct
30 Correct 374 ms 88772 KB Output is correct
31 Correct 529 ms 103748 KB Output is correct
32 Correct 629 ms 106420 KB Output is correct
33 Correct 440 ms 90412 KB Output is correct
34 Correct 522 ms 88060 KB Output is correct
35 Correct 6 ms 9996 KB Output is correct
36 Correct 6 ms 9988 KB Output is correct
37 Correct 6 ms 9940 KB Output is correct
38 Correct 7 ms 9940 KB Output is correct
39 Correct 6 ms 10068 KB Output is correct
40 Correct 7 ms 9940 KB Output is correct
41 Correct 7 ms 9940 KB Output is correct
42 Correct 6 ms 9956 KB Output is correct
43 Correct 6 ms 9984 KB Output is correct
44 Correct 5 ms 9940 KB Output is correct
45 Correct 6 ms 9940 KB Output is correct
46 Correct 6 ms 9960 KB Output is correct
47 Correct 6 ms 9940 KB Output is correct
48 Correct 6 ms 9940 KB Output is correct
49 Correct 6 ms 9988 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9940 KB Output is correct
2 Correct 1064 ms 106576 KB Output is correct
3 Execution timed out 4097 ms 102264 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9940 KB Output is correct
2 Correct 1095 ms 102544 KB Output is correct
3 Execution timed out 4024 ms 95968 KB Time limit exceeded
4 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 9940 KB Output is correct
4 Correct 7 ms 10452 KB Output is correct
5 Correct 6 ms 10324 KB Output is correct
6 Correct 6 ms 10324 KB Output is correct
7 Correct 7 ms 10400 KB Output is correct
8 Correct 6 ms 10328 KB Output is correct
9 Correct 6 ms 9940 KB Output is correct
10 Correct 6 ms 9940 KB Output is correct
11 Correct 6 ms 9940 KB Output is correct
12 Correct 7 ms 10040 KB Output is correct
13 Correct 6 ms 9940 KB Output is correct
14 Correct 6 ms 10020 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 5 ms 10040 KB Output is correct
17 Correct 5 ms 9940 KB Output is correct
18 Correct 6 ms 9940 KB Output is correct
19 Correct 5 ms 9940 KB Output is correct
20 Correct 5 ms 9940 KB Output is correct
21 Correct 5 ms 9940 KB Output is correct
22 Correct 5 ms 9940 KB Output is correct
23 Correct 6 ms 9940 KB Output is correct
24 Correct 5 ms 9940 KB Output is correct
25 Correct 8 ms 9940 KB Output is correct
26 Correct 6 ms 9940 KB Output is correct
27 Correct 6 ms 10052 KB Output is correct
28 Correct 8 ms 9980 KB Output is correct
29 Correct 7 ms 9940 KB Output is correct
30 Correct 342 ms 89272 KB Output is correct
31 Correct 499 ms 86160 KB Output is correct
32 Correct 598 ms 100360 KB Output is correct
33 Correct 432 ms 87656 KB Output is correct
34 Correct 376 ms 87640 KB Output is correct
35 Correct 406 ms 87824 KB Output is correct
36 Correct 348 ms 88176 KB Output is correct
37 Correct 498 ms 109832 KB Output is correct
38 Correct 564 ms 106392 KB Output is correct
39 Correct 394 ms 91484 KB Output is correct
40 Correct 460 ms 88528 KB Output is correct
41 Correct 319 ms 88448 KB Output is correct
42 Correct 347 ms 88668 KB Output is correct
43 Correct 344 ms 87868 KB Output is correct
44 Correct 365 ms 88100 KB Output is correct
45 Correct 382 ms 88208 KB Output is correct
46 Correct 8 ms 9984 KB Output is correct
47 Correct 6 ms 9980 KB Output is correct
48 Correct 6 ms 10052 KB Output is correct
49 Correct 6 ms 9984 KB Output is correct
50 Correct 6 ms 9940 KB Output is correct
51 Correct 5 ms 9940 KB Output is correct
52 Correct 364 ms 90360 KB Output is correct
53 Correct 536 ms 86788 KB Output is correct
54 Correct 605 ms 107744 KB Output is correct
55 Correct 487 ms 88348 KB Output is correct
56 Correct 449 ms 88528 KB Output is correct
57 Correct 381 ms 88656 KB Output is correct
58 Correct 374 ms 88772 KB Output is correct
59 Correct 529 ms 103748 KB Output is correct
60 Correct 629 ms 106420 KB Output is correct
61 Correct 440 ms 90412 KB Output is correct
62 Correct 522 ms 88060 KB Output is correct
63 Correct 6 ms 9996 KB Output is correct
64 Correct 6 ms 9988 KB Output is correct
65 Correct 6 ms 9940 KB Output is correct
66 Correct 7 ms 9940 KB Output is correct
67 Correct 6 ms 10068 KB Output is correct
68 Correct 7 ms 9940 KB Output is correct
69 Correct 7 ms 9940 KB Output is correct
70 Correct 6 ms 9956 KB Output is correct
71 Correct 6 ms 9984 KB Output is correct
72 Correct 5 ms 9940 KB Output is correct
73 Correct 6 ms 9940 KB Output is correct
74 Correct 6 ms 9960 KB Output is correct
75 Correct 6 ms 9940 KB Output is correct
76 Correct 6 ms 9940 KB Output is correct
77 Correct 6 ms 9988 KB Output is correct
78 Correct 6 ms 9940 KB Output is correct
79 Correct 1064 ms 106576 KB Output is correct
80 Execution timed out 4097 ms 102264 KB Time limit exceeded
81 Halted 0 ms 0 KB -