oj.uz

Submission #615420

# Submission time Handle Problem Language Result Execution time Memory
615420 2022-07-31T09:05:48 Z 장태환(#8493) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 71244 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
int N, L;
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 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: In function 'void dfs(int, int)':
sprinkler.cpp:61:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for (i = 0; i < li[n].size(); i++)
      |              ~~^~~~~~~~~~~~~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:89: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]
   89 |   for (j = 0; j < dl[i].size(); j++)
      |               ~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 20692 KB Output is correct
2 Correct 11 ms 20676 KB Output is correct
3 Correct 15 ms 20692 KB Output is correct
4 Correct 12 ms 20852 KB Output is correct
5 Correct 14 ms 20824 KB Output is correct
6 Correct 14 ms 20880 KB Output is correct
7 Correct 21 ms 20868 KB Output is correct
8 Correct 13 ms 20820 KB Output is correct
9 Correct 12 ms 20716 KB Output is correct
10 Correct 12 ms 20740 KB Output is correct
11 Correct 11 ms 20692 KB Output is correct
12 Correct 13 ms 20744 KB Output is correct
13 Correct 11 ms 20692 KB Output is correct
14 Correct 11 ms 20692 KB Output is correct
15 Correct 11 ms 20692 KB Output is correct
16 Correct 11 ms 20692 KB Output is correct
17 Correct 10 ms 20692 KB Output is correct
18 Correct 10 ms 20736 KB Output is correct
19 Correct 12 ms 20692 KB Output is correct
20 Correct 13 ms 20692 KB Output is correct
21 Correct 15 ms 20616 KB Output is correct
22 Correct 13 ms 20692 KB Output is correct
23 Correct 12 ms 20692 KB Output is correct
24 Correct 11 ms 20684 KB Output is correct
25 Correct 10 ms 20692 KB Output is correct
26 Correct 15 ms 20720 KB Output is correct
27 Correct 15 ms 20712 KB Output is correct
28 Correct 12 ms 20692 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 20668 KB Output is correct
2 Correct 365 ms 51888 KB Output is correct
3 Correct 688 ms 48896 KB Output is correct
4 Correct 477 ms 61408 KB Output is correct
5 Correct 498 ms 50412 KB Output is correct
6 Correct 550 ms 49800 KB Output is correct
7 Correct 547 ms 49516 KB Output is correct
8 Correct 409 ms 49404 KB Output is correct
9 Correct 463 ms 71244 KB Output is correct
10 Correct 491 ms 66068 KB Output is correct
11 Correct 410 ms 51748 KB Output is correct
12 Correct 692 ms 48876 KB Output is correct
13 Correct 374 ms 48520 KB Output is correct
14 Correct 431 ms 48960 KB Output is correct
15 Correct 413 ms 48696 KB Output is correct
16 Correct 460 ms 48824 KB Output is correct
17 Correct 510 ms 48956 KB Output is correct
18 Correct 13 ms 20652 KB Output is correct
19 Correct 11 ms 20740 KB Output is correct
20 Correct 12 ms 20692 KB Output is correct
21 Correct 12 ms 20620 KB Output is correct
22 Correct 12 ms 20692 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 20668 KB Output is correct
2 Correct 365 ms 51888 KB Output is correct
3 Correct 688 ms 48896 KB Output is correct
4 Correct 477 ms 61408 KB Output is correct
5 Correct 498 ms 50412 KB Output is correct
6 Correct 550 ms 49800 KB Output is correct
7 Correct 547 ms 49516 KB Output is correct
8 Correct 409 ms 49404 KB Output is correct
9 Correct 463 ms 71244 KB Output is correct
10 Correct 491 ms 66068 KB Output is correct
11 Correct 410 ms 51748 KB Output is correct
12 Correct 692 ms 48876 KB Output is correct
13 Correct 374 ms 48520 KB Output is correct
14 Correct 431 ms 48960 KB Output is correct
15 Correct 413 ms 48696 KB Output is correct
16 Correct 460 ms 48824 KB Output is correct
17 Correct 510 ms 48956 KB Output is correct
18 Correct 13 ms 20652 KB Output is correct
19 Correct 11 ms 20740 KB Output is correct
20 Correct 12 ms 20692 KB Output is correct
21 Correct 12 ms 20620 KB Output is correct
22 Correct 12 ms 20692 KB Output is correct
23 Correct 11 ms 20704 KB Output is correct
24 Correct 380 ms 51712 KB Output is correct
25 Correct 732 ms 48684 KB Output is correct
26 Correct 486 ms 68636 KB Output is correct
27 Correct 555 ms 50316 KB Output is correct
28 Correct 657 ms 49812 KB Output is correct
29 Correct 623 ms 50128 KB Output is correct
30 Correct 385 ms 49620 KB Output is correct
31 Correct 428 ms 63764 KB Output is correct
32 Correct 553 ms 66084 KB Output is correct
33 Correct 422 ms 52004 KB Output is correct
34 Correct 708 ms 48548 KB Output is correct
35 Correct 11 ms 20692 KB Output is correct
36 Correct 11 ms 20740 KB Output is correct
37 Correct 11 ms 20740 KB Output is correct
38 Correct 11 ms 20692 KB Output is correct
39 Correct 11 ms 20680 KB Output is correct
40 Correct 11 ms 20624 KB Output is correct
41 Correct 11 ms 20736 KB Output is correct
42 Correct 11 ms 20692 KB Output is correct
43 Correct 11 ms 20672 KB Output is correct
44 Correct 11 ms 20744 KB Output is correct
45 Correct 12 ms 20692 KB Output is correct
46 Correct 13 ms 20692 KB Output is correct
47 Correct 11 ms 20692 KB Output is correct
48 Correct 12 ms 20660 KB Output is correct
49 Correct 11 ms 20692 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 20692 KB Output is correct
2 Correct 539 ms 68252 KB Output is correct
3 Correct 1830 ms 61652 KB Output is correct
4 Correct 836 ms 63172 KB Output is correct
5 Correct 2357 ms 48612 KB Output is correct
6 Correct 1739 ms 48260 KB Output is correct
7 Correct 1073 ms 48700 KB Output is correct
8 Correct 324 ms 47912 KB Output is correct
9 Correct 611 ms 61304 KB Output is correct
10 Correct 1877 ms 65508 KB Output is correct
11 Correct 1393 ms 49264 KB Output is correct
12 Execution timed out 4086 ms 48272 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 20692 KB Output is correct
2 Correct 591 ms 62972 KB Output is correct
3 Correct 2007 ms 56328 KB Output is correct
4 Correct 904 ms 60024 KB Output is correct
5 Correct 2273 ms 50316 KB Output is correct
6 Correct 1544 ms 49944 KB Output is correct
7 Correct 1087 ms 49128 KB Output is correct
8 Correct 346 ms 49288 KB Output is correct
9 Correct 735 ms 69412 KB Output is correct
10 Correct 1656 ms 66540 KB Output is correct
11 Correct 1077 ms 51532 KB Output is correct
12 Execution timed out 4096 ms 48516 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 20692 KB Output is correct
2 Correct 11 ms 20676 KB Output is correct
3 Correct 15 ms 20692 KB Output is correct
4 Correct 12 ms 20852 KB Output is correct
5 Correct 14 ms 20824 KB Output is correct
6 Correct 14 ms 20880 KB Output is correct
7 Correct 21 ms 20868 KB Output is correct
8 Correct 13 ms 20820 KB Output is correct
9 Correct 12 ms 20716 KB Output is correct
10 Correct 12 ms 20740 KB Output is correct
11 Correct 11 ms 20692 KB Output is correct
12 Correct 13 ms 20744 KB Output is correct
13 Correct 11 ms 20692 KB Output is correct
14 Correct 11 ms 20692 KB Output is correct
15 Correct 11 ms 20692 KB Output is correct
16 Correct 11 ms 20692 KB Output is correct
17 Correct 10 ms 20692 KB Output is correct
18 Correct 10 ms 20736 KB Output is correct
19 Correct 12 ms 20692 KB Output is correct
20 Correct 13 ms 20692 KB Output is correct
21 Correct 15 ms 20616 KB Output is correct
22 Correct 13 ms 20692 KB Output is correct
23 Correct 12 ms 20692 KB Output is correct
24 Correct 11 ms 20684 KB Output is correct
25 Correct 10 ms 20692 KB Output is correct
26 Correct 15 ms 20720 KB Output is correct
27 Correct 15 ms 20712 KB Output is correct
28 Correct 12 ms 20692 KB Output is correct
29 Correct 10 ms 20668 KB Output is correct
30 Correct 365 ms 51888 KB Output is correct
31 Correct 688 ms 48896 KB Output is correct
32 Correct 477 ms 61408 KB Output is correct
33 Correct 498 ms 50412 KB Output is correct
34 Correct 550 ms 49800 KB Output is correct
35 Correct 547 ms 49516 KB Output is correct
36 Correct 409 ms 49404 KB Output is correct
37 Correct 463 ms 71244 KB Output is correct
38 Correct 491 ms 66068 KB Output is correct
39 Correct 410 ms 51748 KB Output is correct
40 Correct 692 ms 48876 KB Output is correct
41 Correct 374 ms 48520 KB Output is correct
42 Correct 431 ms 48960 KB Output is correct
43 Correct 413 ms 48696 KB Output is correct
44 Correct 460 ms 48824 KB Output is correct
45 Correct 510 ms 48956 KB Output is correct
46 Correct 13 ms 20652 KB Output is correct
47 Correct 11 ms 20740 KB Output is correct
48 Correct 12 ms 20692 KB Output is correct
49 Correct 12 ms 20620 KB Output is correct
50 Correct 12 ms 20692 KB Output is correct
51 Correct 11 ms 20704 KB Output is correct
52 Correct 380 ms 51712 KB Output is correct
53 Correct 732 ms 48684 KB Output is correct
54 Correct 486 ms 68636 KB Output is correct
55 Correct 555 ms 50316 KB Output is correct
56 Correct 657 ms 49812 KB Output is correct
57 Correct 623 ms 50128 KB Output is correct
58 Correct 385 ms 49620 KB Output is correct
59 Correct 428 ms 63764 KB Output is correct
60 Correct 553 ms 66084 KB Output is correct
61 Correct 422 ms 52004 KB Output is correct
62 Correct 708 ms 48548 KB Output is correct
63 Correct 11 ms 20692 KB Output is correct
64 Correct 11 ms 20740 KB Output is correct
65 Correct 11 ms 20740 KB Output is correct
66 Correct 11 ms 20692 KB Output is correct
67 Correct 11 ms 20680 KB Output is correct
68 Correct 11 ms 20624 KB Output is correct
69 Correct 11 ms 20736 KB Output is correct
70 Correct 11 ms 20692 KB Output is correct
71 Correct 11 ms 20672 KB Output is correct
72 Correct 11 ms 20744 KB Output is correct
73 Correct 12 ms 20692 KB Output is correct
74 Correct 13 ms 20692 KB Output is correct
75 Correct 11 ms 20692 KB Output is correct
76 Correct 12 ms 20660 KB Output is correct
77 Correct 11 ms 20692 KB Output is correct
78 Correct 12 ms 20692 KB Output is correct
79 Correct 539 ms 68252 KB Output is correct
80 Correct 1830 ms 61652 KB Output is correct
81 Correct 836 ms 63172 KB Output is correct
82 Correct 2357 ms 48612 KB Output is correct
83 Correct 1739 ms 48260 KB Output is correct
84 Correct 1073 ms 48700 KB Output is correct
85 Correct 324 ms 47912 KB Output is correct
86 Correct 611 ms 61304 KB Output is correct
87 Correct 1877 ms 65508 KB Output is correct
88 Correct 1393 ms 49264 KB Output is correct
89 Execution timed out 4086 ms 48272 KB Time limit exceeded
90 Halted 0 ms 0 KB -