oj.uz

Submission #589124

# Submission time Handle Problem Language Result Execution time Memory
589124 2022-07-04T09:33:00 Z Red_Inside Sprinkler (JOI22_sprinkler) C++17
3 / 100
 4000 ms 76076 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(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()
      | ^~~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:137:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  137 |     if(ancs.size() > b)
      |        ~~~~~~~~~~~~^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 9 ms 14420 KB Output is correct
3 Correct 9 ms 14420 KB Output is correct
4 Correct 8 ms 14676 KB Output is correct
5 Correct 10 ms 14548 KB Output is correct
6 Correct 11 ms 14676 KB Output is correct
7 Correct 9 ms 14668 KB Output is correct
8 Correct 8 ms 14676 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 9 ms 14432 KB Output is correct
11 Correct 9 ms 14548 KB Output is correct
12 Correct 8 ms 14388 KB Output is correct
13 Correct 8 ms 14380 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 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 9 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 10 ms 14344 KB Output is correct
25 Correct 8 ms 14416 KB Output is correct
26 Correct 10 ms 14420 KB Output is correct
27 Correct 8 ms 14468 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14332 KB Output is correct
2 Correct 479 ms 57132 KB Output is correct
3 Correct 687 ms 54052 KB Output is correct
4 Correct 464 ms 67280 KB Output is correct
5 Correct 513 ms 55680 KB Output is correct
6 Correct 593 ms 54912 KB Output is correct
7 Correct 535 ms 55224 KB Output is correct
8 Correct 479 ms 55460 KB Output is correct
9 Correct 384 ms 76076 KB Output is correct
10 Correct 520 ms 71148 KB Output is correct
11 Correct 418 ms 57260 KB Output is correct
12 Correct 677 ms 54072 KB Output is correct
13 Correct 359 ms 53996 KB Output is correct
14 Correct 548 ms 53920 KB Output is correct
15 Incorrect 548 ms 54072 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14332 KB Output is correct
2 Correct 479 ms 57132 KB Output is correct
3 Correct 687 ms 54052 KB Output is correct
4 Correct 464 ms 67280 KB Output is correct
5 Correct 513 ms 55680 KB Output is correct
6 Correct 593 ms 54912 KB Output is correct
7 Correct 535 ms 55224 KB Output is correct
8 Correct 479 ms 55460 KB Output is correct
9 Correct 384 ms 76076 KB Output is correct
10 Correct 520 ms 71148 KB Output is correct
11 Correct 418 ms 57260 KB Output is correct
12 Correct 677 ms 54072 KB Output is correct
13 Correct 359 ms 53996 KB Output is correct
14 Correct 548 ms 53920 KB Output is correct
15 Incorrect 548 ms 54072 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14444 KB Output is correct
2 Correct 716 ms 68656 KB Output is correct
3 Correct 2745 ms 62532 KB Output is correct
4 Correct 1041 ms 65996 KB Output is correct
5 Correct 3130 ms 55616 KB Output is correct
6 Correct 1942 ms 55224 KB Output is correct
7 Correct 1317 ms 55160 KB Output is correct
8 Correct 427 ms 55296 KB Output is correct
9 Correct 628 ms 74320 KB Output is correct
10 Correct 2785 ms 71592 KB Output is correct
11 Correct 1445 ms 57036 KB Output is correct
12 Execution timed out 4056 ms 53992 KB Time limit exceeded
13 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 9 ms 14420 KB Output is correct
3 Correct 9 ms 14420 KB Output is correct
4 Correct 8 ms 14676 KB Output is correct
5 Correct 10 ms 14548 KB Output is correct
6 Correct 11 ms 14676 KB Output is correct
7 Correct 9 ms 14668 KB Output is correct
8 Correct 8 ms 14676 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 9 ms 14432 KB Output is correct
11 Correct 9 ms 14548 KB Output is correct
12 Correct 8 ms 14388 KB Output is correct
13 Correct 8 ms 14380 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 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 9 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 7 ms 14420 KB Output is correct
23 Correct 7 ms 14420 KB Output is correct
24 Correct 10 ms 14344 KB Output is correct
25 Correct 8 ms 14416 KB Output is correct
26 Correct 10 ms 14420 KB Output is correct
27 Correct 8 ms 14468 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct
29 Correct 8 ms 14332 KB Output is correct
30 Correct 479 ms 57132 KB Output is correct
31 Correct 687 ms 54052 KB Output is correct
32 Correct 464 ms 67280 KB Output is correct
33 Correct 513 ms 55680 KB Output is correct
34 Correct 593 ms 54912 KB Output is correct
35 Correct 535 ms 55224 KB Output is correct
36 Correct 479 ms 55460 KB Output is correct
37 Correct 384 ms 76076 KB Output is correct
38 Correct 520 ms 71148 KB Output is correct
39 Correct 418 ms 57260 KB Output is correct
40 Correct 677 ms 54072 KB Output is correct
41 Correct 359 ms 53996 KB Output is correct
42 Correct 548 ms 53920 KB Output is correct
43 Incorrect 548 ms 54072 KB Output isn't correct
44 Halted 0 ms 0 KB -