oj.uz

답안 #615448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615448 2022-07-31T09:18:12 Z 장태환(#8493) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 71340 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int N, L;
int qs, qe, n;
struct st
{
	vector<long long>r;
	int treeN;
	void init(int cnt)
	{
		for (treeN = 1; treeN < cnt; treeN *= 2);
		r.resize(2 * treeN + 3, 1);
	}
	void upd(int s, int e, int i = 1)
	{
		if (s > qe || qs > e)
			return;
		if (qs <= s && e <= qe)
		{
			r[i] *= n;
			if (r[i] >= L)
				r[i] %= L;
			return;
		}
		upd(s, (s + e) / 2, i * 2);
		upd((s + e) / 2 + 1, e, i * 2 + 1);
	}
	int ge(int qs, int qe, int n, int i = 1)
	{
		if (qs == qe)
		{
			return r[i];
		}
		int m = (qs + qe) / 2;
		if (n > m)
		{
			return r[i] * ge(m + 1, qe, n, i * 2 + 1) % L;
		}
		else
		{
			return r[i] * ge(qs, m, n, i * 2) % L;
		}
	}
}arr[200100];
int d[201000];
int pos[200100];
int par[200100];
int st[201000];
int en[200100];
int c;
vector<int>li[201000];
vector<pair<int, int>>dl[200100];
vector<int>dl2[200100];
void dfs(int n, int p = 0)
{
	st[n] = ++c;
	dl[d[n]].push_back({ st[n],n });
	dl2[d[n]].push_back(st[n]);
	int i;
	for (i = 0; i < li[n].size(); i++)
	{
		if (li[n][i] == p)
			continue;
		par[li[n][i]] = n;
		d[li[n][i]] = d[n] + 1;
		dfs(li[n][i], n);
	}
	en[n] = c;
}
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> N >> L;
	int i;
	for (i = 1; i < N; i++)
	{
		int a, b;
		cin >> a >> b;
		li[a].push_back(b);
		li[b].push_back(a);
	}
	dfs(1);
	for (i = 0; i <= N; i++)
	{
		arr[i].init(dl[i].size());
		int j;
		for (j = 0; j < dl[i].size(); j++)
		{
			pos[dl[i][j].second] = j;
		}
	}
	for (i = 1; i <= N; i++)
	{
		int a;
		cin >> a;
		arr[d[i]].r[pos[i] + arr[d[i]].treeN] = a;
	}
	int Q;
	cin >> Q;
	while (Q--)
	{
		int a;
		cin >> a;
		if (a == 1)
		{
			int b, c, w;
			cin >> b >> c >> w;
			int j;
			int dp = d[b];
			int cp = b;
			for (j = dp + c; j >= dp - c; j--)
			{
				if (j + dp - d[cp] * 2 + 2 <= c && cp != 1)
				{
					cp = par[cp];
				}
				if (j < 0)
					break;
				int lp = lower_bound(dl2[j].begin(), dl2[j].end(), st[cp]) - dl2[j].begin();
				if (lp != dl2[j].size() && dl2[j][lp] <= en[cp])
				{
					int rp = lower_bound(dl2[j].begin(), dl2[j].end(), en[cp] + 1) - dl2[j].begin() - 1;
					qs = lp;
					qe = rp;
					n = w;
					arr[j].upd(0, arr[j].treeN - 1);
				}

			}
		}
		else
		{
			int b;
			cin >> b;
			cout << arr[d[b]].ge(0, arr[d[b]].treeN - 1, pos[b]) << '\n';
		}
	}

}

Compilation message

sprinkler.cpp: In function 'void dfs(int, int)':
sprinkler.cpp:62:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for (i = 0; i < li[n].size(); i++)
      |              ~~^~~~~~~~~~~~~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:91:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |   for (j = 0; j < dl[i].size(); j++)
      |               ~~^~~~~~~~~~~~~~
