oj.uz

Submission #551758

# Submission time Handle Problem Language Result Execution time Memory
551758 2022-04-21T12:55:11 Z nonsensenonsense1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 86124 KB 
#pragma GCC optimize("O3,unroll-loops")
#include <cstdio>
#include <vector>

int md;
inline int mul(int a, int b) {
	return (long long)a * b % md;
}

const int N = 200005;
const int LG = 19;
const int K = 500;
std::vector<int> g[N], list[N], t[N];
int q, n, in[N], dep[N], pr[N], pos[N], h[N], start[N], out[N], amt, st[LG][N * 2], clz[N * 2];

void dfs(int v) {
	static int dt = 0;
	in[v] = dt++;
	pos[v] = list[dep[v]].size();
	list[dep[v]].push_back(v);
	start[v] = amt;
	st[0][amt++] = dep[v];
	for (int i = 0; i < (int)g[v].size(); ++i) if (g[v][i] != pr[v]) {
		if (i) st[0][amt++] = dep[v];
		pr[g[v][i]] = v;
		dep[g[v][i]] = dep[v] + 1;
		dfs(g[v][i]);
	}
	out[v] = dt;
}

int l;
int dlca(int u, int v) {
	u = start[u];
	v = start[v];
	if (u > v) std::swap(u, v);
	++v;
	l = clz[v - u];
	return std::min(st[l][u], st[l][v - (1 << l)]);
}

int f(int u, int v) {
	return dep[u] + dep[v] - 2 * dlca(u, v);
}

void update(std::vector<int> &t, int l, int r, int x) {
	if (!x) {
		for (l += t.size() >> 1, r += t.size() >> 1; l < r; l >>= 1, r >>= 1) {
			if (l & 1) t[l++] = 0;
			if (r & 1) t[--r] = 0;
		}
		return;
	}
	for (l += t.size() >> 1, r += t.size() >> 1; l < r; l >>= 1, r >>= 1) {
		if (l & 1) {
			t[l] = mul(t[l], x);
			++l;
		}
		if (r & 1) {
			--r;
			t[r] = mul(t[r], x);
		}
	}
}

int get(std::vector<int> &t, int i) {
	int res = 1;
	for (i += t.size() >> 1; i > 0; i >>= 1) res = mul(res, t[i]);
	return res;
}

int sub_left(int v, int dep) {
	int l = 0, r = (int)list[dep].size();
	while (l < r) {
		int m = l + r >> 1;
		if (in[list[dep][m]] >= in[v]) r = m;
		else l = m + 1;
	}
	return r;
}

int sub_right(int v, int dep) {
	int l = 0, r = (int)list[dep].size();
	while (l < r) {
		int m = l + r >> 1;
		if (out[list[dep][m]] > out[v]) r = m;
		else l = m + 1;
	}
	return r;
}

