oj.uz

Submission #759053

# Submission time Handle Problem Language Result Execution time Memory
759053 2023-06-15T17:36:38 Z ymm Cat in a tree (BOI17_catinatree) C++17
100 / 100
 86 ms 20268 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 200'010;
vector<int> A[N];
int par[N];
int st[N], ft[N];
int height[N];
pii srt[N];
int n, d;

void dfs(int v, int h, int &t)
{
	height[v] = h;
	st[v] = t++;
	for (int u : A[v])
		dfs(u, h+1, t);
	ft[v] = t;
}

int seg[2*N];
void up(int l, int r, int x)
{
	l += N;
	r += N;
	while (l < r) {
		if (l&1) seg[l++] = max(seg[l], x);
		if (r&1) seg[r] = max(seg[--r], x);
		l /= 2;
		r /= 2;
	}
}
int get(int i)
{
	i += N;
	int ans = INT_MIN;
	while (i > 0) {
		ans = max(ans, seg[i]);
		i /= 2;
	}
	return ans;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n >> d;
	Loop (i,1,n) {
		int p;
		cin >> p;
		par[i] = p;
		A[p].push_back(i);
	}
	int dard = 0;
	dfs(0, 0, dard);
	Loop (i,0,n)
		srt[i] = {height[i], i};
	sort(srt, srt+n, greater());
	fill(seg, seg+sizeof(seg)/sizeof(*seg), -N);
	int ans = 0;
	Loop (i,0,n) {
		int v = srt[i].second;
		if (height[v] - get(st[v]) < d)
			continue;
		++ans;
		int x = height[v];
		Loop (_,0,d) {
			up(st[v], ft[v], x);
			x -= 2;
			v = par[v];
		}
	}
	cout << ans << '\n';
}

Compilation message

catinatree.cpp: In function 'void up(int, int, int)':
catinatree.cpp:32:17: warning: operation on 'l' may be undefined [-Wsequence-point]
   32 |   if (l&1) seg[l++] = max(seg[l], x);
      |                ~^~
catinatree.cpp:33:29: warning: operation on 'r' may be undefined [-Wsequence-point]
   33 |   if (r&1) seg[r] = max(seg[--r], x);
      |                             ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 3 ms 6624 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Correct 3 ms 6612 KB Output is correct
8 Correct 3 ms 6572 KB Output is correct
9 Correct 3 ms 6564 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 4 ms 6568 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 4 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 4 ms 6612 KB Output is correct
17 Correct 3 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 3 ms 6568 KB Output is correct
20 Correct 3 ms 6624 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 3 ms 6624 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Correct 3 ms 6612 KB Output is correct
8 Correct 3 ms 6572 KB Output is correct
9 Correct 3 ms 6564 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 4 ms 6568 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 4 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 4 ms 6612 KB Output is correct
17 Correct 3 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 3 ms 6568 KB Output is correct
20 Correct 3 ms 6624 KB Output is correct
21 Correct 3 ms 6700 KB Output is correct
22 Correct 3 ms 6628 KB Output is correct
23 Correct 3 ms 6612 KB Output is correct
24 Correct 3 ms 6612 KB Output is correct
25 Correct 4 ms 6572 KB Output is correct
26 Correct 3 ms 6612 KB Output is correct
27 Correct 3 ms 6564 KB Output is correct
28 Correct 4 ms 6612 KB Output is correct
29 Correct 5 ms 6612 KB Output is correct
30 Correct 4 ms 6612 KB Output is correct
31 Correct 4 ms 6612 KB Output is correct
32 Correct 4 ms 6612 KB Output is correct
33 Correct 4 ms 6576 KB Output is correct
34 Correct 5 ms 6568 KB Output is correct
35 Correct 3 ms 6612 KB Output is correct
36 Correct 4 ms 6612 KB Output is correct
37 Correct 3 ms 6572 KB Output is correct
38 Correct 3 ms 6572 KB Output is correct
39 Correct 4 ms 6700 KB Output is correct
40 Correct 3 ms 6740 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 3 ms 6624 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 3 ms 6612 KB Output is correct
7 Correct 3 ms 6612 KB Output is correct
8 Correct 3 ms 6572 KB Output is correct
9 Correct 3 ms 6564 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 4 ms 6568 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 4 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 4 ms 6612 KB Output is correct
17 Correct 3 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 3 ms 6568 KB Output is correct
20 Correct 3 ms 6624 KB Output is correct
21 Correct 3 ms 6700 KB Output is correct
22 Correct 3 ms 6628 KB Output is correct
23 Correct 3 ms 6612 KB Output is correct
24 Correct 3 ms 6612 KB Output is correct
25 Correct 4 ms 6572 KB Output is correct
26 Correct 3 ms 6612 KB Output is correct
27 Correct 3 ms 6564 KB Output is correct
28 Correct 4 ms 6612 KB Output is correct
29 Correct 5 ms 6612 KB Output is correct
30 Correct 4 ms 6612 KB Output is correct
31 Correct 4 ms 6612 KB Output is correct
32 Correct 4 ms 6612 KB Output is correct
33 Correct 4 ms 6576 KB Output is correct
34 Correct 5 ms 6568 KB Output is correct
35 Correct 3 ms 6612 KB Output is correct
36 Correct 4 ms 6612 KB Output is correct
37 Correct 3 ms 6572 KB Output is correct
38 Correct 3 ms 6572 KB Output is correct
39 Correct 4 ms 6700 KB Output is correct
40 Correct 3 ms 6740 KB Output is correct
41 Correct 49 ms 15792 KB Output is correct
42 Correct 30 ms 11092 KB Output is correct
43 Correct 29 ms 11084 KB Output is correct
44 Correct 28 ms 11096 KB Output is correct
45 Correct 34 ms 11100 KB Output is correct
46 Correct 68 ms 15596 KB Output is correct
47 Correct 69 ms 15564 KB Output is correct
48 Correct 67 ms 15632 KB Output is correct
49 Correct 61 ms 15628 KB Output is correct
50 Correct 22 ms 9812 KB Output is correct
51 Correct 21 ms 9892 KB Output is correct
52 Correct 21 ms 9900 KB Output is correct
53 Correct 40 ms 13132 KB Output is correct
54 Correct 40 ms 13116 KB Output is correct
55 Correct 39 ms 13132 KB Output is correct
56 Correct 3 ms 6740 KB Output is correct
57 Correct 9 ms 8788 KB Output is correct
58 Correct 29 ms 16540 KB Output is correct
59 Correct 59 ms 20268 KB Output is correct
60 Correct 49 ms 16444 KB Output is correct
61 Correct 86 ms 16144 KB Output is correct