oj.uz

Submission #615385

# Submission time Handle Problem Language Result Execution time Memory
615385 2022-07-31T08:46:17 Z 장태환(#8493) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 92432 KB 
#include <bits/stdc++.h>
using namespace std;
#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: In function 'void dfs(long long int, long long int)':
sprinkler.cpp:61: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]
   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: 'long long int' and 'std::vector<std::pair<long long int, long long 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 25428 KB Output is correct
2 Correct 14 ms 25428 KB Output is correct
3 Correct 14 ms 25428 KB Output is correct
4 Correct 14 ms 25724 KB Output is correct
5 Correct 14 ms 25684 KB Output is correct
6 Correct 14 ms 25596 KB Output is correct
7 Correct 13 ms 25652 KB Output is correct
8 Correct 14 ms 25680 KB Output is correct
9 Correct 13 ms 25392 KB Output is correct
10 Correct 12 ms 25428 KB Output is correct
11 Correct 12 ms 25428 KB Output is correct
12 Correct 12 ms 25428 KB Output is correct
13 Correct 13 ms 25568 KB Output is correct
14 Correct 13 ms 25432 KB Output is correct
15 Correct 13 ms 25428 KB Output is correct
16 Correct 13 ms 25384 KB Output is correct
17 Correct 17 ms 25428 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 13 ms 25396 KB Output is correct
20 Correct 14 ms 25380 KB Output is correct
21 Correct 13 ms 25404 KB Output is correct
22 Correct 13 ms 25392 KB Output is correct
23 Correct 15 ms 25324 KB Output is correct
24 Correct 15 ms 25428 KB Output is correct
25 Correct 14 ms 25440 KB Output is correct
26 Correct 13 ms 25356 KB Output is correct
27 Correct 13 ms 25428 KB Output is correct
28 Correct 14 ms 25428 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25428 KB Output is correct
2 Correct 438 ms 78620 KB Output is correct
3 Correct 650 ms 75752 KB Output is correct
4 Correct 519 ms 83724 KB Output is correct
5 Correct 490 ms 77388 KB Output is correct
6 Correct 697 ms 75964 KB Output is correct
7 Correct 601 ms 75472 KB Output is correct
8 Correct 424 ms 74696 KB Output is correct
9 Correct 467 ms 92432 KB Output is correct
10 Correct 614 ms 88276 KB Output is correct
11 Correct 422 ms 78364 KB Output is correct
12 Correct 652 ms 75712 KB Output is correct
13 Correct 384 ms 74468 KB Output is correct
14 Correct 476 ms 75332 KB Output is correct
15 Correct 460 ms 74760 KB Output is correct
16 Correct 496 ms 74740 KB Output is correct
17 Correct 548 ms 74188 KB Output is correct
18 Correct 13 ms 25428 KB Output is correct
19 Correct 16 ms 25428 KB Output is correct
20 Correct 14 ms 25404 KB Output is correct
21 Correct 14 ms 25428 KB Output is correct
22 Correct 14 ms 25332 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25428 KB Output is correct
2 Correct 438 ms 78620 KB Output is correct
3 Correct 650 ms 75752 KB Output is correct
4 Correct 519 ms 83724 KB Output is correct
5 Correct 490 ms 77388 KB Output is correct
6 Correct 697 ms 75964 KB Output is correct
7 Correct 601 ms 75472 KB Output is correct
8 Correct 424 ms 74696 KB Output is correct
9 Correct 467 ms 92432 KB Output is correct
10 Correct 614 ms 88276 KB Output is correct
11 Correct 422 ms 78364 KB Output is correct
12 Correct 652 ms 75712 KB Output is correct
13 Correct 384 ms 74468 KB Output is correct
14 Correct 476 ms 75332 KB Output is correct
15 Correct 460 ms 74760 KB Output is correct
16 Correct 496 ms 74740 KB Output is correct
17 Correct 548 ms 74188 KB Output is correct
18 Correct 13 ms 25428 KB Output is correct
19 Correct 16 ms 25428 KB Output is correct
20 Correct 14 ms 25404 KB Output is correct
21 Correct 14 ms 25428 KB Output is correct
22 Correct 14 ms 25332 KB Output is correct
23 Correct 14 ms 25428 KB Output is correct
24 Correct 432 ms 78292 KB Output is correct
25 Correct 978 ms 75656 KB Output is correct
26 Correct 564 ms 89932 KB Output is correct
27 Correct 555 ms 77076 KB Output is correct
28 Correct 643 ms 76096 KB Output is correct
29 Correct 684 ms 77012 KB Output is correct
30 Correct 506 ms 74700 KB Output is correct
31 Correct 564 ms 87936 KB Output is correct
32 Correct 661 ms 87704 KB Output is correct
33 Correct 490 ms 78732 KB Output is correct
34 Correct 980 ms 75124 KB Output is correct
35 Correct 14 ms 25428 KB Output is correct
36 Correct 14 ms 25428 KB Output is correct
37 Correct 14 ms 25428 KB Output is correct
38 Correct 14 ms 25428 KB Output is correct
39 Correct 15 ms 25428 KB Output is correct
40 Correct 17 ms 25428 KB Output is correct
41 Correct 13 ms 25428 KB Output is correct
42 Correct 18 ms 25440 KB Output is correct
43 Correct 17 ms 25448 KB Output is correct
44 Correct 15 ms 25428 KB Output is correct
45 Correct 12 ms 25336 KB Output is correct
46 Correct 13 ms 25428 KB Output is correct
47 Correct 14 ms 25372 KB Output is correct
48 Correct 16 ms 25348 KB Output is correct
49 Correct 14 ms 25344 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25420 KB Output is correct
2 Correct 714 ms 89744 KB Output is correct
3 Correct 2922 ms 85232 KB Output is correct
4 Correct 1385 ms 84964 KB Output is correct
5 Correct 2568 ms 75228 KB Output is correct
6 Correct 1848 ms 74168 KB Output is correct
7 Correct 1098 ms 75344 KB Output is correct
8 Correct 425 ms 73092 KB Output is correct
9 Correct 733 ms 83344 KB Output is correct
10 Correct 2490 ms 87776 KB Output is correct
11 Correct 1407 ms 76260 KB Output is correct
12 Execution timed out 4072 ms 75028 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25352 KB Output is correct
2 Correct 749 ms 87392 KB Output is correct
3 Correct 3062 ms 82172 KB Output is correct
4 Correct 1252 ms 82888 KB Output is correct
5 Correct 2699 ms 77216 KB Output is correct
6 Correct 1688 ms 76484 KB Output is correct
7 Correct 1220 ms 74732 KB Output is correct
8 Correct 389 ms 74528 KB Output is correct
9 Correct 715 ms 91500 KB Output is correct
10 Correct 2433 ms 88040 KB Output is correct
11 Correct 1326 ms 78340 KB Output is correct
12 Execution timed out 4093 ms 75420 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 25428 KB Output is correct
2 Correct 14 ms 25428 KB Output is correct
3 Correct 14 ms 25428 KB Output is correct
4 Correct 14 ms 25724 KB Output is correct
5 Correct 14 ms 25684 KB Output is correct
6 Correct 14 ms 25596 KB Output is correct
7 Correct 13 ms 25652 KB Output is correct
8 Correct 14 ms 25680 KB Output is correct
9 Correct 13 ms 25392 KB Output is correct
10 Correct 12 ms 25428 KB Output is correct
11 Correct 12 ms 25428 KB Output is correct
12 Correct 12 ms 25428 KB Output is correct
13 Correct 13 ms 25568 KB Output is correct
14 Correct 13 ms 25432 KB Output is correct
15 Correct 13 ms 25428 KB Output is correct
16 Correct 13 ms 25384 KB Output is correct
17 Correct 17 ms 25428 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 13 ms 25396 KB Output is correct
20 Correct 14 ms 25380 KB Output is correct
21 Correct 13 ms 25404 KB Output is correct
22 Correct 13 ms 25392 KB Output is correct
23 Correct 15 ms 25324 KB Output is correct
24 Correct 15 ms 25428 KB Output is correct
25 Correct 14 ms 25440 KB Output is correct
26 Correct 13 ms 25356 KB Output is correct
27 Correct 13 ms 25428 KB Output is correct
28 Correct 14 ms 25428 KB Output is correct
29 Correct 12 ms 25428 KB Output is correct
30 Correct 438 ms 78620 KB Output is correct
31 Correct 650 ms 75752 KB Output is correct
32 Correct 519 ms 83724 KB Output is correct
33 Correct 490 ms 77388 KB Output is correct
34 Correct 697 ms 75964 KB Output is correct
35 Correct 601 ms 75472 KB Output is correct
36 Correct 424 ms 74696 KB Output is correct
37 Correct 467 ms 92432 KB Output is correct
38 Correct 614 ms 88276 KB Output is correct
39 Correct 422 ms 78364 KB Output is correct
40 Correct 652 ms 75712 KB Output is correct
41 Correct 384 ms 74468 KB Output is correct
42 Correct 476 ms 75332 KB Output is correct
43 Correct 460 ms 74760 KB Output is correct
44 Correct 496 ms 74740 KB Output is correct
45 Correct 548 ms 74188 KB Output is correct
46 Correct 13 ms 25428 KB Output is correct
47 Correct 16 ms 25428 KB Output is correct
48 Correct 14 ms 25404 KB Output is correct
49 Correct 14 ms 25428 KB Output is correct
50 Correct 14 ms 25332 KB Output is correct
51 Correct 14 ms 25428 KB Output is correct
52 Correct 432 ms 78292 KB Output is correct
53 Correct 978 ms 75656 KB Output is correct
54 Correct 564 ms 89932 KB Output is correct
55 Correct 555 ms 77076 KB Output is correct
56 Correct 643 ms 76096 KB Output is correct
57 Correct 684 ms 77012 KB Output is correct
58 Correct 506 ms 74700 KB Output is correct
59 Correct 564 ms 87936 KB Output is correct
60 Correct 661 ms 87704 KB Output is correct
61 Correct 490 ms 78732 KB Output is correct
62 Correct 980 ms 75124 KB Output is correct
63 Correct 14 ms 25428 KB Output is correct
64 Correct 14 ms 25428 KB Output is correct
65 Correct 14 ms 25428 KB Output is correct
66 Correct 14 ms 25428 KB Output is correct
67 Correct 15 ms 25428 KB Output is correct
68 Correct 17 ms 25428 KB Output is correct
69 Correct 13 ms 25428 KB Output is correct
70 Correct 18 ms 25440 KB Output is correct
71 Correct 17 ms 25448 KB Output is correct
72 Correct 15 ms 25428 KB Output is correct
73 Correct 12 ms 25336 KB Output is correct
74 Correct 13 ms 25428 KB Output is correct
75 Correct 14 ms 25372 KB Output is correct
76 Correct 16 ms 25348 KB Output is correct
77 Correct 14 ms 25344 KB Output is correct
78 Correct 15 ms 25420 KB Output is correct
79 Correct 714 ms 89744 KB Output is correct
80 Correct 2922 ms 85232 KB Output is correct
81 Correct 1385 ms 84964 KB Output is correct
82 Correct 2568 ms 75228 KB Output is correct
83 Correct 1848 ms 74168 KB Output is correct
84 Correct 1098 ms 75344 KB Output is correct
85 Correct 425 ms 73092 KB Output is correct
86 Correct 733 ms 83344 KB Output is correct
87 Correct 2490 ms 87776 KB Output is correct
88 Correct 1407 ms 76260 KB Output is correct
89 Execution timed out 4072 ms 75028 KB Time limit exceeded
90 Halted 0 ms 0 KB -