int main() {
	scanf("%d%d", &n, &md);
	clz[1] = 0;
	for (int i = 2; i <= 2 * n; ++i) {
		clz[i] = clz[i - 1];
		while (1 << clz[i] + 1 <= i) ++clz[i];
	}
	for (int i = 1; i < n; ++i) {
		int a, b;
		scanf("%d%d", &a, &b);
		g[a - 1].push_back(b - 1);
		g[b - 1].push_back(a - 1);
	}
	dfs(0);
	for (int j = 1; j < LG; ++j) for (int i = 0; i + (1 << j) <= 2 * n; ++i) st[j][i] = std::min(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
	for (int i = 0; i < n; ++i) scanf("%d", h + i);
	for (int i = 0; i < n; ++i) t[i].resize(list[i].size() << 1, 1);
	scanf("%d", &q);
	while (q--) {
		int type, v;
		scanf("%d%d", &type, &v);
		--v;
		if (type == 1) {
			int dist, x;
			scanf("%d%d", &dist, &x);
			for (int i = dep[v] + dist, j = v; i >= std::max(0, dep[v] - dist); --i) {
				while (j && dep[v] + i - 2 * (dep[j] - 1) <= dist) j = pr[j];
				int l = sub_left(j, i), r = sub_right(j, i);
				update(t[i], l, r, x);
			}
		} else printf("%d\n", mul(h[v], get(t[dep[v]], pos[v])));
	}
	return 0;
}

Compilation message

sprinkler.cpp: In function 'int sub_left(int, int)':
sprinkler.cpp:75:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   75 |   int m = l + r >> 1;
      |           ~~^~~
sprinkler.cpp: In function 'int sub_right(int, int)':
sprinkler.cpp:85:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   85 |   int m = l + r >> 1;
      |           ~~^~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:97:22: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   97 |   while (1 << clz[i] + 1 <= i) ++clz[i];
      |               ~~~~~~~^~~
sprinkler.cpp:106:131: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  106 |  for (int j = 1; j < LG; ++j) for (int i = 0; i + (1 << j) <= 2 * n; ++i) st[j][i] = std::min(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
      |                                                                                                                                 ~~^~~
sprinkler.cpp:93:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |  scanf("%d%d", &n, &md);
      |  ~~~~~^~~~~~~~~~~~~~~~~
sprinkler.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |   scanf("%d%d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~
sprinkler.cpp:107:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |  for (int i = 0; i < n; ++i) scanf("%d", h + i);
      |                              ~~~~~^~~~~~~~~~~~~
sprinkler.cpp:109:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
sprinkler.cpp:112:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |   scanf("%d%d", &type, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~
sprinkler.cpp:116:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |    scanf("%d%d", &dist, &x);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 9 ms 14432 KB Output is correct
3 Correct 9 ms 14444 KB Output is correct
4 Correct 10 ms 14676 KB Output is correct
5 Correct 11 ms 14548 KB Output is correct
6 Correct 11 ms 14548 KB Output is correct
7 Correct 9 ms 14632 KB Output is correct
8 Correct 9 ms 14656 KB Output is correct
9 Correct 9 ms 14452 KB Output is correct
10 Correct 10 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 11 ms 14368 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 9 ms 14420 KB Output is correct
17 Correct 9 ms 14388 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 9 ms 14452 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct
23 Correct 9 ms 14396 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 9 ms 14396 KB Output is correct
28 Correct 12 ms 14460 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 440 ms 61512 KB Output is correct
3 Correct 643 ms 58400 KB Output is correct
4 Correct 508 ms 75200 KB Output is correct
5 Correct 520 ms 59964 KB Output is correct
6 Correct 597 ms 59624 KB Output is correct
7 Correct 545 ms 60156 KB Output is correct
8 Correct 488 ms 60628 KB Output is correct
9 Correct 456 ms 86124 KB Output is correct
10 Correct 555 ms 80428 KB Output is correct
11 Correct 417 ms 61452 KB Output is correct
12 Correct 704 ms 58364 KB Output is correct
13 Correct 411 ms 59708 KB Output is correct
14 Correct 412 ms 58948 KB Output is correct
15 Correct 437 ms 59212 KB Output is correct
16 Correct 469 ms 58928 KB Output is correct
17 Correct 608 ms 59516 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 10 ms 14404 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 440 ms 61512 KB Output is correct
3 Correct 643 ms 58400 KB Output is correct
4 Correct 508 ms 75200 KB Output is correct
5 Correct 520 ms 59964 KB Output is correct
6 Correct 597 ms 59624 KB Output is correct
7 Correct 545 ms 60156 KB Output is correct
8 Correct 488 ms 60628 KB Output is correct
9 Correct 456 ms 86124 KB Output is correct
10 Correct 555 ms 80428 KB Output is correct
11 Correct 417 ms 61452 KB Output is correct
12 Correct 704 ms 58364 KB Output is correct
13 Correct 411 ms 59708 KB Output is correct
14 Correct 412 ms 58948 KB Output is correct
15 Correct 437 ms 59212 KB Output is correct
16 Correct 469 ms 58928 KB Output is correct
17 Correct 608 ms 59516 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 10 ms 14404 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 391 ms 61472 KB Output is correct
25 Correct 804 ms 58568 KB Output is correct
26 Correct 507 ms 83152 KB Output is correct
27 Correct 521 ms 59896 KB Output is correct
28 Correct 682 ms 59820 KB Output is correct
29 Correct 727 ms 59932 KB Output is correct
30 Correct 463 ms 60552 KB Output is correct
31 Correct 440 ms 77512 KB Output is correct
32 Correct 531 ms 80604 KB Output is correct
33 Correct 482 ms 61572 KB Output is correct
34 Correct 831 ms 58364 KB Output is correct
35 Correct 9 ms 14420 KB Output is correct
36 Correct 9 ms 14448 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 11 ms 14468 KB Output is correct
39 Correct 9 ms 14348 KB Output is correct
40 Correct 9 ms 14408 KB Output is correct
41 Correct 8 ms 14420 KB Output is correct
42 Correct 10 ms 14548 KB Output is correct
43 Correct 9 ms 14420 KB Output is correct
44 Correct 9 ms 14464 KB Output is correct
45 Correct 9 ms 14420 KB Output is correct
46 Correct 9 ms 14464 KB Output is correct
47 Correct 8 ms 14420 KB Output is correct
48 Correct 9 ms 14420 KB Output is correct
49 Correct 9 ms 14420 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 600 ms 82788 KB Output is correct
3 Correct 1603 ms 75556 KB Output is correct
4 Correct 814 ms 77064 KB Output is correct
5 Correct 2407 ms 58472 KB Output is correct
6 Correct 1735 ms 58440 KB Output is correct
7 Correct 1088 ms 58400 KB Output is correct
8 Correct 359 ms 59048 KB Output is correct
9 Correct 541 ms 75068 KB Output is correct
10 Correct 1456 ms 79764 KB Output is correct
11 Correct 1107 ms 58808 KB Output is correct
12 Execution timed out 4078 ms 59440 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 654 ms 76392 KB Output is correct
3 Correct 1905 ms 69460 KB Output is correct
4 Correct 889 ms 73704 KB Output is correct
5 Correct 2254 ms 60064 KB Output is correct
6 Correct 1688 ms 59976 KB Output is correct
7 Correct 1113 ms 59860 KB Output is correct
8 Correct 422 ms 60376 KB Output is correct
9 Correct 671 ms 83780 KB Output is correct
10 Correct 1795 ms 81100 KB Output is correct
11 Correct 1196 ms 61688 KB Output is correct
12 Execution timed out 4062 ms 59500 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 9 ms 14432 KB Output is correct
3 Correct 9 ms 14444 KB Output is correct
4 Correct 10 ms 14676 KB Output is correct
5 Correct 11 ms 14548 KB Output is correct
6 Correct 11 ms 14548 KB Output is correct
7 Correct 9 ms 14632 KB Output is correct
8 Correct 9 ms 14656 KB Output is correct
9 Correct 9 ms 14452 KB Output is correct
10 Correct 10 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 11 ms 14368 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 9 ms 14420 KB Output is correct
17 Correct 9 ms 14388 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 9 ms 14452 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct
23 Correct 9 ms 14396 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 9 ms 14396 KB Output is correct
28 Correct 12 ms 14460 KB Output is correct
29 Correct 10 ms 14420 KB Output is correct
30 Correct 440 ms 61512 KB Output is correct
31 Correct 643 ms 58400 KB Output is correct
32 Correct 508 ms 75200 KB Output is correct
33 Correct 520 ms 59964 KB Output is correct
34 Correct 597 ms 59624 KB Output is correct
35 Correct 545 ms 60156 KB Output is correct
36 Correct 488 ms 60628 KB Output is correct
37 Correct 456 ms 86124 KB Output is correct
38 Correct 555 ms 80428 KB Output is correct
39 Correct 417 ms 61452 KB Output is correct
40 Correct 704 ms 58364 KB Output is correct
41 Correct 411 ms 59708 KB Output is correct
42 Correct 412 ms 58948 KB Output is correct
43 Correct 437 ms 59212 KB Output is correct
44 Correct 469 ms 58928 KB Output is correct
45 Correct 608 ms 59516 KB Output is correct
46 Correct 8 ms 14420 KB Output is correct
47 Correct 9 ms 14420 KB Output is correct
48 Correct 8 ms 14464 KB Output is correct
49 Correct 9 ms 14420 KB Output is correct
50 Correct 10 ms 14404 KB Output is correct
51 Correct 8 ms 14420 KB Output is correct
52 Correct 391 ms 61472 KB Output is correct
53 Correct 804 ms 58568 KB Output is correct
54 Correct 507 ms 83152 KB Output is correct
55 Correct 521 ms 59896 KB Output is correct
56 Correct 682 ms 59820 KB Output is correct
57 Correct 727 ms 59932 KB Output is correct
58 Correct 463 ms 60552 KB Output is correct
59 Correct 440 ms 77512 KB Output is correct
60 Correct 531 ms 80604 KB Output is correct
61 Correct 482 ms 61572 KB Output is correct
62 Correct 831 ms 58364 KB Output is correct
63 Correct 9 ms 14420 KB Output is correct
64 Correct 9 ms 14448 KB Output is correct
65 Correct 10 ms 14412 KB Output is correct
66 Correct 11 ms 14468 KB Output is correct
67 Correct 9 ms 14348 KB Output is correct
68 Correct 9 ms 14408 KB Output is correct
69 Correct 8 ms 14420 KB Output is correct
70 Correct 10 ms 14548 KB Output is correct
71 Correct 9 ms 14420 KB Output is correct
72 Correct 9 ms 14464 KB Output is correct
73 Correct 9 ms 14420 KB Output is correct
74 Correct 9 ms 14464 KB Output is correct
75 Correct 8 ms 14420 KB Output is correct
76 Correct 9 ms 14420 KB Output is correct
77 Correct 9 ms 14420 KB Output is correct
78 Correct 8 ms 14420 KB Output is correct
79 Correct 600 ms 82788 KB Output is correct
80 Correct 1603 ms 75556 KB Output is correct
81 Correct 814 ms 77064 KB Output is correct
82 Correct 2407 ms 58472 KB Output is correct
83 Correct 1735 ms 58440 KB Output is correct
84 Correct 1088 ms 58400 KB Output is correct
85 Correct 359 ms 59048 KB Output is correct
86 Correct 541 ms 75068 KB Output is correct
87 Correct 1456 ms 79764 KB Output is correct
88 Correct 1107 ms 58808 KB Output is correct
89 Execution timed out 4078 ms 59440 KB Time limit exceeded
90 Halted 0 ms 0 KB -