oj.uz

Submission #589133

# Submission time Handle Problem Language Result Execution time Memory
589133 2022-07-04T09:37:34 Z Red_Inside Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 76020 KB 
//
#include <bits/stdc++.h>
 
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define o cout<<"BUG"<<endl;
#define FOR(i, j, n) for(int j = i; j < n; ++j)
#define forn(i, j, n) for(int j = i; j <= n; ++j)
#define nfor(i, j, n) for(int j = n; j >= i; --j)
#define sortv(vv) sort(vv.begin(), vv.end())
#define all(v) v.begin(), v.end()
#define ld long double
#define ull unsigned long long
 
using namespace std;
const int maxn=2e5+100,LOG=17, mod=1e9+7;
int block = 320, timer = 0;
const ld EPS = 1e-18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 
#define bt(i) (1 << (i))
//#define int ll
const int inf=1e9+10;
#define y1 yy
#define prev pre
#define pii pair <int, int>
 
int n, q, anc[maxn], tin[maxn], tout[maxn], deep[maxn], sz[maxn];
ll L, h[maxn];
vector <int> edge[maxn];
vector <pii> vec[maxn];
vector <ll> t[maxn];
 
void dfs(int v, int pred = -1)
{
	tin[v] = ++timer;
	vec[deep[v]].pb({tin[v], v});
	for(auto to : edge[v])
	{
		if(to == pred) continue;
		deep[to] = deep[v] + 1;
		anc[to] = v;
		dfs(to, v);
	}
	tout[v] = timer;
}

inline void push(int v, int tn)
{
	if(t[tn][v] != 1)
	{
		t[tn][v * 2] = t[tn][v * 2] * t[tn][v] % L;
		t[tn][v * 2 + 1] = t[tn][v * 2 + 1] * t[tn][v] % L;
		t[tn][v] = 1;
	}
}
 
void upd(int v, int tl, int tr, int l, int r, ll w, int tn)
{
	if(l <= tl && tr <= r)
	{
		t[tn][v] = t[tn][v] * w % L;
		return;
	}
	if(l > tr || r < tl) return;
	push(v, tn);
	upd(v * 2, tl, (tl + tr) / 2, l, r, w, tn);
	upd(v * 2 + 1, (tl + tr) / 2 + 1, tr, l, r, w, tn);
}
 
ll get(int v, int tl, int tr, int pos, int tn)
{
	if(tl == tr) return t[tn][v];
	push(v, tn);
	if(pos <= (tl + tr) / 2) return get(v * 2, tl, (tl + tr) / 2, pos, tn);
	return get(v * 2 + 1, (tl + tr) / 2 + 1, tr, pos, tn);
}
 
inline void update(int x, ll w, int d)
{
	if(d < 0) return;
	if(sz[deep[x] + d] == 0) return;
//	cout << "UPDATE " << x << " " << w << " " << d << " " << tin[x] << " " << tout[x] << endl;
//	cout << "VECTOR\n";
//	for(auto i : vec[deep[x] + d]) cout << "   " << i.f << " " << i.s << endl;
	int L = lower_bound(all(vec[deep[x] + d]), mp(tin[x], 0)) - vec[deep[x] + d].begin() + 1;
	int R = upper_bound(all(vec[deep[x] + d]), mp(tout[x], inf)) - vec[deep[x] + d].begin();
//	que[deep[x] + d].pb({{L, R}, w});
	upd(1, 1, sz[deep[x] + d], L, R, w, deep[x] + d);
}
 
main()
{
	IOS
	cin >> n >> L;
	forn(1, i, n - 1)
	{
		int l, r;
		cin >> l >> r;
		edge[l].pb(r);
		edge[r].pb(l);
	}
	forn(1, i, n) cin >> h[i];
	deep[1] = 1;
	dfs(1);
	forn(1, i, n)
	{
		sz[i] = vec[i].size();
		t[i].assign(sz[i] * 4 + 10, 1);
//		build(1, 1, sz[i], i);
	}
	cin >> q;
	forn(1, i, q)
	{
		int ty;
		cin >> ty;
		if(ty == 1)
		{
			int x, d;
			ll w;
			cin >> x >> d >> w;
			vector <int> ancs;
			int v = x;
			forn(0, iter, d)
			{
				ancs.pb(v);
				v = anc[v];
				if(v == 0) break;
			}
			forn(-d, a, d)
			{
				int b = (d + a) / 2;
				if((int)ancs.size() > b)
				{
//					cout << "START UPDATE " << ancs[b] << " " << a << " " << b << endl;
					update(ancs[b], w, b - a);
				}
				else
				{
//					cout << "START UPDATE " << ancs.back() << " " << a << " " << b << endl;
					update(ancs.back(), w, (int)ancs.size() - 1 - a);
				}
			}
		}
		else
		{
			int x;
			cin >> x;
			int pos = lower_bound(all(vec[deep[x]]), mp(tin[x], x)) - vec[deep[x]].begin() + 1;
			ll ans = h[x] * get(1, 1, sz[deep[x]], pos, deep[x]) % L;
//			cout << h[x] << " " << get(1, 1, sz[deep[x]], pos, deep[x]) << endl;
			cout << ans << "\n";
		}
	}
}

