oj.uz

답안 #589108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589108 2022-07-04T09:26:56 Z Red_Inside Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 76708 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)
{
	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:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main()
      | ^~~~
sprinkler.cpp: In function 'int main()':
sprinkler.cpp:134:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  134 |     if(ancs.size() > b)
      |        ~~~~~~~~~~~~^~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14456 KB Output is correct
2 Correct 9 ms 14420 KB Output is correct
3 Correct 10 ms 14372 KB Output is correct
4 Correct 13 ms 14704 KB Output is correct
5 Correct 12 ms 14672 KB Output is correct
6 Correct 12 ms 14660 KB Output is correct
7 Correct 11 ms 14548 KB Output is correct
8 Correct 12 ms 14548 KB Output is correct
9 Correct 11 ms 14356 KB Output is correct
10 Correct 9 ms 14392 KB Output is correct
11 Correct 10 ms 14416 KB Output is correct
12 Correct 10 ms 14420 KB Output is correct
13 Correct 11 ms 14380 KB Output is correct
14 Correct 9 ms 14348 KB Output is correct
15 Correct 9 ms 14464 KB Output is correct
16 Correct 10 ms 14408 KB Output is correct
17 Correct 11 ms 14420 KB Output is correct
18 Correct 9 ms 14372 KB Output is correct
19 Correct 8 ms 14416 KB Output is correct
20 Correct 10 ms 14396 KB Output is correct
21 Correct 11 ms 14428 KB Output is correct
22 Correct 11 ms 14356 KB Output is correct
23 Correct 10 ms 14376 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 11 ms 14464 KB Output is correct
26 Correct 10 ms 14420 KB Output is correct
27 Correct 10 ms 14460 KB Output is correct
28 Correct 10 ms 14420 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14352 KB Output is correct
2 Correct 624 ms 57236 KB Output is correct
3 Correct 1118 ms 54048 KB Output is correct
4 Correct 641 ms 67628 KB Output is correct
5 Correct 869 ms 56548 KB Output is correct
6 Correct 773 ms 55592 KB Output is correct
7 Correct 730 ms 56028 KB Output is correct
8 Correct 610 ms 56300 KB Output is correct
9 Correct 456 ms 76708 KB Output is correct
10 Correct 591 ms 71812 KB Output is correct
11 Correct 468 ms 57616 KB Output is correct
12 Correct 863 ms 54780 KB Output is correct
13 Correct 378 ms 54716 KB Output is correct
14 Correct 654 ms 54656 KB Output is correct
15 Correct 677 ms 54780 KB Output is correct
16 Correct 753 ms 54572 KB Output is correct
17 Correct 917 ms 55324 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14440 KB Output is correct
20 Correct 11 ms 14472 KB Output is correct
21 Correct 9 ms 14360 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14352 KB Output is correct
2 Correct 624 ms 57236 KB Output is correct
3 Correct 1118 ms 54048 KB Output is correct
4 Correct 641 ms 67628 KB Output is correct
5 Correct 869 ms 56548 KB Output is correct
6 Correct 773 ms 55592 KB Output is correct
7 Correct 730 ms 56028 KB Output is correct
8 Correct 610 ms 56300 KB Output is correct
9 Correct 456 ms 76708 KB Output is correct
10 Correct 591 ms 71812 KB Output is correct
11 Correct 468 ms 57616 KB Output is correct
12 Correct 863 ms 54780 KB Output is correct
13 Correct 378 ms 54716 KB Output is correct
14 Correct 654 ms 54656 KB Output is correct
15 Correct 677 ms 54780 KB Output is correct
16 Correct 753 ms 54572 KB Output is correct
17 Correct 917 ms 55324 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 9 ms 14440 KB Output is correct
20 Correct 11 ms 14472 KB Output is correct
21 Correct 9 ms 14360 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 8 ms 14428 KB Output is correct
24 Correct 503 ms 57884 KB Output is correct
25 Correct 1398 ms 54492 KB Output is correct
26 Correct 601 ms 73976 KB Output is correct
27 Correct 797 ms 56064 KB Output is correct
28 Correct 910 ms 55640 KB Output is correct
29 Correct 939 ms 55588 KB Output is correct
30 Correct 537 ms 55980 KB Output is correct
31 Correct 532 ms 70060 KB Output is correct
32 Correct 739 ms 71644 KB Output is correct
33 Correct 507 ms 57728 KB Output is correct
34 Correct 1316 ms 54572 KB Output is correct
35 Correct 10 ms 14420 KB Output is correct
36 Correct 11 ms 14444 KB Output is correct
37 Correct 11 ms 14420 KB Output is correct
38 Correct 11 ms 14436 KB Output is correct
39 Correct 9 ms 14420 KB Output is correct
40 Correct 9 ms 14436 KB Output is correct
41 Correct 8 ms 14420 KB Output is correct
42 Correct 9 ms 14384 KB Output is correct
43 Correct 8 ms 14440 KB Output is correct
44 Correct 8 ms 14344 KB Output is correct
45 Correct 8 ms 14436 KB Output is correct
46 Correct 8 ms 14432 KB Output is correct
47 Correct 8 ms 14420 KB Output is correct
48 Correct 8 ms 14440 KB Output is correct
49 Correct 8 ms 14432 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14432 KB Output is correct
2 Correct 669 ms 73488 KB Output is correct
3 Correct 2836 ms 67864 KB Output is correct
4 Correct 1144 ms 69304 KB Output is correct
5 Execution timed out 4026 ms 54720 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14420 KB Output is correct
2 Correct 713 ms 69688 KB Output is correct
3 Correct 3274 ms 63448 KB Output is correct
4 Correct 1329 ms 66872 KB Output is correct
5 Correct 3736 ms 56776 KB Output is correct
6 Correct 2189 ms 56168 KB Output is correct
7 Correct 1443 ms 55804 KB Output is correct
8 Correct 444 ms 56020 KB Output is correct
9 Correct 765 ms 75204 KB Output is correct
10 Correct 2879 ms 72288 KB Output is correct
11 Correct 2064 ms 57836 KB Output is correct
12 Execution timed out 4011 ms 54308 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14456 KB Output is correct
2 Correct 9 ms 14420 KB Output is correct
3 Correct 10 ms 14372 KB Output is correct
4 Correct 13 ms 14704 KB Output is correct
5 Correct 12 ms 14672 KB Output is correct
6 Correct 12 ms 14660 KB Output is correct
7 Correct 11 ms 14548 KB Output is correct
8 Correct 12 ms 14548 KB Output is correct
9 Correct 11 ms 14356 KB Output is correct
10 Correct 9 ms 14392 KB Output is correct
11 Correct 10 ms 14416 KB Output is correct
12 Correct 10 ms 14420 KB Output is correct
13 Correct 11 ms 14380 KB Output is correct
14 Correct 9 ms 14348 KB Output is correct
15 Correct 9 ms 14464 KB Output is correct
16 Correct 10 ms 14408 KB Output is correct
17 Correct 11 ms 14420 KB Output is correct
18 Correct 9 ms 14372 KB Output is correct
19 Correct 8 ms 14416 KB Output is correct
20 Correct 10 ms 14396 KB Output is correct
21 Correct 11 ms 14428 KB Output is correct
22 Correct 11 ms 14356 KB Output is correct
23 Correct 10 ms 14376 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 11 ms 14464 KB Output is correct
26 Correct 10 ms 14420 KB Output is correct
27 Correct 10 ms 14460 KB Output is correct
28 Correct 10 ms 14420 KB Output is correct
29 Correct 9 ms 14352 KB Output is correct
30 Correct 624 ms 57236 KB Output is correct
31 Correct 1118 ms 54048 KB Output is correct
32 Correct 641 ms 67628 KB Output is correct
33 Correct 869 ms 56548 KB Output is correct
34 Correct 773 ms 55592 KB Output is correct
35 Correct 730 ms 56028 KB Output is correct
36 Correct 610 ms 56300 KB Output is correct
37 Correct 456 ms 76708 KB Output is correct
38 Correct 591 ms 71812 KB Output is correct
39 Correct 468 ms 57616 KB Output is correct
40 Correct 863 ms 54780 KB Output is correct
41 Correct 378 ms 54716 KB Output is correct
42 Correct 654 ms 54656 KB Output is correct
43 Correct 677 ms 54780 KB Output is correct
44 Correct 753 ms 54572 KB Output is correct
45 Correct 917 ms 55324 KB Output is correct
46 Correct 9 ms 14420 KB Output is correct
47 Correct 9 ms 14440 KB Output is correct
48 Correct 11 ms 14472 KB Output is correct
49 Correct 9 ms 14360 KB Output is correct
50 Correct 8 ms 14420 KB Output is correct
51 Correct 8 ms 14428 KB Output is correct
52 Correct 503 ms 57884 KB Output is correct
53 Correct 1398 ms 54492 KB Output is correct
54 Correct 601 ms 73976 KB Output is correct
55 Correct 797 ms 56064 KB Output is correct
56 Correct 910 ms 55640 KB Output is correct
57 Correct 939 ms 55588 KB Output is correct
58 Correct 537 ms 55980 KB Output is correct
59 Correct 532 ms 70060 KB Output is correct
60 Correct 739 ms 71644 KB Output is correct
61 Correct 507 ms 57728 KB Output is correct
62 Correct 1316 ms 54572 KB Output is correct
63 Correct 10 ms 14420 KB Output is correct
64 Correct 11 ms 14444 KB Output is correct
65 Correct 11 ms 14420 KB Output is correct
66 Correct 11 ms 14436 KB Output is correct
67 Correct 9 ms 14420 KB Output is correct
68 Correct 9 ms 14436 KB Output is correct
69 Correct 8 ms 14420 KB Output is correct
70 Correct 9 ms 14384 KB Output is correct
71 Correct 8 ms 14440 KB Output is correct
72 Correct 8 ms 14344 KB Output is correct
73 Correct 8 ms 14436 KB Output is correct
74 Correct 8 ms 14432 KB Output is correct
75 Correct 8 ms 14420 KB Output is correct
76 Correct 8 ms 14440 KB Output is correct
77 Correct 8 ms 14432 KB Output is correct
78 Correct 8 ms 14432 KB Output is correct
79 Correct 669 ms 73488 KB Output is correct
80 Correct 2836 ms 67864 KB Output is correct
81 Correct 1144 ms 69304 KB Output is correct
82 Execution timed out 4026 ms 54720 KB Time limit exceeded
83 Halted 0 ms 0 KB -