oj.uz

답안 #615430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615430 2022-07-31T09:08:53 Z 장태환(#8493) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 71364 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#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;
			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);
	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:90: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]
   90 |   for (j = 0; j < dl[i].size(); j++)
      |               ~~^~~~~~~~~~~~~~
sprinkler.cpp:123:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     if (lp!=dl2[j].size()&&dl2[j][lp]<=en[cp])
      |         ~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20692 KB Output is correct
2 Correct 12 ms 20640 KB Output is correct
3 Correct 14 ms 20660 KB Output is correct
4 Correct 12 ms 20820 KB Output is correct
5 Correct 13 ms 20884 KB Output is correct
6 Correct 12 ms 20768 KB Output is correct
7 Correct 12 ms 20872 KB Output is correct
8 Correct 12 ms 20848 KB Output is correct
9 Correct 11 ms 20676 KB Output is correct
10 Correct 11 ms 20692 KB Output is correct
11 Correct 13 ms 20676 KB Output is correct
12 Correct 11 ms 20704 KB Output is correct
13 Correct 11 ms 20676 KB Output is correct
14 Correct 11 ms 20740 KB Output is correct
15 Correct 11 ms 20692 KB Output is correct
16 Correct 12 ms 20732 KB Output is correct
17 Correct 11 ms 20708 KB Output is correct
18 Correct 11 ms 20740 KB Output is correct
19 Correct 11 ms 20692 KB Output is correct
20 Correct 14 ms 20632 KB Output is correct
21 Correct 11 ms 20692 KB Output is correct
22 Correct 14 ms 20688 KB Output is correct
23 Correct 13 ms 20700 KB Output is correct
24 Correct 14 ms 20692 KB Output is correct
25 Correct 12 ms 20692 KB Output is correct
26 Correct 11 ms 20692 KB Output is correct
27 Correct 11 ms 20692 KB Output is correct
28 Correct 12 ms 20740 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20692 KB Output is correct
2 Correct 374 ms 52000 KB Output is correct
3 Correct 626 ms 48920 KB Output is correct
4 Correct 465 ms 61448 KB Output is correct
5 Correct 461 ms 50508 KB Output is correct
6 Correct 491 ms 49596 KB Output is correct
7 Correct 526 ms 49624 KB Output is correct
8 Correct 420 ms 49524 KB Output is correct
9 Correct 414 ms 71364 KB Output is correct
10 Correct 526 ms 66128 KB Output is correct
11 Correct 371 ms 51776 KB Output is correct
12 Correct 605 ms 48844 KB Output is correct
13 Correct 330 ms 48468 KB Output is correct
14 Correct 385 ms 49048 KB Output is correct
15 Correct 464 ms 48664 KB Output is correct
16 Correct 480 ms 48780 KB Output is correct
17 Correct 547 ms 48748 KB Output is correct
18 Correct 11 ms 20692 KB Output is correct
19 Correct 11 ms 20692 KB Output is correct
20 Correct 11 ms 20620 KB Output is correct
21 Correct 13 ms 20692 KB Output is correct
22 Correct 11 ms 20692 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20692 KB Output is correct
2 Correct 374 ms 52000 KB Output is correct
3 Correct 626 ms 48920 KB Output is correct
4 Correct 465 ms 61448 KB Output is correct
5 Correct 461 ms 50508 KB Output is correct
6 Correct 491 ms 49596 KB Output is correct
7 Correct 526 ms 49624 KB Output is correct
8 Correct 420 ms 49524 KB Output is correct
9 Correct 414 ms 71364 KB Output is correct
10 Correct 526 ms 66128 KB Output is correct
11 Correct 371 ms 51776 KB Output is correct
12 Correct 605 ms 48844 KB Output is correct
13 Correct 330 ms 48468 KB Output is correct
14 Correct 385 ms 49048 KB Output is correct
15 Correct 464 ms 48664 KB Output is correct
16 Correct 480 ms 48780 KB Output is correct
17 Correct 547 ms 48748 KB Output is correct
18 Correct 11 ms 20692 KB Output is correct
19 Correct 11 ms 20692 KB Output is correct
20 Correct 11 ms 20620 KB Output is correct
21 Correct 13 ms 20692 KB Output is correct
22 Correct 11 ms 20692 KB Output is correct
23 Correct 11 ms 20620 KB Output is correct
24 Correct 422 ms 51700 KB Output is correct
25 Correct 739 ms 48780 KB Output is correct
26 Correct 471 ms 68560 KB Output is correct
27 Correct 510 ms 50248 KB Output is correct
28 Correct 613 ms 49796 KB Output is correct
29 Correct 619 ms 50168 KB Output is correct
30 Correct 409 ms 49468 KB Output is correct
31 Correct 406 ms 63744 KB Output is correct
32 Correct 572 ms 66196 KB Output is correct
33 Correct 396 ms 51948 KB Output is correct
34 Correct 810 ms 48512 KB Output is correct
35 Correct 11 ms 20744 KB Output is correct
36 Correct 13 ms 20660 KB Output is correct
37 Correct 12 ms 20628 KB Output is correct
38 Correct 11 ms 20732 KB Output is correct
39 Correct 11 ms 20692 KB Output is correct
40 Correct 12 ms 20640 KB Output is correct
41 Correct 13 ms 20708 KB Output is correct
42 Correct 12 ms 20692 KB Output is correct
43 Correct 11 ms 20692 KB Output is correct
44 Correct 12 ms 20744 KB Output is correct
45 Correct 11 ms 20692 KB Output is correct
46 Correct 11 ms 20692 KB Output is correct
47 Correct 11 ms 20696 KB Output is correct
48 Correct 14 ms 20716 KB Output is correct
49 Correct 12 ms 20692 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20732 KB Output is correct
2 Correct 593 ms 68288 KB Output is correct
3 Correct 1771 ms 61784 KB Output is correct
4 Correct 845 ms 63132 KB Output is correct
5 Correct 2196 ms 48544 KB Output is correct
6 Correct 1530 ms 48188 KB Output is correct
7 Correct 930 ms 48780 KB Output is correct
8 Correct 393 ms 47888 KB Output is correct
9 Correct 578 ms 61288 KB Output is correct
10 Correct 1731 ms 65500 KB Output is correct
11 Correct 1066 ms 49360 KB Output is correct
12 Execution timed out 4085 ms 48312 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 582 ms 62760 KB Output is correct
3 Correct 2055 ms 56296 KB Output is correct
4 Correct 964 ms 60036 KB Output is correct
5 Correct 2149 ms 50280 KB Output is correct
6 Correct 1442 ms 49880 KB Output is correct
7 Correct 1044 ms 49140 KB Output is correct
8 Correct 332 ms 49212 KB Output is correct
9 Correct 593 ms 69488 KB Output is correct
10 Correct 1659 ms 66520 KB Output is correct
11 Correct 1081 ms 51664 KB Output is correct
12 Execution timed out 4059 ms 48688 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20692 KB Output is correct
2 Correct 12 ms 20640 KB Output is correct
3 Correct 14 ms 20660 KB Output is correct
4 Correct 12 ms 20820 KB Output is correct
5 Correct 13 ms 20884 KB Output is correct
6 Correct 12 ms 20768 KB Output is correct
7 Correct 12 ms 20872 KB Output is correct
8 Correct 12 ms 20848 KB Output is correct
9 Correct 11 ms 20676 KB Output is correct
10 Correct 11 ms 20692 KB Output is correct
11 Correct 13 ms 20676 KB Output is correct
12 Correct 11 ms 20704 KB Output is correct
13 Correct 11 ms 20676 KB Output is correct
14 Correct 11 ms 20740 KB Output is correct
15 Correct 11 ms 20692 KB Output is correct
16 Correct 12 ms 20732 KB Output is correct
17 Correct 11 ms 20708 KB Output is correct
18 Correct 11 ms 20740 KB Output is correct
19 Correct 11 ms 20692 KB Output is correct
20 Correct 14 ms 20632 KB Output is correct
21 Correct 11 ms 20692 KB Output is correct
22 Correct 14 ms 20688 KB Output is correct
23 Correct 13 ms 20700 KB Output is correct
24 Correct 14 ms 20692 KB Output is correct
25 Correct 12 ms 20692 KB Output is correct
26 Correct 11 ms 20692 KB Output is correct
27 Correct 11 ms 20692 KB Output is correct
28 Correct 12 ms 20740 KB Output is correct
29 Correct 10 ms 20692 KB Output is correct
30 Correct 374 ms 52000 KB Output is correct
31 Correct 626 ms 48920 KB Output is correct
32 Correct 465 ms 61448 KB Output is correct
33 Correct 461 ms 50508 KB Output is correct
34 Correct 491 ms 49596 KB Output is correct
35 Correct 526 ms 49624 KB Output is correct
36 Correct 420 ms 49524 KB Output is correct
37 Correct 414 ms 71364 KB Output is correct
38 Correct 526 ms 66128 KB Output is correct
39 Correct 371 ms 51776 KB Output is correct
40 Correct 605 ms 48844 KB Output is correct
41 Correct 330 ms 48468 KB Output is correct
42 Correct 385 ms 49048 KB Output is correct
43 Correct 464 ms 48664 KB Output is correct
44 Correct 480 ms 48780 KB Output is correct
45 Correct 547 ms 48748 KB Output is correct
46 Correct 11 ms 20692 KB Output is correct
47 Correct 11 ms 20692 KB Output is correct
48 Correct 11 ms 20620 KB Output is correct
49 Correct 13 ms 20692 KB Output is correct
50 Correct 11 ms 20692 KB Output is correct
51 Correct 11 ms 20620 KB Output is correct
52 Correct 422 ms 51700 KB Output is correct
53 Correct 739 ms 48780 KB Output is correct
54 Correct 471 ms 68560 KB Output is correct
55 Correct 510 ms 50248 KB Output is correct
56 Correct 613 ms 49796 KB Output is correct
57 Correct 619 ms 50168 KB Output is correct
58 Correct 409 ms 49468 KB Output is correct
59 Correct 406 ms 63744 KB Output is correct
60 Correct 572 ms 66196 KB Output is correct
61 Correct 396 ms 51948 KB Output is correct
62 Correct 810 ms 48512 KB Output is correct
63 Correct 11 ms 20744 KB Output is correct
64 Correct 13 ms 20660 KB Output is correct
65 Correct 12 ms 20628 KB Output is correct
66 Correct 11 ms 20732 KB Output is correct
67 Correct 11 ms 20692 KB Output is correct
68 Correct 12 ms 20640 KB Output is correct
69 Correct 13 ms 20708 KB Output is correct
70 Correct 12 ms 20692 KB Output is correct
71 Correct 11 ms 20692 KB Output is correct
72 Correct 12 ms 20744 KB Output is correct
73 Correct 11 ms 20692 KB Output is correct
74 Correct 11 ms 20692 KB Output is correct
75 Correct 11 ms 20696 KB Output is correct
76 Correct 14 ms 20716 KB Output is correct
77 Correct 12 ms 20692 KB Output is correct
78 Correct 11 ms 20732 KB Output is correct
79 Correct 593 ms 68288 KB Output is correct
80 Correct 1771 ms 61784 KB Output is correct
81 Correct 845 ms 63132 KB Output is correct
82 Correct 2196 ms 48544 KB Output is correct
83 Correct 1530 ms 48188 KB Output is correct
84 Correct 930 ms 48780 KB Output is correct
85 Correct 393 ms 47888 KB Output is correct
86 Correct 578 ms 61288 KB Output is correct
87 Correct 1731 ms 65500 KB Output is correct
88 Correct 1066 ms 49360 KB Output is correct
89 Execution timed out 4085 ms 48312 KB Time limit exceeded
90 Halted 0 ms 0 KB -