sprinkler.cpp:124:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |     if (lp != dl2[j].size() && dl2[j][lp] <= en[cp])
      |         ~~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20692 KB Output is correct
2 Correct 11 ms 20636 KB Output is correct
3 Correct 10 ms 20732 KB Output is correct
4 Correct 11 ms 20820 KB Output is correct
5 Correct 12 ms 20836 KB Output is correct
6 Correct 14 ms 20860 KB Output is correct
7 Correct 11 ms 20808 KB Output is correct
8 Correct 11 ms 20820 KB Output is correct
9 Correct 10 ms 20740 KB Output is correct
10 Correct 10 ms 20732 KB Output is correct
11 Correct 11 ms 20692 KB Output is correct
12 Correct 10 ms 20692 KB Output is correct
13 Correct 12 ms 20652 KB Output is correct
14 Correct 10 ms 20724 KB Output is correct
15 Correct 10 ms 20692 KB Output is correct
16 Correct 10 ms 20692 KB Output is correct
17 Correct 11 ms 20692 KB Output is correct
18 Correct 13 ms 20692 KB Output is correct
19 Correct 10 ms 20696 KB Output is correct
20 Correct 10 ms 20736 KB Output is correct
21 Correct 12 ms 20648 KB Output is correct
22 Correct 10 ms 20692 KB Output is correct
23 Correct 11 ms 20692 KB Output is correct
24 Correct 12 ms 20692 KB Output is correct
25 Correct 10 ms 20736 KB Output is correct
26 Correct 11 ms 20680 KB Output is correct
27 Correct 10 ms 20692 KB Output is correct
28 Correct 10 ms 20736 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 20628 KB Output is correct
2 Correct 368 ms 51832 KB Output is correct
3 Correct 588 ms 48976 KB Output is correct
4 Correct 461 ms 61464 KB Output is correct
5 Correct 474 ms 50468 KB Output is correct
6 Correct 493 ms 49656 KB Output is correct
7 Correct 497 ms 49600 KB Output is correct
8 Correct 445 ms 49512 KB Output is correct
9 Correct 435 ms 71340 KB Output is correct
10 Correct 509 ms 66208 KB Output is correct
11 Correct 388 ms 51696 KB Output is correct
12 Correct 588 ms 48784 KB Output is correct
13 Correct 341 ms 48612 KB Output is correct
14 Correct 405 ms 48992 KB Output is correct
15 Correct 465 ms 48720 KB Output is correct
16 Correct 507 ms 48884 KB Output is correct
17 Correct 524 ms 48816 KB Output is correct
18 Correct 12 ms 20692 KB Output is correct
19 Correct 12 ms 20640 KB Output is correct
20 Correct 10 ms 20736 KB Output is correct
21 Correct 11 ms 20692 KB Output is correct
22 Correct 10 ms 20652 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 20628 KB Output is correct
2 Correct 368 ms 51832 KB Output is correct
3 Correct 588 ms 48976 KB Output is correct
4 Correct 461 ms 61464 KB Output is correct
5 Correct 474 ms 50468 KB Output is correct
6 Correct 493 ms 49656 KB Output is correct
7 Correct 497 ms 49600 KB Output is correct
8 Correct 445 ms 49512 KB Output is correct
9 Correct 435 ms 71340 KB Output is correct
10 Correct 509 ms 66208 KB Output is correct
11 Correct 388 ms 51696 KB Output is correct
12 Correct 588 ms 48784 KB Output is correct
13 Correct 341 ms 48612 KB Output is correct
14 Correct 405 ms 48992 KB Output is correct
15 Correct 465 ms 48720 KB Output is correct
16 Correct 507 ms 48884 KB Output is correct
17 Correct 524 ms 48816 KB Output is correct
18 Correct 12 ms 20692 KB Output is correct
19 Correct 12 ms 20640 KB Output is correct
20 Correct 10 ms 20736 KB Output is correct
21 Correct 11 ms 20692 KB Output is correct
22 Correct 10 ms 20652 KB Output is correct
23 Correct 10 ms 20692 KB Output is correct
24 Correct 415 ms 51672 KB Output is correct
25 Correct 683 ms 48816 KB Output is correct
26 Correct 491 ms 68676 KB Output is correct
27 Correct 532 ms 50276 KB Output is correct
28 Correct 601 ms 49968 KB Output is correct
29 Correct 590 ms 50192 KB Output is correct
30 Correct 397 ms 49468 KB Output is correct
31 Correct 420 ms 63768 KB Output is correct
32 Correct 542 ms 66312 KB Output is correct
33 Correct 493 ms 51936 KB Output is correct
34 Correct 730 ms 48540 KB Output is correct
35 Correct 11 ms 20692 KB Output is correct
36 Correct 12 ms 20692 KB Output is correct
37 Correct 11 ms 20680 KB Output is correct
38 Correct 11 ms 20740 KB Output is correct
39 Correct 11 ms 20728 KB Output is correct
40 Correct 11 ms 20692 KB Output is correct
41 Correct 11 ms 20672 KB Output is correct
42 Correct 11 ms 20692 KB Output is correct
43 Correct 13 ms 20692 KB Output is correct
44 Correct 10 ms 20692 KB Output is correct
45 Correct 13 ms 20636 KB Output is correct
46 Correct 11 ms 20692 KB Output is correct
47 Correct 11 ms 20680 KB Output is correct
48 Correct 12 ms 20692 KB Output is correct
49 Correct 13 ms 20716 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20640 KB Output is correct
2 Correct 579 ms 68156 KB Output is correct
3 Correct 1711 ms 61700 KB Output is correct
4 Correct 804 ms 63124 KB Output is correct
5 Correct 2061 ms 48648 KB Output is correct
6 Correct 1467 ms 48252 KB Output is correct
7 Correct 953 ms 48780 KB Output is correct
8 Correct 332 ms 47960 KB Output is correct
9 Correct 613 ms 61252 KB Output is correct
10 Correct 1625 ms 65480 KB Output is correct
11 Correct 1112 ms 49496 KB Output is correct
12 Execution timed out 4057 ms 48288 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 20684 KB Output is correct
2 Correct 568 ms 62788 KB Output is correct
3 Correct 1843 ms 56204 KB Output is correct
4 Correct 896 ms 60084 KB Output is correct
5 Correct 2449 ms 50304 KB Output is correct
6 Correct 1755 ms 49924 KB Output is correct
7 Correct 1291 ms 49080 KB Output is correct
8 Correct 343 ms 49208 KB Output is correct
9 Correct 619 ms 69372 KB Output is correct
10 Correct 1661 ms 66516 KB Output is correct
11 Correct 1179 ms 51696 KB Output is correct
12 Execution timed out 4062 ms 48564 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20692 KB Output is correct
2 Correct 11 ms 20636 KB Output is correct
3 Correct 10 ms 20732 KB Output is correct
4 Correct 11 ms 20820 KB Output is correct
5 Correct 12 ms 20836 KB Output is correct
6 Correct 14 ms 20860 KB Output is correct
7 Correct 11 ms 20808 KB Output is correct
8 Correct 11 ms 20820 KB Output is correct
9 Correct 10 ms 20740 KB Output is correct
10 Correct 10 ms 20732 KB Output is correct
11 Correct 11 ms 20692 KB Output is correct
12 Correct 10 ms 20692 KB Output is correct
13 Correct 12 ms 20652 KB Output is correct
14 Correct 10 ms 20724 KB Output is correct
15 Correct 10 ms 20692 KB Output is correct
16 Correct 10 ms 20692 KB Output is correct
17 Correct 11 ms 20692 KB Output is correct
18 Correct 13 ms 20692 KB Output is correct
19 Correct 10 ms 20696 KB Output is correct
20 Correct 10 ms 20736 KB Output is correct
21 Correct 12 ms 20648 KB Output is correct
22 Correct 10 ms 20692 KB Output is correct
23 Correct 11 ms 20692 KB Output is correct
24 Correct 12 ms 20692 KB Output is correct
25 Correct 10 ms 20736 KB Output is correct
26 Correct 11 ms 20680 KB Output is correct
27 Correct 10 ms 20692 KB Output is correct
28 Correct 10 ms 20736 KB Output is correct
29 Correct 13 ms 20628 KB Output is correct
30 Correct 368 ms 51832 KB Output is correct
31 Correct 588 ms 48976 KB Output is correct
32 Correct 461 ms 61464 KB Output is correct
33 Correct 474 ms 50468 KB Output is correct
34 Correct 493 ms 49656 KB Output is correct
35 Correct 497 ms 49600 KB Output is correct
36 Correct 445 ms 49512 KB Output is correct
37 Correct 435 ms 71340 KB Output is correct
38 Correct 509 ms 66208 KB Output is correct
39 Correct 388 ms 51696 KB Output is correct
40 Correct 588 ms 48784 KB Output is correct
41 Correct 341 ms 48612 KB Output is correct
42 Correct 405 ms 48992 KB Output is correct
43 Correct 465 ms 48720 KB Output is correct
44 Correct 507 ms 48884 KB Output is correct
45 Correct 524 ms 48816 KB Output is correct
46 Correct 12 ms 20692 KB Output is correct
47 Correct 12 ms 20640 KB Output is correct
48 Correct 10 ms 20736 KB Output is correct
49 Correct 11 ms 20692 KB Output is correct
50 Correct 10 ms 20652 KB Output is correct
51 Correct 10 ms 20692 KB Output is correct
52 Correct 415 ms 51672 KB Output is correct
53 Correct 683 ms 48816 KB Output is correct
54 Correct 491 ms 68676 KB Output is correct
55 Correct 532 ms 50276 KB Output is correct
56 Correct 601 ms 49968 KB Output is correct
57 Correct 590 ms 50192 KB Output is correct
58 Correct 397 ms 49468 KB Output is correct
59 Correct 420 ms 63768 KB Output is correct
60 Correct 542 ms 66312 KB Output is correct
61 Correct 493 ms 51936 KB Output is correct
62 Correct 730 ms 48540 KB Output is correct
63 Correct 11 ms 20692 KB Output is correct
64 Correct 12 ms 20692 KB Output is correct
65 Correct 11 ms 20680 KB Output is correct
66 Correct 11 ms 20740 KB Output is correct
67 Correct 11 ms 20728 KB Output is correct
68 Correct 11 ms 20692 KB Output is correct
69 Correct 11 ms 20672 KB Output is correct
70 Correct 11 ms 20692 KB Output is correct
71 Correct 13 ms 20692 KB Output is correct
72 Correct 10 ms 20692 KB Output is correct
73 Correct 13 ms 20636 KB Output is correct
74 Correct 11 ms 20692 KB Output is correct
75 Correct 11 ms 20680 KB Output is correct
76 Correct 12 ms 20692 KB Output is correct
77 Correct 13 ms 20716 KB Output is correct
78 Correct 11 ms 20640 KB Output is correct
79 Correct 579 ms 68156 KB Output is correct
80 Correct 1711 ms 61700 KB Output is correct
81 Correct 804 ms 63124 KB Output is correct
82 Correct 2061 ms 48648 KB Output is correct
83 Correct 1467 ms 48252 KB Output is correct
84 Correct 953 ms 48780 KB Output is correct
85 Correct 332 ms 47960 KB Output is correct
86 Correct 613 ms 61252 KB Output is correct
87 Correct 1625 ms 65480 KB Output is correct
88 Correct 1112 ms 49496 KB Output is correct
89 Execution timed out 4057 ms 48288 KB Time limit exceeded
90 Halted 0 ms 0 KB -