oj.uz

Submission #588838

# Submission time Handle Problem Language Result Execution time Memory
588838 2022-07-04T06:22:39 Z Red_Inside Sprinkler (JOI22_sprinkler) C++17
38 / 100
 766 ms 76236 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;
}

void push(int v, int tn)
{
	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);
}

void update(int x, ll w, int d)
{
	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();
	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;
			if(d == 0)
			{
				h[x] = h[x] * w % L;
				continue;
			}
			if(d == 1)
			{
				h[x] = h[x] * w % L;
				if(anc[x] != 0)
				{
					h[anc[x]] = h[anc[x]] * w % L;
				}
				update(x, w, 1);
			}
			if(d == 2)
			{
				if(anc[x] != 0)
				{
					update(anc[x], w, 1);
					if(anc[anc[x]] != 0)
					{
						h[anc[anc[x]]] = h[anc[anc[x]]] * w % L;
					}
					h[anc[x]] = h[anc[x]] * w % L;
				}
				else
				{
					h[x] = h[x] * w % L;
				}
				update(x, w, 2);
				update(x, w, 1);
			}
		}
		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:91:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   91 | main()
      | ^~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 14420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 397 ms 57168 KB Output is correct
3 Correct 486 ms 53964 KB Output is correct
4 Correct 394 ms 67260 KB Output is correct
5 Correct 411 ms 55584 KB Output is correct
6 Correct 409 ms 54972 KB Output is correct
7 Correct 419 ms 55296 KB Output is correct
8 Correct 335 ms 55540 KB Output is correct
9 Correct 391 ms 76032 KB Output is correct
10 Correct 420 ms 71036 KB Output is correct
11 Correct 407 ms 57188 KB Output is correct
12 Correct 521 ms 54052 KB Output is correct
13 Correct 328 ms 54172 KB Output is correct
14 Correct 414 ms 53932 KB Output is correct
15 Correct 409 ms 54024 KB Output is correct
16 Correct 441 ms 54004 KB Output is correct
17 Correct 451 ms 54496 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14476 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 397 ms 57168 KB Output is correct
3 Correct 486 ms 53964 KB Output is correct
4 Correct 394 ms 67260 KB Output is correct
5 Correct 411 ms 55584 KB Output is correct
6 Correct 409 ms 54972 KB Output is correct
7 Correct 419 ms 55296 KB Output is correct
8 Correct 335 ms 55540 KB Output is correct
9 Correct 391 ms 76032 KB Output is correct
10 Correct 420 ms 71036 KB Output is correct
11 Correct 407 ms 57188 KB Output is correct
12 Correct 521 ms 54052 KB Output is correct
13 Correct 328 ms 54172 KB Output is correct
14 Correct 414 ms 53932 KB Output is correct
15 Correct 409 ms 54024 KB Output is correct
16 Correct 441 ms 54004 KB Output is correct
17 Correct 451 ms 54496 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14476 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 454 ms 62368 KB Output is correct
25 Correct 766 ms 56700 KB Output is correct
26 Correct 410 ms 76236 KB Output is correct
27 Correct 510 ms 58292 KB Output is correct
28 Correct 518 ms 57896 KB Output is correct
29 Correct 533 ms 57904 KB Output is correct
30 Correct 339 ms 58412 KB Output is correct
31 Correct 416 ms 72536 KB Output is correct
32 Correct 472 ms 73952 KB Output is correct
33 Correct 418 ms 60292 KB Output is correct
34 Correct 750 ms 56616 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14440 KB Output is correct
37 Correct 9 ms 14420 KB Output is correct
38 Correct 8 ms 14432 KB Output is correct
39 Correct 8 ms 14440 KB Output is correct
40 Correct 7 ms 14388 KB Output is correct
41 Correct 8 ms 14408 KB Output is correct
42 Correct 8 ms 14420 KB Output is correct
43 Correct 7 ms 14420 KB Output is correct
44 Correct 8 ms 14408 KB Output is correct
45 Correct 8 ms 14420 KB Output is correct
46 Correct 8 ms 14468 KB Output is correct
47 Correct 7 ms 14432 KB Output is correct
48 Correct 8 ms 14448 KB Output is correct
49 Correct 8 ms 14420 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14368 KB Output is correct
2 Incorrect 391 ms 75600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 14420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 14420 KB Output isn't correct
2 Halted 0 ms 0 KB -