oj.uz

답안 #615489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615489 2022-07-31T09:52:28 Z 장태환(#8493) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 76608 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()+lp, 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 12 ms 20620 KB Output is correct
2 Correct 11 ms 20652 KB Output is correct
3 Correct 13 ms 20772 KB Output is correct
4 Correct 15 ms 20948 KB Output is correct
5 Correct 15 ms 20860 KB Output is correct
6 Correct 13 ms 20856 KB Output is correct
7 Correct 14 ms 20864 KB Output is correct
8 Correct 12 ms 20820 KB Output is correct
9 Correct 12 ms 20692 KB Output is correct
10 Correct 12 ms 20724 KB Output is correct
11 Correct 12 ms 20748 KB Output is correct
12 Correct 12 ms 20692 KB Output is correct
13 Correct 12 ms 20756 KB Output is correct
14 Correct 14 ms 20656 KB Output is correct
15 Correct 12 ms 20692 KB Output is correct
16 Correct 12 ms 20728 KB Output is correct
17 Correct 12 ms 20692 KB Output is correct
18 Correct 12 ms 20720 KB Output is correct
19 Correct 11 ms 20692 KB Output is correct
20 Correct 12 ms 20716 KB Output is correct
21 Correct 11 ms 20732 KB Output is correct
22 Correct 12 ms 20692 KB Output is correct
23 Correct 13 ms 20692 KB Output is correct
24 Correct 12 ms 20716 KB Output is correct
25 Correct 12 ms 20688 KB Output is correct
26 Correct 11 ms 20692 KB Output is correct
27 Correct 12 ms 20692 KB Output is correct
28 Correct 13 ms 20692 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 20692 KB Output is correct
2 Correct 436 ms 54600 KB Output is correct
3 Correct 644 ms 54284 KB Output is correct
4 Correct 489 ms 68268 KB Output is correct
5 Correct 511 ms 57452 KB Output is correct
6 Correct 524 ms 56148 KB Output is correct
7 Correct 557 ms 56468 KB Output is correct
8 Correct 411 ms 56488 KB Output is correct
9 Correct 448 ms 76292 KB Output is correct
10 Correct 542 ms 74012 KB Output is correct
11 Correct 449 ms 56824 KB Output is correct
12 Correct 634 ms 56720 KB Output is correct
13 Correct 413 ms 53616 KB Output is correct
14 Correct 462 ms 54444 KB Output is correct
15 Correct 486 ms 53552 KB Output is correct
16 Correct 496 ms 54156 KB Output is correct
17 Correct 604 ms 54104 KB Output is correct
18 Correct 12 ms 20716 KB Output is correct
19 Correct 13 ms 20692 KB Output is correct
20 Correct 14 ms 20804 KB Output is correct
21 Correct 16 ms 20664 KB Output is correct
22 Correct 15 ms 20652 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 20692 KB Output is correct
2 Correct 436 ms 54600 KB Output is correct
3 Correct 644 ms 54284 KB Output is correct
4 Correct 489 ms 68268 KB Output is correct
5 Correct 511 ms 57452 KB Output is correct
6 Correct 524 ms 56148 KB Output is correct
7 Correct 557 ms 56468 KB Output is correct
8 Correct 411 ms 56488 KB Output is correct
9 Correct 448 ms 76292 KB Output is correct
10 Correct 542 ms 74012 KB Output is correct
11 Correct 449 ms 56824 KB Output is correct
12 Correct 634 ms 56720 KB Output is correct
13 Correct 413 ms 53616 KB Output is correct
14 Correct 462 ms 54444 KB Output is correct
15 Correct 486 ms 53552 KB Output is correct
16 Correct 496 ms 54156 KB Output is correct
17 Correct 604 ms 54104 KB Output is correct
18 Correct 12 ms 20716 KB Output is correct
19 Correct 13 ms 20692 KB Output is correct
20 Correct 14 ms 20804 KB Output is correct
21 Correct 16 ms 20664 KB Output is correct
22 Correct 15 ms 20652 KB Output is correct
23 Correct 12 ms 20692 KB Output is correct
24 Correct 499 ms 56188 KB Output is correct
25 Correct 817 ms 56632 KB Output is correct
26 Correct 518 ms 74740 KB Output is correct
27 Correct 544 ms 56192 KB Output is correct
28 Correct 584 ms 55820 KB Output is correct
29 Correct 652 ms 55896 KB Output is correct
30 Correct 429 ms 55576 KB Output is correct
31 Correct 536 ms 68048 KB Output is correct
32 Correct 620 ms 73972 KB Output is correct
33 Correct 463 ms 56140 KB Output is correct
34 Correct 732 ms 56436 KB Output is correct
35 Correct 13 ms 20692 KB Output is correct
36 Correct 15 ms 20720 KB Output is correct
37 Correct 11 ms 20652 KB Output is correct
38 Correct 13 ms 20692 KB Output is correct
39 Correct 11 ms 20724 KB Output is correct
40 Correct 11 ms 20720 KB Output is correct
41 Correct 11 ms 20672 KB Output is correct
42 Correct 11 ms 20692 KB Output is correct
43 Correct 11 ms 20680 KB Output is correct
44 Correct 12 ms 20692 KB Output is correct
45 Correct 14 ms 20672 KB Output is correct
46 Correct 13 ms 20844 KB Output is correct
47 Correct 14 ms 20720 KB Output is correct
48 Correct 11 ms 20692 KB Output is correct
49 Correct 12 ms 20748 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20728 KB Output is correct
2 Correct 552 ms 76140 KB Output is correct
3 Correct 2133 ms 71000 KB Output is correct
4 Correct 964 ms 71676 KB Output is correct
5 Correct 2344 ms 57256 KB Output is correct
6 Correct 1933 ms 56856 KB Output is correct
7 Correct 1105 ms 57396 KB Output is correct
8 Correct 350 ms 56600 KB Output is correct
9 Correct 721 ms 69336 KB Output is correct
10 Correct 1787 ms 74708 KB Output is correct
11 Correct 1104 ms 57336 KB Output is correct
12 Execution timed out 4043 ms 56332 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20692 KB Output is correct
2 Correct 695 ms 67900 KB Output is correct
3 Correct 2148 ms 63712 KB Output is correct
4 Correct 925 ms 67944 KB Output is correct
5 Correct 2426 ms 58324 KB Output is correct
6 Correct 1754 ms 57840 KB Output is correct
7 Correct 1264 ms 56888 KB Output is correct
8 Correct 366 ms 56872 KB Output is correct
9 Correct 609 ms 76608 KB Output is correct
10 Correct 1657 ms 75272 KB Output is correct
11 Correct 1262 ms 58840 KB Output is correct
12 Execution timed out 4006 ms 55348 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 20620 KB Output is correct
2 Correct 11 ms 20652 KB Output is correct
3 Correct 13 ms 20772 KB Output is correct
4 Correct 15 ms 20948 KB Output is correct
5 Correct 15 ms 20860 KB Output is correct
6 Correct 13 ms 20856 KB Output is correct
7 Correct 14 ms 20864 KB Output is correct
8 Correct 12 ms 20820 KB Output is correct
9 Correct 12 ms 20692 KB Output is correct
10 Correct 12 ms 20724 KB Output is correct
11 Correct 12 ms 20748 KB Output is correct
12 Correct 12 ms 20692 KB Output is correct
13 Correct 12 ms 20756 KB Output is correct
14 Correct 14 ms 20656 KB Output is correct
15 Correct 12 ms 20692 KB Output is correct
16 Correct 12 ms 20728 KB Output is correct
17 Correct 12 ms 20692 KB Output is correct
18 Correct 12 ms 20720 KB Output is correct
19 Correct 11 ms 20692 KB Output is correct
20 Correct 12 ms 20716 KB Output is correct
21 Correct 11 ms 20732 KB Output is correct
22 Correct 12 ms 20692 KB Output is correct
23 Correct 13 ms 20692 KB Output is correct
24 Correct 12 ms 20716 KB Output is correct
25 Correct 12 ms 20688 KB Output is correct
26 Correct 11 ms 20692 KB Output is correct
27 Correct 12 ms 20692 KB Output is correct
28 Correct 13 ms 20692 KB Output is correct
29 Correct 13 ms 20692 KB Output is correct
30 Correct 436 ms 54600 KB Output is correct
31 Correct 644 ms 54284 KB Output is correct
32 Correct 489 ms 68268 KB Output is correct
33 Correct 511 ms 57452 KB Output is correct
34 Correct 524 ms 56148 KB Output is correct
35 Correct 557 ms 56468 KB Output is correct
36 Correct 411 ms 56488 KB Output is correct
37 Correct 448 ms 76292 KB Output is correct
38 Correct 542 ms 74012 KB Output is correct
39 Correct 449 ms 56824 KB Output is correct
40 Correct 634 ms 56720 KB Output is correct
41 Correct 413 ms 53616 KB Output is correct
42 Correct 462 ms 54444 KB Output is correct
43 Correct 486 ms 53552 KB Output is correct
44 Correct 496 ms 54156 KB Output is correct
45 Correct 604 ms 54104 KB Output is correct
46 Correct 12 ms 20716 KB Output is correct
47 Correct 13 ms 20692 KB Output is correct
48 Correct 14 ms 20804 KB Output is correct
49 Correct 16 ms 20664 KB Output is correct
50 Correct 15 ms 20652 KB Output is correct
51 Correct 12 ms 20692 KB Output is correct
52 Correct 499 ms 56188 KB Output is correct
53 Correct 817 ms 56632 KB Output is correct
54 Correct 518 ms 74740 KB Output is correct
55 Correct 544 ms 56192 KB Output is correct
56 Correct 584 ms 55820 KB Output is correct
57 Correct 652 ms 55896 KB Output is correct
58 Correct 429 ms 55576 KB Output is correct
59 Correct 536 ms 68048 KB Output is correct
60 Correct 620 ms 73972 KB Output is correct
61 Correct 463 ms 56140 KB Output is correct
62 Correct 732 ms 56436 KB Output is correct
63 Correct 13 ms 20692 KB Output is correct
64 Correct 15 ms 20720 KB Output is correct
65 Correct 11 ms 20652 KB Output is correct
66 Correct 13 ms 20692 KB Output is correct
67 Correct 11 ms 20724 KB Output is correct
68 Correct 11 ms 20720 KB Output is correct
69 Correct 11 ms 20672 KB Output is correct
70 Correct 11 ms 20692 KB Output is correct
71 Correct 11 ms 20680 KB Output is correct
72 Correct 12 ms 20692 KB Output is correct
73 Correct 14 ms 20672 KB Output is correct
74 Correct 13 ms 20844 KB Output is correct
75 Correct 14 ms 20720 KB Output is correct
76 Correct 11 ms 20692 KB Output is correct
77 Correct 12 ms 20748 KB Output is correct
78 Correct 10 ms 20728 KB Output is correct
79 Correct 552 ms 76140 KB Output is correct
80 Correct 2133 ms 71000 KB Output is correct
81 Correct 964 ms 71676 KB Output is correct
82 Correct 2344 ms 57256 KB Output is correct
83 Correct 1933 ms 56856 KB Output is correct
84 Correct 1105 ms 57396 KB Output is correct
85 Correct 350 ms 56600 KB Output is correct
86 Correct 721 ms 69336 KB Output is correct
87 Correct 1787 ms 74708 KB Output is correct
88 Correct 1104 ms 57336 KB Output is correct
89 Execution timed out 4043 ms 56332 KB Time limit exceeded
90 Halted 0 ms 0 KB -