oj.uz

답안 #551743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551743 2022-04-21T12:09:57 Z nonsensenonsense1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 84160 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) {
	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:74:131: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   74 |  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:88:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |      int m = l + r >> 1;
      |              ~~^~~
sprinkler.cpp:95:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |      int m = l + r >> 1;
      |              ~~^~~
sprinkler.cpp:66:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  scanf("%d%d", &n, &md);
      |  ~~~~~^~~~~~~~~~~~~~~~~
sprinkler.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |   scanf("%d%d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~
sprinkler.cpp:75:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |  for (int i = 0; i < n; ++i) scanf("%d", h + i);
      |                              ~~~~~^~~~~~~~~~~~~
sprinkler.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
sprinkler.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |   scanf("%d%d", &type, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~
sprinkler.cpp:84:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |    scanf("%d%d", &dist, &x);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 9 ms 14340 KB Output is correct
3 Correct 8 ms 14452 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 10 ms 14548 KB Output is correct
8 Correct 16 ms 14548 KB Output is correct
9 Correct 11 ms 14420 KB Output is correct
10 Correct 16 ms 14420 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 10 ms 14464 KB Output is correct
13 Correct 10 ms 14460 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 9 ms 14424 KB Output is correct
16 Correct 10 ms 14420 KB Output is correct
17 Correct 10 ms 14420 KB Output is correct
18 Correct 9 ms 14356 KB Output is correct
19 Correct 12 ms 14368 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 14420 KB Output is correct
25 Correct 9 ms 14444 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 9 ms 14440 KB Output is correct
28 Correct 9 ms 14464 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14448 KB Output is correct
2 Correct 491 ms 59452 KB Output is correct
3 Correct 963 ms 56344 KB Output is correct
4 Correct 502 ms 73056 KB Output is correct
5 Correct 623 ms 57932 KB Output is correct
6 Correct 795 ms 57672 KB Output is correct
7 Correct 893 ms 57948 KB Output is correct
8 Correct 637 ms 58252 KB Output is correct
9 Correct 472 ms 84160 KB Output is correct
10 Correct 575 ms 78476 KB Output is correct
11 Correct 444 ms 59396 KB Output is correct
12 Correct 949 ms 56472 KB Output is correct
13 Correct 502 ms 57264 KB Output is correct
14 Correct 626 ms 56600 KB Output is correct
15 Correct 706 ms 56820 KB Output is correct
16 Correct 847 ms 56692 KB Output is correct
17 Correct 891 ms 57068 KB Output is correct
18 Correct 10 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 9 ms 14436 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 9 ms 14456 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14448 KB Output is correct
2 Correct 491 ms 59452 KB Output is correct
3 Correct 963 ms 56344 KB Output is correct
4 Correct 502 ms 73056 KB Output is correct
5 Correct 623 ms 57932 KB Output is correct
6 Correct 795 ms 57672 KB Output is correct
7 Correct 893 ms 57948 KB Output is correct
8 Correct 637 ms 58252 KB Output is correct
9 Correct 472 ms 84160 KB Output is correct
10 Correct 575 ms 78476 KB Output is correct
11 Correct 444 ms 59396 KB Output is correct
12 Correct 949 ms 56472 KB Output is correct
13 Correct 502 ms 57264 KB Output is correct
14 Correct 626 ms 56600 KB Output is correct
15 Correct 706 ms 56820 KB Output is correct
16 Correct 847 ms 56692 KB Output is correct
17 Correct 891 ms 57068 KB Output is correct
18 Correct 10 ms 14420 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 9 ms 14436 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 9 ms 14456 KB Output is correct
23 Correct 9 ms 14352 KB Output is correct
24 Correct 495 ms 59420 KB Output is correct
25 Correct 1319 ms 56408 KB Output is correct
26 Correct 538 ms 81088 KB Output is correct
27 Correct 746 ms 57884 KB Output is correct
28 Correct 935 ms 57724 KB Output is correct
29 Correct 964 ms 57788 KB Output is correct
30 Correct 608 ms 58184 KB Output is correct
31 Correct 459 ms 75624 KB Output is correct
32 Correct 633 ms 78652 KB Output is correct
33 Correct 478 ms 59532 KB Output is correct
34 Correct 1223 ms 56344 KB Output is correct
35 Correct 10 ms 14420 KB Output is correct
36 Correct 10 ms 14420 KB Output is correct
37 Correct 9 ms 14420 KB Output is correct
38 Correct 9 ms 14420 KB Output is correct
39 Correct 9 ms 14364 KB Output is correct
40 Correct 9 ms 14400 KB Output is correct
41 Correct 9 ms 14332 KB Output is correct
42 Correct 9 ms 14460 KB Output is correct
43 Correct 9 ms 14420 KB Output is correct
44 Correct 9 ms 14420 KB Output is correct
45 Correct 8 ms 14420 KB Output is correct
46 Correct 10 ms 14420 KB Output is correct
47 Correct 9 ms 14452 KB Output is correct
48 Correct 10 ms 14436 KB Output is correct
49 Correct 10 ms 14420 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14388 KB Output is correct
2 Correct 598 ms 80952 KB Output is correct
3 Correct 1922 ms 73568 KB Output is correct
4 Correct 925 ms 75300 KB Output is correct
5 Execution timed out 4053 ms 56560 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14420 KB Output is correct
2 Correct 626 ms 74516 KB Output is correct
3 Correct 2202 ms 67700 KB Output is correct
4 Correct 947 ms 71644 KB Output is correct
5 Execution timed out 4070 ms 57760 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 9 ms 14340 KB Output is correct
3 Correct 8 ms 14452 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 10 ms 14548 KB Output is correct
8 Correct 16 ms 14548 KB Output is correct
9 Correct 11 ms 14420 KB Output is correct
10 Correct 16 ms 14420 KB Output is correct
11 Correct 9 ms 14420 KB Output is correct
12 Correct 10 ms 14464 KB Output is correct
13 Correct 10 ms 14460 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 9 ms 14424 KB Output is correct
16 Correct 10 ms 14420 KB Output is correct
17 Correct 10 ms 14420 KB Output is correct
18 Correct 9 ms 14356 KB Output is correct
19 Correct 12 ms 14368 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 14420 KB Output is correct
25 Correct 9 ms 14444 KB Output is correct
26 Correct 9 ms 14420 KB Output is correct
27 Correct 9 ms 14440 KB Output is correct
28 Correct 9 ms 14464 KB Output is correct
29 Correct 9 ms 14448 KB Output is correct
30 Correct 491 ms 59452 KB Output is correct
31 Correct 963 ms 56344 KB Output is correct
32 Correct 502 ms 73056 KB Output is correct
33 Correct 623 ms 57932 KB Output is correct
34 Correct 795 ms 57672 KB Output is correct
35 Correct 893 ms 57948 KB Output is correct
36 Correct 637 ms 58252 KB Output is correct
37 Correct 472 ms 84160 KB Output is correct
38 Correct 575 ms 78476 KB Output is correct
39 Correct 444 ms 59396 KB Output is correct
40 Correct 949 ms 56472 KB Output is correct
41 Correct 502 ms 57264 KB Output is correct
42 Correct 626 ms 56600 KB Output is correct
43 Correct 706 ms 56820 KB Output is correct
44 Correct 847 ms 56692 KB Output is correct
45 Correct 891 ms 57068 KB Output is correct
46 Correct 10 ms 14420 KB Output is correct
47 Correct 9 ms 14420 KB Output is correct
48 Correct 9 ms 14436 KB Output is correct
49 Correct 9 ms 14420 KB Output is correct
50 Correct 9 ms 14456 KB Output is correct
51 Correct 9 ms 14352 KB Output is correct
52 Correct 495 ms 59420 KB Output is correct
53 Correct 1319 ms 56408 KB Output is correct
54 Correct 538 ms 81088 KB Output is correct
55 Correct 746 ms 57884 KB Output is correct
56 Correct 935 ms 57724 KB Output is correct
57 Correct 964 ms 57788 KB Output is correct
58 Correct 608 ms 58184 KB Output is correct
59 Correct 459 ms 75624 KB Output is correct
60 Correct 633 ms 78652 KB Output is correct
61 Correct 478 ms 59532 KB Output is correct
62 Correct 1223 ms 56344 KB Output is correct
63 Correct 10 ms 14420 KB Output is correct
64 Correct 10 ms 14420 KB Output is correct
65 Correct 9 ms 14420 KB Output is correct
66 Correct 9 ms 14420 KB Output is correct
67 Correct 9 ms 14364 KB Output is correct
68 Correct 9 ms 14400 KB Output is correct
69 Correct 9 ms 14332 KB Output is correct
70 Correct 9 ms 14460 KB Output is correct
71 Correct 9 ms 14420 KB Output is correct
72 Correct 9 ms 14420 KB Output is correct
73 Correct 8 ms 14420 KB Output is correct
74 Correct 10 ms 14420 KB Output is correct
75 Correct 9 ms 14452 KB Output is correct
76 Correct 10 ms 14436 KB Output is correct
77 Correct 10 ms 14420 KB Output is correct
78 Correct 9 ms 14388 KB Output is correct
79 Correct 598 ms 80952 KB Output is correct
80 Correct 1922 ms 73568 KB Output is correct
81 Correct 925 ms 75300 KB Output is correct
82 Execution timed out 4053 ms 56560 KB Time limit exceeded
83 Halted 0 ms 0 KB -