Compilation message

sprinkler.cpp:96:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   96 | main()
      | ^~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14456 KB Output is correct
3 Correct 8 ms 14388 KB Output is correct
4 Correct 11 ms 14712 KB Output is correct
5 Correct 10 ms 14548 KB Output is correct
6 Correct 8 ms 14676 KB Output is correct
7 Correct 9 ms 14592 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14388 KB Output is correct
13 Correct 8 ms 14412 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 8 ms 14340 KB Output is correct
17 Correct 9 ms 14404 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14404 KB Output is correct
20 Correct 8 ms 14436 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 14 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14464 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 7 ms 14384 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 490 ms 57168 KB Output is correct
3 Correct 796 ms 54036 KB Output is correct
4 Correct 430 ms 67180 KB Output is correct
5 Correct 498 ms 55680 KB Output is correct
6 Correct 589 ms 54940 KB Output is correct
7 Correct 538 ms 55252 KB Output is correct
8 Correct 437 ms 55456 KB Output is correct
9 Correct 406 ms 76020 KB Output is correct
10 Correct 467 ms 71084 KB Output is correct
11 Correct 385 ms 57036 KB Output is correct
12 Correct 671 ms 54004 KB Output is correct
13 Correct 347 ms 53904 KB Output is correct
14 Correct 497 ms 53896 KB Output is correct
15 Correct 532 ms 54012 KB Output is correct
16 Correct 576 ms 53900 KB Output is correct
17 Correct 662 ms 54640 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 8 ms 14444 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14364 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 490 ms 57168 KB Output is correct
3 Correct 796 ms 54036 KB Output is correct
4 Correct 430 ms 67180 KB Output is correct
5 Correct 498 ms 55680 KB Output is correct
6 Correct 589 ms 54940 KB Output is correct
7 Correct 538 ms 55252 KB Output is correct
8 Correct 437 ms 55456 KB Output is correct
9 Correct 406 ms 76020 KB Output is correct
10 Correct 467 ms 71084 KB Output is correct
11 Correct 385 ms 57036 KB Output is correct
12 Correct 671 ms 54004 KB Output is correct
13 Correct 347 ms 53904 KB Output is correct
14 Correct 497 ms 53896 KB Output is correct
15 Correct 532 ms 54012 KB Output is correct
16 Correct 576 ms 53900 KB Output is correct
17 Correct 662 ms 54640 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 8 ms 14444 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14364 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 434 ms 57108 KB Output is correct
25 Correct 923 ms 54092 KB Output is correct
26 Correct 468 ms 73516 KB Output is correct
27 Correct 538 ms 55628 KB Output is correct
28 Correct 664 ms 55088 KB Output is correct
29 Correct 663 ms 55056 KB Output is correct
30 Correct 449 ms 55560 KB Output is correct
31 Correct 396 ms 69712 KB Output is correct
32 Correct 591 ms 71164 KB Output is correct
33 Correct 415 ms 57156 KB Output is correct
34 Correct 970 ms 53856 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14420 KB Output is correct
37 Correct 8 ms 14420 KB Output is correct
38 Correct 8 ms 14420 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 7 ms 14420 KB Output is correct
41 Correct 7 ms 14420 KB Output is correct
42 Correct 7 ms 14420 KB Output is correct
43 Correct 9 ms 14416 KB Output is correct
44 Correct 7 ms 14420 KB Output is correct
45 Correct 8 ms 14356 KB Output is correct
46 Correct 7 ms 14420 KB Output is correct
47 Correct 8 ms 14420 KB Output is correct
48 Correct 8 ms 14396 KB Output is correct
49 Correct 7 ms 14420 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 619 ms 72896 KB Output is correct
3 Correct 2437 ms 67200 KB Output is correct
4 Correct 984 ms 68572 KB Output is correct
5 Correct 3047 ms 54104 KB Output is correct
6 Correct 1993 ms 53692 KB Output is correct
7 Correct 1119 ms 53632 KB Output is correct
8 Correct 428 ms 53936 KB Output is correct
9 Correct 695 ms 66876 KB Output is correct
10 Correct 2686 ms 70540 KB Output is correct
11 Correct 1626 ms 54412 KB Output is correct
12 Execution timed out 4010 ms 53764 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 860 ms 69272 KB Output is correct
3 Correct 3321 ms 63508 KB Output is correct
4 Correct 1322 ms 67048 KB Output is correct
5 Execution timed out 4010 ms 56632 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14456 KB Output is correct
3 Correct 8 ms 14388 KB Output is correct
4 Correct 11 ms 14712 KB Output is correct
5 Correct 10 ms 14548 KB Output is correct
6 Correct 8 ms 14676 KB Output is correct
7 Correct 9 ms 14592 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 8 ms 14388 KB Output is correct
13 Correct 8 ms 14412 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 8 ms 14340 KB Output is correct
17 Correct 9 ms 14404 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14404 KB Output is correct
20 Correct 8 ms 14436 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 14 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14464 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 7 ms 14384 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct
29 Correct 7 ms 14420 KB Output is correct
30 Correct 490 ms 57168 KB Output is correct
31 Correct 796 ms 54036 KB Output is correct
32 Correct 430 ms 67180 KB Output is correct
33 Correct 498 ms 55680 KB Output is correct
34 Correct 589 ms 54940 KB Output is correct
35 Correct 538 ms 55252 KB Output is correct
36 Correct 437 ms 55456 KB Output is correct
37 Correct 406 ms 76020 KB Output is correct
38 Correct 467 ms 71084 KB Output is correct
39 Correct 385 ms 57036 KB Output is correct
40 Correct 671 ms 54004 KB Output is correct
41 Correct 347 ms 53904 KB Output is correct
42 Correct 497 ms 53896 KB Output is correct
43 Correct 532 ms 54012 KB Output is correct
44 Correct 576 ms 53900 KB Output is correct
45 Correct 662 ms 54640 KB Output is correct
46 Correct 7 ms 14420 KB Output is correct
47 Correct 8 ms 14444 KB Output is correct
48 Correct 8 ms 14420 KB Output is correct
49 Correct 8 ms 14364 KB Output is correct
50 Correct 8 ms 14420 KB Output is correct
51 Correct 8 ms 14420 KB Output is correct
52 Correct 434 ms 57108 KB Output is correct
53 Correct 923 ms 54092 KB Output is correct
54 Correct 468 ms 73516 KB Output is correct
55 Correct 538 ms 55628 KB Output is correct
56 Correct 664 ms 55088 KB Output is correct
57 Correct 663 ms 55056 KB Output is correct
58 Correct 449 ms 55560 KB Output is correct
59 Correct 396 ms 69712 KB Output is correct
60 Correct 591 ms 71164 KB Output is correct
61 Correct 415 ms 57156 KB Output is correct
62 Correct 970 ms 53856 KB Output is correct
63 Correct 8 ms 14420 KB Output is correct
64 Correct 8 ms 14420 KB Output is correct
65 Correct 8 ms 14420 KB Output is correct
66 Correct 8 ms 14420 KB Output is correct
67 Correct 8 ms 14420 KB Output is correct
68 Correct 7 ms 14420 KB Output is correct
69 Correct 7 ms 14420 KB Output is correct
70 Correct 7 ms 14420 KB Output is correct
71 Correct 9 ms 14416 KB Output is correct
72 Correct 7 ms 14420 KB Output is correct
73 Correct 8 ms 14356 KB Output is correct
74 Correct 7 ms 14420 KB Output is correct
75 Correct 8 ms 14420 KB Output is correct
76 Correct 8 ms 14396 KB Output is correct
77 Correct 7 ms 14420 KB Output is correct
78 Correct 7 ms 14420 KB Output is correct
79 Correct 619 ms 72896 KB Output is correct
80 Correct 2437 ms 67200 KB Output is correct
81 Correct 984 ms 68572 KB Output is correct
82 Correct 3047 ms 54104 KB Output is correct
83 Correct 1993 ms 53692 KB Output is correct
84 Correct 1119 ms 53632 KB Output is correct
85 Correct 428 ms 53936 KB Output is correct
86 Correct 695 ms 66876 KB Output is correct
87 Correct 2686 ms 70540 KB Output is correct
88 Correct 1626 ms 54412 KB Output is correct
89 Execution timed out 4010 ms 53764 KB Time limit exceeded
90 Halted 0 ms 0 KB -