oj.uz

답안 #615417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615417 2022-07-31T09:04:47 Z 장태환(#8493) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 89480 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops"
#define int long long
int N, L;
struct st
{
	vector<int>r;
	vector<int>lazy;
	int treeN;
	void init(int cnt)
	{
		for (treeN = 1; treeN < cnt; treeN *= 2);
		r.resize(2 * treeN + 3, 1);
		lazy.resize(2 * treeN + 3, 1);
	}
	void upd(int qs, int qe, int n, int s, int e, int i = 1)
	{
		if (s > qe || qs > e)
			return;
		if (qs <= s && e <= qe)
		{
			r[i] *= n;
			r[i] %= L;
			return;
		}
		upd(qs, qe, n, s, (s + e) / 2, i * 2);
		upd(qs, qe, n, (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);
	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();
				int rp = lower_bound(dl2[j].begin(), dl2[j].end(), en[cp] + 1) - dl2[j].begin() - 1;
				if (lp <= rp)
				{
					arr[j].upd(lp, rp, w, 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:5:22: warning: '#pragma GCC optimize (string [,string]...)' does not have a final ')' [-Wpragmas]
    5 | #pragma GCC optimize("unroll-loops"
      |                      ^~~~~~~~~~~~~~
sprinkler.cpp: In function 'void dfs(long long int, long long int)':
sprinkler.cpp:64:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for (i = 0; i < li[n].size(); i++)
      |              ~~^~~~~~~~~~~~~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:92:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |   for (j = 0; j < dl[i].size(); j++)
      |               ~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25292 KB Output is correct
2 Correct 27 ms 25428 KB Output is correct
3 Correct 12 ms 25352 KB Output is correct
4 Correct 13 ms 25716 KB Output is correct
5 Correct 15 ms 25684 KB Output is correct
6 Correct 32 ms 25688 KB Output is correct
7 Correct 13 ms 25584 KB Output is correct
8 Correct 13 ms 25556 KB Output is correct
9 Correct 13 ms 25428 KB Output is correct
10 Correct 13 ms 25428 KB Output is correct
11 Correct 13 ms 25352 KB Output is correct
12 Correct 25 ms 25420 KB Output is correct
13 Correct 27 ms 25332 KB Output is correct
14 Correct 15 ms 25336 KB Output is correct
15 Correct 14 ms 25428 KB Output is correct
16 Correct 17 ms 25420 KB Output is correct
17 Correct 19 ms 25444 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 13 ms 25440 KB Output is correct
20 Correct 14 ms 25356 KB Output is correct
21 Correct 14 ms 25360 KB Output is correct
22 Correct 14 ms 25388 KB Output is correct
23 Correct 19 ms 25416 KB Output is correct
24 Correct 12 ms 25388 KB Output is correct
25 Correct 12 ms 25428 KB Output is correct
26 Correct 13 ms 25376 KB Output is correct
27 Correct 14 ms 25428 KB Output is correct
28 Correct 17 ms 25420 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25428 KB Output is correct
2 Correct 546 ms 78720 KB Output is correct
3 Correct 800 ms 75736 KB Output is correct
4 Correct 591 ms 81724 KB Output is correct
5 Correct 592 ms 77492 KB Output is correct
6 Correct 612 ms 75996 KB Output is correct
7 Correct 616 ms 75632 KB Output is correct
8 Correct 463 ms 74756 KB Output is correct
9 Correct 570 ms 89480 KB Output is correct
10 Correct 575 ms 85448 KB Output is correct
11 Correct 464 ms 78540 KB Output is correct
12 Correct 731 ms 75820 KB Output is correct
13 Correct 383 ms 74420 KB Output is correct
14 Correct 505 ms 75348 KB Output is correct
15 Correct 473 ms 74696 KB Output is correct
16 Correct 611 ms 74672 KB Output is correct
17 Correct 566 ms 74356 KB Output is correct
18 Correct 15 ms 25424 KB Output is correct
19 Correct 16 ms 25396 KB Output is correct
20 Correct 14 ms 25428 KB Output is correct
21 Correct 14 ms 25428 KB Output is correct
22 Correct 14 ms 25416 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25428 KB Output is correct
2 Correct 546 ms 78720 KB Output is correct
3 Correct 800 ms 75736 KB Output is correct
4 Correct 591 ms 81724 KB Output is correct
5 Correct 592 ms 77492 KB Output is correct
6 Correct 612 ms 75996 KB Output is correct
7 Correct 616 ms 75632 KB Output is correct
8 Correct 463 ms 74756 KB Output is correct
9 Correct 570 ms 89480 KB Output is correct
10 Correct 575 ms 85448 KB Output is correct
11 Correct 464 ms 78540 KB Output is correct
12 Correct 731 ms 75820 KB Output is correct
13 Correct 383 ms 74420 KB Output is correct
14 Correct 505 ms 75348 KB Output is correct
15 Correct 473 ms 74696 KB Output is correct
16 Correct 611 ms 74672 KB Output is correct
17 Correct 566 ms 74356 KB Output is correct
18 Correct 15 ms 25424 KB Output is correct
19 Correct 16 ms 25396 KB Output is correct
20 Correct 14 ms 25428 KB Output is correct
21 Correct 14 ms 25428 KB Output is correct
22 Correct 14 ms 25416 KB Output is correct
23 Correct 14 ms 25428 KB Output is correct
24 Correct 453 ms 78316 KB Output is correct
25 Correct 930 ms 75620 KB Output is correct
26 Correct 555 ms 87124 KB Output is correct
27 Correct 597 ms 77060 KB Output is correct
28 Correct 660 ms 76108 KB Output is correct
29 Correct 669 ms 76940 KB Output is correct
30 Correct 444 ms 74644 KB Output is correct
31 Correct 504 ms 85932 KB Output is correct
32 Correct 641 ms 84776 KB Output is correct
33 Correct 483 ms 78816 KB Output is correct
34 Correct 936 ms 75088 KB Output is correct
35 Correct 17 ms 25432 KB Output is correct
36 Correct 17 ms 25428 KB Output is correct
37 Correct 15 ms 25444 KB Output is correct
38 Correct 18 ms 25436 KB Output is correct
39 Correct 15 ms 25404 KB Output is correct
40 Correct 15 ms 25428 KB Output is correct
41 Correct 13 ms 25380 KB Output is correct
42 Correct 14 ms 25428 KB Output is correct
43 Correct 15 ms 25428 KB Output is correct
44 Correct 16 ms 25408 KB Output is correct
45 Correct 14 ms 25376 KB Output is correct
46 Correct 16 ms 25436 KB Output is correct
47 Correct 14 ms 25428 KB Output is correct
48 Correct 18 ms 25408 KB Output is correct
49 Correct 15 ms 25428 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 25388 KB Output is correct
2 Correct 670 ms 86704 KB Output is correct
3 Correct 2997 ms 83152 KB Output is correct
4 Correct 1177 ms 82596 KB Output is correct
5 Correct 2897 ms 75156 KB Output is correct
6 Correct 1800 ms 74132 KB Output is correct
7 Correct 1191 ms 75392 KB Output is correct
8 Correct 424 ms 73152 KB Output is correct
9 Correct 860 ms 81448 KB Output is correct
10 Correct 2401 ms 85048 KB Output is correct
11 Correct 1265 ms 76476 KB Output is correct
12 Execution timed out 4045 ms 75004 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 25428 KB Output is correct
2 Correct 766 ms 85536 KB Output is correct
3 Correct 2936 ms 80756 KB Output is correct
4 Correct 1182 ms 80832 KB Output is correct
5 Correct 2531 ms 77244 KB Output is correct
6 Correct 1653 ms 76492 KB Output is correct
7 Correct 1212 ms 74764 KB Output is correct
8 Correct 353 ms 74544 KB Output is correct
9 Correct 715 ms 88640 KB Output is correct
10 Correct 2816 ms 85116 KB Output is correct
11 Correct 1345 ms 78248 KB Output is correct
12 Execution timed out 4018 ms 75408 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25292 KB Output is correct
2 Correct 27 ms 25428 KB Output is correct
3 Correct 12 ms 25352 KB Output is correct
4 Correct 13 ms 25716 KB Output is correct
5 Correct 15 ms 25684 KB Output is correct
6 Correct 32 ms 25688 KB Output is correct
7 Correct 13 ms 25584 KB Output is correct
8 Correct 13 ms 25556 KB Output is correct
9 Correct 13 ms 25428 KB Output is correct
10 Correct 13 ms 25428 KB Output is correct
11 Correct 13 ms 25352 KB Output is correct
12 Correct 25 ms 25420 KB Output is correct
13 Correct 27 ms 25332 KB Output is correct
14 Correct 15 ms 25336 KB Output is correct
15 Correct 14 ms 25428 KB Output is correct
16 Correct 17 ms 25420 KB Output is correct
17 Correct 19 ms 25444 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 13 ms 25440 KB Output is correct
20 Correct 14 ms 25356 KB Output is correct
21 Correct 14 ms 25360 KB Output is correct
22 Correct 14 ms 25388 KB Output is correct
23 Correct 19 ms 25416 KB Output is correct
24 Correct 12 ms 25388 KB Output is correct
25 Correct 12 ms 25428 KB Output is correct
26 Correct 13 ms 25376 KB Output is correct
27 Correct 14 ms 25428 KB Output is correct
28 Correct 17 ms 25420 KB Output is correct
29 Correct 13 ms 25428 KB Output is correct
30 Correct 546 ms 78720 KB Output is correct
31 Correct 800 ms 75736 KB Output is correct
32 Correct 591 ms 81724 KB Output is correct
33 Correct 592 ms 77492 KB Output is correct
34 Correct 612 ms 75996 KB Output is correct
35 Correct 616 ms 75632 KB Output is correct
36 Correct 463 ms 74756 KB Output is correct
37 Correct 570 ms 89480 KB Output is correct
38 Correct 575 ms 85448 KB Output is correct
39 Correct 464 ms 78540 KB Output is correct
40 Correct 731 ms 75820 KB Output is correct
41 Correct 383 ms 74420 KB Output is correct
42 Correct 505 ms 75348 KB Output is correct
43 Correct 473 ms 74696 KB Output is correct
44 Correct 611 ms 74672 KB Output is correct
45 Correct 566 ms 74356 KB Output is correct
46 Correct 15 ms 25424 KB Output is correct
47 Correct 16 ms 25396 KB Output is correct
48 Correct 14 ms 25428 KB Output is correct
49 Correct 14 ms 25428 KB Output is correct
50 Correct 14 ms 25416 KB Output is correct
51 Correct 14 ms 25428 KB Output is correct
52 Correct 453 ms 78316 KB Output is correct
53 Correct 930 ms 75620 KB Output is correct
54 Correct 555 ms 87124 KB Output is correct
55 Correct 597 ms 77060 KB Output is correct
56 Correct 660 ms 76108 KB Output is correct
57 Correct 669 ms 76940 KB Output is correct
58 Correct 444 ms 74644 KB Output is correct
59 Correct 504 ms 85932 KB Output is correct
60 Correct 641 ms 84776 KB Output is correct
61 Correct 483 ms 78816 KB Output is correct
62 Correct 936 ms 75088 KB Output is correct
63 Correct 17 ms 25432 KB Output is correct
64 Correct 17 ms 25428 KB Output is correct
65 Correct 15 ms 25444 KB Output is correct
66 Correct 18 ms 25436 KB Output is correct
67 Correct 15 ms 25404 KB Output is correct
68 Correct 15 ms 25428 KB Output is correct
69 Correct 13 ms 25380 KB Output is correct
70 Correct 14 ms 25428 KB Output is correct
71 Correct 15 ms 25428 KB Output is correct
72 Correct 16 ms 25408 KB Output is correct
73 Correct 14 ms 25376 KB Output is correct
74 Correct 16 ms 25436 KB Output is correct
75 Correct 14 ms 25428 KB Output is correct
76 Correct 18 ms 25408 KB Output is correct
77 Correct 15 ms 25428 KB Output is correct
78 Correct 16 ms 25388 KB Output is correct
79 Correct 670 ms 86704 KB Output is correct
80 Correct 2997 ms 83152 KB Output is correct
81 Correct 1177 ms 82596 KB Output is correct
82 Correct 2897 ms 75156 KB Output is correct
83 Correct 1800 ms 74132 KB Output is correct
84 Correct 1191 ms 75392 KB Output is correct
85 Correct 424 ms 73152 KB Output is correct
86 Correct 860 ms 81448 KB Output is correct
87 Correct 2401 ms 85048 KB Output is correct
88 Correct 1265 ms 76476 KB Output is correct
89 Execution timed out 4045 ms 75004 KB Time limit exceeded
90 Halted 0 ms 0 KB -