oj.uz

답안 #589126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589126 2022-07-04T09:33:40 Z Red_Inside Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 76068 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14360 KB Output is correct
3 Correct 8 ms 14360 KB Output is correct
4 Correct 9 ms 14676 KB Output is correct
5 Correct 12 ms 14668 KB Output is correct
6 Correct 9 ms 14676 KB Output is correct
7 Correct 9 ms 14548 KB Output is correct
8 Correct 8 ms 14560 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 8 ms 14396 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 9 ms 14432 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 14464 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14428 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 9 ms 14348 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14352 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 9 ms 14464 KB Output is correct
28 Correct 7 ms 14420 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 412 ms 57176 KB Output is correct
3 Correct 813 ms 54076 KB Output is correct
4 Correct 446 ms 67172 KB Output is correct
5 Correct 573 ms 55704 KB Output is correct
6 Correct 690 ms 55004 KB Output is correct
7 Correct 626 ms 55240 KB Output is correct
8 Correct 507 ms 55496 KB Output is correct
9 Correct 432 ms 76068 KB Output is correct
10 Correct 551 ms 71208 KB Output is correct
11 Correct 396 ms 57152 KB Output is correct
12 Correct 783 ms 54028 KB Output is correct
13 Correct 374 ms 53956 KB Output is correct
14 Correct 582 ms 53896 KB Output is correct
15 Correct 646 ms 54192 KB Output is correct
16 Correct 877 ms 53868 KB Output is correct
17 Correct 949 ms 54564 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14464 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 412 ms 57176 KB Output is correct
3 Correct 813 ms 54076 KB Output is correct
4 Correct 446 ms 67172 KB Output is correct
5 Correct 573 ms 55704 KB Output is correct
6 Correct 690 ms 55004 KB Output is correct
7 Correct 626 ms 55240 KB Output is correct
8 Correct 507 ms 55496 KB Output is correct
9 Correct 432 ms 76068 KB Output is correct
10 Correct 551 ms 71208 KB Output is correct
11 Correct 396 ms 57152 KB Output is correct
12 Correct 783 ms 54028 KB Output is correct
13 Correct 374 ms 53956 KB Output is correct
14 Correct 582 ms 53896 KB Output is correct
15 Correct 646 ms 54192 KB Output is correct
16 Correct 877 ms 53868 KB Output is correct
17 Correct 949 ms 54564 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14464 KB Output is correct
20 Correct 8 ms 14464 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 9 ms 14420 KB Output is correct
23 Correct 9 ms 14360 KB Output is correct
24 Correct 503 ms 57108 KB Output is correct
25 Correct 1171 ms 54020 KB Output is correct
26 Correct 627 ms 73496 KB Output is correct
27 Correct 712 ms 55572 KB Output is correct
28 Correct 819 ms 55128 KB Output is correct
29 Correct 831 ms 54964 KB Output is correct
30 Correct 606 ms 55536 KB Output is correct
31 Correct 536 ms 69552 KB Output is correct
32 Correct 640 ms 71284 KB Output is correct
33 Correct 507 ms 57140 KB Output is correct
34 Correct 1560 ms 53972 KB Output is correct
35 Correct 11 ms 14420 KB Output is correct
36 Correct 10 ms 14404 KB Output is correct
37 Correct 7 ms 14420 KB Output is correct
38 Correct 8 ms 14468 KB Output is correct
39 Correct 10 ms 14428 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 10 ms 14420 KB Output is correct
42 Correct 8 ms 14420 KB Output is correct
43 Correct 8 ms 14420 KB Output is correct
44 Correct 10 ms 14352 KB Output is correct
45 Correct 10 ms 14420 KB Output is correct
46 Correct 11 ms 14468 KB Output is correct
47 Correct 10 ms 14420 KB Output is correct
48 Correct 9 ms 14420 KB Output is correct
49 Correct 11 ms 14420 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14340 KB Output is correct
2 Correct 781 ms 73000 KB Output is correct
3 Correct 2930 ms 67104 KB Output is correct
4 Correct 1192 ms 68420 KB Output is correct
5 Correct 3828 ms 53976 KB Output is correct
6 Correct 2434 ms 54328 KB Output is correct
7 Correct 1315 ms 54428 KB Output is correct
8 Correct 456 ms 54732 KB Output is correct
9 Correct 769 ms 67760 KB Output is correct
10 Correct 2657 ms 71144 KB Output is correct
11 Correct 1889 ms 55216 KB Output is correct
12 Execution timed out 4010 ms 54204 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 658 ms 68632 KB Output is correct
3 Correct 2897 ms 62652 KB Output is correct
4 Correct 1131 ms 65976 KB Output is correct
5 Correct 3536 ms 55620 KB Output is correct
6 Correct 2068 ms 55268 KB Output is correct
7 Correct 1279 ms 54944 KB Output is correct
8 Correct 431 ms 55336 KB Output is correct
9 Correct 700 ms 74488 KB Output is correct
10 Correct 2405 ms 71636 KB Output is correct
11 Correct 1728 ms 57120 KB Output is correct
12 Execution timed out 4089 ms 53792 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14360 KB Output is correct
3 Correct 8 ms 14360 KB Output is correct
4 Correct 9 ms 14676 KB Output is correct
5 Correct 12 ms 14668 KB Output is correct
6 Correct 9 ms 14676 KB Output is correct
7 Correct 9 ms 14548 KB Output is correct
8 Correct 8 ms 14560 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 8 ms 14396 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 9 ms 14432 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 14464 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 7 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 9 ms 14428 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 9 ms 14348 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14352 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 9 ms 14464 KB Output is correct
28 Correct 7 ms 14420 KB Output is correct
29 Correct 7 ms 14420 KB Output is correct
30 Correct 412 ms 57176 KB Output is correct
31 Correct 813 ms 54076 KB Output is correct
32 Correct 446 ms 67172 KB Output is correct
33 Correct 573 ms 55704 KB Output is correct
34 Correct 690 ms 55004 KB Output is correct
35 Correct 626 ms 55240 KB Output is correct
36 Correct 507 ms 55496 KB Output is correct
37 Correct 432 ms 76068 KB Output is correct
38 Correct 551 ms 71208 KB Output is correct
39 Correct 396 ms 57152 KB Output is correct
40 Correct 783 ms 54028 KB Output is correct
41 Correct 374 ms 53956 KB Output is correct
42 Correct 582 ms 53896 KB Output is correct
43 Correct 646 ms 54192 KB Output is correct
44 Correct 877 ms 53868 KB Output is correct
45 Correct 949 ms 54564 KB Output is correct
46 Correct 8 ms 14420 KB Output is correct
47 Correct 8 ms 14464 KB Output is correct
48 Correct 8 ms 14464 KB Output is correct
49 Correct 7 ms 14420 KB Output is correct
50 Correct 9 ms 14420 KB Output is correct
51 Correct 9 ms 14360 KB Output is correct
52 Correct 503 ms 57108 KB Output is correct
53 Correct 1171 ms 54020 KB Output is correct
54 Correct 627 ms 73496 KB Output is correct
55 Correct 712 ms 55572 KB Output is correct
56 Correct 819 ms 55128 KB Output is correct
57 Correct 831 ms 54964 KB Output is correct
58 Correct 606 ms 55536 KB Output is correct
59 Correct 536 ms 69552 KB Output is correct
60 Correct 640 ms 71284 KB Output is correct
61 Correct 507 ms 57140 KB Output is correct
62 Correct 1560 ms 53972 KB Output is correct
63 Correct 11 ms 14420 KB Output is correct
64 Correct 10 ms 14404 KB Output is correct
65 Correct 7 ms 14420 KB Output is correct
66 Correct 8 ms 14468 KB Output is correct
67 Correct 10 ms 14428 KB Output is correct
68 Correct 8 ms 14420 KB Output is correct
69 Correct 10 ms 14420 KB Output is correct
70 Correct 8 ms 14420 KB Output is correct
71 Correct 8 ms 14420 KB Output is correct
72 Correct 10 ms 14352 KB Output is correct
73 Correct 10 ms 14420 KB Output is correct
74 Correct 11 ms 14468 KB Output is correct
75 Correct 10 ms 14420 KB Output is correct
76 Correct 9 ms 14420 KB Output is correct
77 Correct 11 ms 14420 KB Output is correct
78 Correct 8 ms 14340 KB Output is correct
79 Correct 781 ms 73000 KB Output is correct
80 Correct 2930 ms 67104 KB Output is correct
81 Correct 1192 ms 68420 KB Output is correct
82 Correct 3828 ms 53976 KB Output is correct
83 Correct 2434 ms 54328 KB Output is correct
84 Correct 1315 ms 54428 KB Output is correct
85 Correct 456 ms 54732 KB Output is correct
86 Correct 769 ms 67760 KB Output is correct
87 Correct 2657 ms 71144 KB Output is correct
88 Correct 1889 ms 55216 KB Output is correct
89 Execution timed out 4010 ms 54204 KB Time limit exceeded
90 Halted 0 ms 0 KB -