oj.uz

답안 #551737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551737 2022-04-21T12:02:15 Z nonsensenonsense1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 108672 KB 
#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;
std::pair<int, int> 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++] = std::make_pair(dep[v], v);
	for (int i = 0; i < (int)g[v].size(); ++i) if (g[v][i] != pr[v]) {
		st[0][amt++] = std::make_pair(dep[v], v);
		pr[g[v][i]] = v;
		dep[g[v][i]] = dep[v] + 1;
		dfs(g[v][i]);
	}
	out[v] = dt;
}

int lca(int u, int v) {
	u = start[u];
	v = start[v];
	if (u > v) std::swap(u, v);
	++v;
	int l = 31 - __builtin_clz(v - u);
	return std::min(st[l][u], st[l][v - (1 << l)]).second;
}

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

void update(std::vector<int> &t, int l, int r, int x) {
	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 = 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;
				}
				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:73:131: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   73 |  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:87:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   87 |      int m = l + r >> 1;
      |              ~~^~~
sprinkler.cpp:94:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   94 |      int m = l + r >> 1;
      |              ~~^~~
sprinkler.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |  scanf("%d%d", &n, &md);
      |  ~~~~~^~~~~~~~~~~~~~~~~
sprinkler.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |   scanf("%d%d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~
sprinkler.cpp:74:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |  for (int i = 0; i < n; ++i) scanf("%d", h + i);
      |                              ~~~~~^~~~~~~~~~~~~
sprinkler.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
sprinkler.cpp:79:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |   scanf("%d%d", &type, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~
sprinkler.cpp:83:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |    scanf("%d%d", &dist, &x);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 10 ms 14676 KB Output is correct
5 Correct 11 ms 14676 KB Output is correct
6 Correct 11 ms 14736 KB Output is correct
7 Correct 9 ms 14676 KB Output is correct
8 Correct 9 ms 14736 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 11 ms 14420 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 8 ms 14452 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 8 ms 14380 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14392 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 11 ms 14364 KB Output is correct
25 Correct 10 ms 14332 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 11 ms 14368 KB Output is correct
28 Correct 9 ms 14360 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 501 ms 87236 KB Output is correct
3 Correct 1170 ms 84004 KB Output is correct
4 Correct 526 ms 98936 KB Output is correct
5 Correct 719 ms 85572 KB Output is correct
6 Correct 1008 ms 85260 KB Output is correct
7 Correct 944 ms 85536 KB Output is correct
8 Correct 686 ms 85976 KB Output is correct
9 Correct 530 ms 108672 KB Output is correct
10 Correct 595 ms 103524 KB Output is correct
11 Correct 510 ms 87124 KB Output is correct
12 Correct 1124 ms 84072 KB Output is correct
13 Correct 553 ms 84932 KB Output is correct
14 Correct 602 ms 84292 KB Output is correct
15 Correct 697 ms 84404 KB Output is correct
16 Correct 848 ms 84440 KB Output is correct
17 Correct 987 ms 84804 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14400 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 501 ms 87236 KB Output is correct
3 Correct 1170 ms 84004 KB Output is correct
4 Correct 526 ms 98936 KB Output is correct
5 Correct 719 ms 85572 KB Output is correct
6 Correct 1008 ms 85260 KB Output is correct
7 Correct 944 ms 85536 KB Output is correct
8 Correct 686 ms 85976 KB Output is correct
9 Correct 530 ms 108672 KB Output is correct
10 Correct 595 ms 103524 KB Output is correct
11 Correct 510 ms 87124 KB Output is correct
12 Correct 1124 ms 84072 KB Output is correct
13 Correct 553 ms 84932 KB Output is correct
14 Correct 602 ms 84292 KB Output is correct
15 Correct 697 ms 84404 KB Output is correct
16 Correct 848 ms 84440 KB Output is correct
17 Correct 987 ms 84804 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14400 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 542 ms 87100 KB Output is correct
25 Correct 1524 ms 83972 KB Output is correct
26 Correct 517 ms 105948 KB Output is correct
27 Correct 780 ms 85556 KB Output is correct
28 Correct 984 ms 85396 KB Output is correct
29 Correct 990 ms 85512 KB Output is correct
30 Correct 591 ms 86060 KB Output is correct
31 Correct 454 ms 101292 KB Output is correct
32 Correct 606 ms 103532 KB Output is correct
33 Correct 507 ms 87212 KB Output is correct
34 Correct 1480 ms 84020 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14420 KB Output is correct
37 Correct 8 ms 14420 KB Output is correct
38 Correct 8 ms 14420 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 7 ms 14420 KB Output is correct
41 Correct 8 ms 14420 KB Output is correct
42 Correct 7 ms 14420 KB Output is correct
43 Correct 7 ms 14420 KB Output is correct
44 Correct 7 ms 14452 KB Output is correct
45 Correct 8 ms 14432 KB Output is correct
46 Correct 7 ms 14420 KB Output is correct
47 Correct 9 ms 14420 KB Output is correct
48 Correct 7 ms 14420 KB Output is correct
49 Correct 8 ms 14420 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14348 KB Output is correct
2 Correct 611 ms 105476 KB Output is correct
3 Correct 2220 ms 99948 KB Output is correct
4 Correct 1077 ms 105888 KB Output is correct
5 Execution timed out 4098 ms 88892 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 657 ms 100156 KB Output is correct
3 Correct 2430 ms 94988 KB Output is correct
4 Correct 1058 ms 102944 KB Output is correct
5 Execution timed out 4091 ms 90544 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 10 ms 14676 KB Output is correct
5 Correct 11 ms 14676 KB Output is correct
6 Correct 11 ms 14736 KB Output is correct
7 Correct 9 ms 14676 KB Output is correct
8 Correct 9 ms 14736 KB Output is correct
9 Correct 8 ms 14436 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 11 ms 14420 KB Output is correct
17 Correct 9 ms 14420 KB Output is correct
18 Correct 8 ms 14452 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 8 ms 14380 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14392 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 11 ms 14364 KB Output is correct
25 Correct 10 ms 14332 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 11 ms 14368 KB Output is correct
28 Correct 9 ms 14360 KB Output is correct
29 Correct 8 ms 14420 KB Output is correct
30 Correct 501 ms 87236 KB Output is correct
31 Correct 1170 ms 84004 KB Output is correct
32 Correct 526 ms 98936 KB Output is correct
33 Correct 719 ms 85572 KB Output is correct
34 Correct 1008 ms 85260 KB Output is correct
35 Correct 944 ms 85536 KB Output is correct
36 Correct 686 ms 85976 KB Output is correct
37 Correct 530 ms 108672 KB Output is correct
38 Correct 595 ms 103524 KB Output is correct
39 Correct 510 ms 87124 KB Output is correct
40 Correct 1124 ms 84072 KB Output is correct
41 Correct 553 ms 84932 KB Output is correct
42 Correct 602 ms 84292 KB Output is correct
43 Correct 697 ms 84404 KB Output is correct
44 Correct 848 ms 84440 KB Output is correct
45 Correct 987 ms 84804 KB Output is correct
46 Correct 8 ms 14420 KB Output is correct
47 Correct 7 ms 14420 KB Output is correct
48 Correct 8 ms 14400 KB Output is correct
49 Correct 8 ms 14420 KB Output is correct
50 Correct 8 ms 14420 KB Output is correct
51 Correct 8 ms 14420 KB Output is correct
52 Correct 542 ms 87100 KB Output is correct
53 Correct 1524 ms 83972 KB Output is correct
54 Correct 517 ms 105948 KB Output is correct
55 Correct 780 ms 85556 KB Output is correct
56 Correct 984 ms 85396 KB Output is correct
57 Correct 990 ms 85512 KB Output is correct
58 Correct 591 ms 86060 KB Output is correct
59 Correct 454 ms 101292 KB Output is correct
60 Correct 606 ms 103532 KB Output is correct
61 Correct 507 ms 87212 KB Output is correct
62 Correct 1480 ms 84020 KB Output is correct
63 Correct 8 ms 14420 KB Output is correct
64 Correct 8 ms 14420 KB Output is correct
65 Correct 8 ms 14420 KB Output is correct
66 Correct 8 ms 14420 KB Output is correct
67 Correct 8 ms 14420 KB Output is correct
68 Correct 7 ms 14420 KB Output is correct
69 Correct 8 ms 14420 KB Output is correct
70 Correct 7 ms 14420 KB Output is correct
71 Correct 7 ms 14420 KB Output is correct
72 Correct 7 ms 14452 KB Output is correct
73 Correct 8 ms 14432 KB Output is correct
74 Correct 7 ms 14420 KB Output is correct
75 Correct 9 ms 14420 KB Output is correct
76 Correct 7 ms 14420 KB Output is correct
77 Correct 8 ms 14420 KB Output is correct
78 Correct 8 ms 14348 KB Output is correct
79 Correct 611 ms 105476 KB Output is correct
80 Correct 2220 ms 99948 KB Output is correct
81 Correct 1077 ms 105888 KB Output is correct
82 Execution timed out 4098 ms 88892 KB Time limit exceeded
83 Halted 0 ms 0 KB -