oj.uz

답안 #551745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551745 2022-04-21T12:12:16 Z nonsensenonsense1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 84088 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 = 200000;
const int LG = 19;
const int K = 500;
std::vector<int> g[N], list[N], t[N];
int q, n, dep[N], pr[N], pos[N], h[N], start[N], out[N], amt, st[LG][N * 2];

void dfs(int v) {
	static int dt = 0;
	++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]) {
		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 = 31 - __builtin_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 main() {
	scanf("%d%d", &n, &md);
	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; i >= dep[v] - dist; --i) {
				int l = 0, r = list[i].size();
				while (l < r) {
					int m = l + r >> 1;
					if (out[list[i][m]] >= out[v] || f(v, list[i][m]) <= dist) r = m;
					else l = m + 1;
				}
				int fi = r;
				l = r, r = list[i].size();
				while (l < r) {
					int m = l + r >> 1;
					if (out[list[i][m]] >= out[v] && f(v, list[i][m]) > dist) r = m;
					else l = m + 1;
				}
				update(t[i], fi, r, x);
			}
		} else printf("%d\n", mul(h[v], get(t[dep[v]], pos[v])));
	}
	return 0;
}

Compilation message

sprinkler.cpp: In function 'int main()':
sprinkler.cpp:81:131: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   81 |  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:95:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |      int m = l + r >> 1;
      |              ~~^~~
sprinkler.cpp:102:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |      int m = l + r >> 1;
      |              ~~^~~
sprinkler.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |  scanf("%d%d", &n, &md);
      |  ~~~~~^~~~~~~~~~~~~~~~~
sprinkler.cpp:76:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |   scanf("%d%d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~
sprinkler.cpp:82:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |  for (int i = 0; i < n; ++i) scanf("%d", h + i);
      |                              ~~~~~^~~~~~~~~~~~~
sprinkler.cpp:84:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
sprinkler.cpp:87:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |   scanf("%d%d", &type, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~
sprinkler.cpp:91:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |    scanf("%d%d", &dist, &x);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 9 ms 14420 KB Output is correct
4 Correct 11 ms 14716 KB Output is correct
5 Correct 11 ms 14676 KB Output is correct
6 Correct 11 ms 14556 KB Output is correct
7 Correct 14 ms 14548 KB Output is correct
8 Correct 10 ms 14548 KB Output is correct
9 Correct 9 ms 14324 KB Output is correct
10 Correct 10 ms 14420 KB Output is correct
11 Correct 9 ms 14456 KB Output is correct
12 Correct 11 ms 14420 KB Output is correct
13 Correct 11 ms 14352 KB Output is correct
14 Correct 11 ms 14420 KB Output is correct
15 Correct 12 ms 14420 KB Output is correct
16 Correct 9 ms 14444 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 9 ms 14420 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 14420 KB Output is correct
24 Correct 9 ms 14452 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 11 ms 14452 KB Output is correct
27 Correct 9 ms 14420 KB Output is correct
28 Correct 10 ms 14380 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14448 KB Output is correct
2 Correct 423 ms 59644 KB Output is correct
3 Correct 989 ms 56300 KB Output is correct
4 Correct 497 ms 73176 KB Output is correct
5 Correct 679 ms 58060 KB Output is correct
6 Correct 802 ms 57596 KB Output is correct
7 Correct 859 ms 57764 KB Output is correct
8 Correct 657 ms 58236 KB Output is correct
9 Correct 438 ms 84088 KB Output is correct
10 Correct 557 ms 78536 KB Output is correct
11 Correct 494 ms 59468 KB Output is correct
12 Correct 1002 ms 56392 KB Output is correct
13 Correct 500 ms 57264 KB Output is correct
14 Correct 657 ms 56620 KB Output is correct
15 Correct 705 ms 56924 KB Output is correct
16 Correct 809 ms 56764 KB Output is correct
17 Correct 944 ms 57160 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 14420 KB Output is correct
21 Correct 9 ms 14460 KB Output is correct
22 Correct 9 ms 14356 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14448 KB Output is correct
2 Correct 423 ms 59644 KB Output is correct
3 Correct 989 ms 56300 KB Output is correct
4 Correct 497 ms 73176 KB Output is correct
5 Correct 679 ms 58060 KB Output is correct
6 Correct 802 ms 57596 KB Output is correct
7 Correct 859 ms 57764 KB Output is correct
8 Correct 657 ms 58236 KB Output is correct
9 Correct 438 ms 84088 KB Output is correct
10 Correct 557 ms 78536 KB Output is correct
11 Correct 494 ms 59468 KB Output is correct
12 Correct 1002 ms 56392 KB Output is correct
13 Correct 500 ms 57264 KB Output is correct
14 Correct 657 ms 56620 KB Output is correct
15 Correct 705 ms 56924 KB Output is correct
16 Correct 809 ms 56764 KB Output is correct
17 Correct 944 ms 57160 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 14420 KB Output is correct
21 Correct 9 ms 14460 KB Output is correct
22 Correct 9 ms 14356 KB Output is correct
23 Correct 10 ms 14548 KB Output is correct
24 Correct 507 ms 59456 KB Output is correct
25 Correct 1260 ms 56340 KB Output is correct
26 Correct 510 ms 81188 KB Output is correct
27 Correct 706 ms 57876 KB Output is correct
28 Correct 1012 ms 57832 KB Output is correct
29 Correct 999 ms 57824 KB Output is correct
30 Correct 684 ms 58212 KB Output is correct
31 Correct 494 ms 75540 KB Output is correct
32 Correct 631 ms 78540 KB Output is correct
33 Correct 506 ms 59580 KB Output is correct
34 Correct 1278 ms 56396 KB Output is correct
35 Correct 9 ms 14420 KB Output is correct
36 Correct 10 ms 14456 KB Output is correct
37 Correct 11 ms 14344 KB Output is correct
38 Correct 9 ms 14344 KB Output is correct
39 Correct 11 ms 14396 KB Output is correct
40 Correct 10 ms 14420 KB Output is correct
41 Correct 10 ms 14420 KB Output is correct
42 Correct 9 ms 14456 KB Output is correct
43 Correct 9 ms 14420 KB Output is correct
44 Correct 8 ms 14420 KB Output is correct
45 Correct 8 ms 14400 KB Output is correct
46 Correct 9 ms 14400 KB Output is correct
47 Correct 9 ms 14408 KB Output is correct
48 Correct 9 ms 14512 KB Output is correct
49 Correct 9 ms 14384 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 634 ms 80820 KB Output is correct
3 Correct 1920 ms 73488 KB Output is correct
4 Correct 931 ms 75184 KB Output is correct
5 Execution timed out 4083 ms 56268 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 605 ms 74424 KB Output is correct
3 Correct 2004 ms 67520 KB Output is correct
4 Correct 904 ms 71692 KB Output is correct
5 Correct 3883 ms 57884 KB Output is correct
6 Correct 3526 ms 57864 KB Output is correct
7 Correct 2676 ms 57636 KB Output is correct
8 Correct 569 ms 58008 KB Output is correct
9 Correct 692 ms 81828 KB Output is correct
10 Correct 2434 ms 79000 KB Output is correct
11 Correct 2072 ms 59396 KB Output is correct
12 Execution timed out 4088 ms 56024 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Correct 9 ms 14420 KB Output is correct
4 Correct 11 ms 14716 KB Output is correct
5 Correct 11 ms 14676 KB Output is correct
6 Correct 11 ms 14556 KB Output is correct
7 Correct 14 ms 14548 KB Output is correct
8 Correct 10 ms 14548 KB Output is correct
9 Correct 9 ms 14324 KB Output is correct
10 Correct 10 ms 14420 KB Output is correct
11 Correct 9 ms 14456 KB Output is correct
12 Correct 11 ms 14420 KB Output is correct
13 Correct 11 ms 14352 KB Output is correct
14 Correct 11 ms 14420 KB Output is correct
15 Correct 12 ms 14420 KB Output is correct
16 Correct 9 ms 14444 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 9 ms 14420 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 14420 KB Output is correct
24 Correct 9 ms 14452 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 11 ms 14452 KB Output is correct
27 Correct 9 ms 14420 KB Output is correct
28 Correct 10 ms 14380 KB Output is correct
29 Correct 9 ms 14448 KB Output is correct
30 Correct 423 ms 59644 KB Output is correct
31 Correct 989 ms 56300 KB Output is correct
32 Correct 497 ms 73176 KB Output is correct
33 Correct 679 ms 58060 KB Output is correct
34 Correct 802 ms 57596 KB Output is correct
35 Correct 859 ms 57764 KB Output is correct
36 Correct 657 ms 58236 KB Output is correct
37 Correct 438 ms 84088 KB Output is correct
38 Correct 557 ms 78536 KB Output is correct
39 Correct 494 ms 59468 KB Output is correct
40 Correct 1002 ms 56392 KB Output is correct
41 Correct 500 ms 57264 KB Output is correct
42 Correct 657 ms 56620 KB Output is correct
43 Correct 705 ms 56924 KB Output is correct
44 Correct 809 ms 56764 KB Output is correct
45 Correct 944 ms 57160 KB Output is correct
46 Correct 8 ms 14420 KB Output is correct
47 Correct 9 ms 14420 KB Output is correct
48 Correct 9 ms 14420 KB Output is correct
49 Correct 9 ms 14460 KB Output is correct
50 Correct 9 ms 14356 KB Output is correct
51 Correct 10 ms 14548 KB Output is correct
52 Correct 507 ms 59456 KB Output is correct
53 Correct 1260 ms 56340 KB Output is correct
54 Correct 510 ms 81188 KB Output is correct
55 Correct 706 ms 57876 KB Output is correct
56 Correct 1012 ms 57832 KB Output is correct
57 Correct 999 ms 57824 KB Output is correct
58 Correct 684 ms 58212 KB Output is correct
59 Correct 494 ms 75540 KB Output is correct
60 Correct 631 ms 78540 KB Output is correct
61 Correct 506 ms 59580 KB Output is correct
62 Correct 1278 ms 56396 KB Output is correct
63 Correct 9 ms 14420 KB Output is correct
64 Correct 10 ms 14456 KB Output is correct
65 Correct 11 ms 14344 KB Output is correct
66 Correct 9 ms 14344 KB Output is correct
67 Correct 11 ms 14396 KB Output is correct
68 Correct 10 ms 14420 KB Output is correct
69 Correct 10 ms 14420 KB Output is correct
70 Correct 9 ms 14456 KB Output is correct
71 Correct 9 ms 14420 KB Output is correct
72 Correct 8 ms 14420 KB Output is correct
73 Correct 8 ms 14400 KB Output is correct
74 Correct 9 ms 14400 KB Output is correct
75 Correct 9 ms 14408 KB Output is correct
76 Correct 9 ms 14512 KB Output is correct
77 Correct 9 ms 14384 KB Output is correct
78 Correct 9 ms 14420 KB Output is correct
79 Correct 634 ms 80820 KB Output is correct
80 Correct 1920 ms 73488 KB Output is correct
81 Correct 931 ms 75184 KB Output is correct
82 Execution timed out 4083 ms 56268 KB Time limit exceeded
83 Halted 0 ms 0 KB -