oj.uz

Submission #347199

# Submission time Handle Problem Language Result Execution time Memory
347199 2021-01-12T10:59:00 Z soroush Cat in a tree (BOI17_catinatree) C++14
100 / 100
 500 ms 26476 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn = 2e5 + 100;
const ll mod = 1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , d;
vector < int > adj[maxn];
int h[maxn] , srt[maxn];
int par[maxn] , l[maxn] , r[maxn] , tim = 0;

int seg[maxn * 4];
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)

int near[maxn];
int ord[maxn];

const int inf = 1e9;

void dfs(int v , int p = 0){
	par[v] = p;
	l[v] = tim + 1;
	tim = tim + 1;
	ord[tim] = v;
	for(int u : adj[v])if(u!=p)
		h[u] = h[v] + 1 , dfs(u , v);
	r[v] = tim;
}

bool comp(int i , int j){
	return(h[i] > h[j]);
}

void build(int v = 1 , int l = 1 , int r = maxn){
	if(r - l == 1){
		seg[v] = inf;
		return;
	}
	build(lc , l , mid);
	build(rc , mid , r);
	seg[v] = min(seg[lc] , seg[rc]);
}

void update(int L , int R , int x , int v = 1 , int l = 1 , int r = maxn){
	if(R <= l or r <= L)
		return;
	if(L <= l and r <= R){
		seg[v] = min(seg[v] , x);
		return;
	}
	update(L , R , x , lc , l , mid);
	update(L , R , x , rc , mid , r);
}

int query(int x , int v = 1 , int l = 1 , int r = maxn){
	int ans = seg[v];
	for(; r - l > 1;){
		if(x < mid)
			v = lc , r = mid;
		else
			v = rc , l = mid;
		ans = min(ans , seg[v]);
	}
	return(ans);
}

int32_t main(){
    migmig;
	cin >> n >> d;
	for(int i = 2 ; i <= n ; i ++){
		int x;
		cin >> x;
		adj[x + 1].pb(i);
		adj[i].pb(x+1);
	}
	dfs(1);
	h[0] = -1;
	for(int i = 1 ; i <= n ; i ++)	
		srt[i] = i , near[i] = inf;
	build();
	sort(srt + 1 , srt + n + 1 , comp);
	int ans = 0;
	for(int i = 1 ; i <= n ; i ++){
		int v = srt[i];
		if(l[v] > n or l[v] < 1)continue;
		if(query(l[v]) + h[v] < d)continue;
		ans++;
		int p = v;
		for( ; v ; ){
			near[v] = min(near[v] , h[p]);
			update(l[v] , r[v] + 1 , near[v] - 2*h[v]);
			v = par[v];
		}
	}
	cout << ans;
    return(0);
}

Compilation message

catinatree.cpp:1: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    1 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7148 KB Output is correct
2 Correct 7 ms 7148 KB Output is correct
3 Correct 7 ms 7148 KB Output is correct
4 Correct 7 ms 7148 KB Output is correct
5 Correct 7 ms 7148 KB Output is correct
6 Correct 7 ms 7148 KB Output is correct
7 Correct 7 ms 7148 KB Output is correct
8 Correct 7 ms 7148 KB Output is correct
9 Correct 8 ms 7148 KB Output is correct
10 Correct 9 ms 7148 KB Output is correct
11 Correct 7 ms 7148 KB Output is correct
12 Correct 7 ms 7148 KB Output is correct
13 Correct 7 ms 7148 KB Output is correct
14 Correct 7 ms 7148 KB Output is correct
15 Correct 7 ms 7168 KB Output is correct
16 Correct 7 ms 7148 KB Output is correct
17 Correct 7 ms 7148 KB Output is correct
18 Correct 7 ms 7148 KB Output is correct
19 Correct 7 ms 7148 KB Output is correct
20 Correct 7 ms 7276 KB Output is correct
21 Correct 9 ms 7276 KB Output is correct
22 Correct 8 ms 7148 KB Output is correct
23 Correct 7 ms 7148 KB Output is correct
24 Correct 8 ms 7276 KB Output is correct
25 Correct 8 ms 7148 KB Output is correct
26 Correct 8 ms 7148 KB Output is correct
27 Correct 8 ms 7148 KB Output is correct
28 Correct 8 ms 7276 KB Output is correct
29 Correct 10 ms 7404 KB Output is correct
30 Correct 9 ms 7276 KB Output is correct
31 Correct 8 ms 7276 KB Output is correct
32 Correct 8 ms 7276 KB Output is correct
33 Correct 8 ms 7276 KB Output is correct
34 Correct 8 ms 7276 KB Output is correct
35 Correct 7 ms 7276 KB Output is correct
36 Correct 8 ms 7276 KB Output is correct
37 Correct 8 ms 7276 KB Output is correct
38 Correct 8 ms 7276 KB Output is correct
39 Correct 8 ms 7276 KB Output is correct
40 Correct 42 ms 7296 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7148 KB Output is correct
2 Correct 7 ms 7148 KB Output is correct
3 Correct 7 ms 7148 KB Output is correct
4 Correct 7 ms 7148 KB Output is correct
5 Correct 7 ms 7148 KB Output is correct
6 Correct 7 ms 7148 KB Output is correct
7 Correct 7 ms 7148 KB Output is correct
8 Correct 7 ms 7148 KB Output is correct
9 Correct 8 ms 7148 KB Output is correct
10 Correct 9 ms 7148 KB Output is correct
11 Correct 7 ms 7148 KB Output is correct
12 Correct 7 ms 7148 KB Output is correct
13 Correct 7 ms 7148 KB Output is correct
14 Correct 7 ms 7148 KB Output is correct
15 Correct 7 ms 7168 KB Output is correct
16 Correct 7 ms 7148 KB Output is correct
17 Correct 7 ms 7148 KB Output is correct
18 Correct 7 ms 7148 KB Output is correct
19 Correct 7 ms 7148 KB Output is correct
20 Correct 7 ms 7276 KB Output is correct
21 Correct 9 ms 7276 KB Output is correct
22 Correct 8 ms 7148 KB Output is correct
23 Correct 7 ms 7148 KB Output is correct
24 Correct 8 ms 7276 KB Output is correct
25 Correct 8 ms 7148 KB Output is correct
26 Correct 8 ms 7148 KB Output is correct
27 Correct 8 ms 7148 KB Output is correct
28 Correct 8 ms 7276 KB Output is correct
29 Correct 10 ms 7404 KB Output is correct
30 Correct 9 ms 7276 KB Output is correct
31 Correct 8 ms 7276 KB Output is correct
32 Correct 8 ms 7276 KB Output is correct
33 Correct 8 ms 7276 KB Output is correct
34 Correct 8 ms 7276 KB Output is correct
35 Correct 7 ms 7276 KB Output is correct
36 Correct 8 ms 7276 KB Output is correct
37 Correct 8 ms 7276 KB Output is correct
38 Correct 8 ms 7276 KB Output is correct
39 Correct 8 ms 7276 KB Output is correct
40 Correct 42 ms 7296 KB Output is correct
41 Correct 125 ms 19432 KB Output is correct
42 Correct 309 ms 13804 KB Output is correct
43 Correct 74 ms 13676 KB Output is correct
44 Correct 71 ms 13676 KB Output is correct
45 Correct 83 ms 13676 KB Output is correct
46 Correct 500 ms 20332 KB Output is correct
47 Correct 158 ms 20204 KB Output is correct
48 Correct 156 ms 20204 KB Output is correct
49 Correct 170 ms 20204 KB Output is correct
50 Correct 56 ms 13932 KB Output is correct
51 Correct 51 ms 13952 KB Output is correct
52 Correct 51 ms 13932 KB Output is correct
53 Correct 108 ms 20716 KB Output is correct
54 Correct 104 ms 20716 KB Output is correct
55 Correct 104 ms 20716 KB Output is correct
56 Correct 45 ms 7404 KB Output is correct
57 Correct 33 ms 9708 KB Output is correct
58 Correct 136 ms 19180 KB Output is correct
59 Correct 244 ms 26476 KB Output is correct
60 Correct 124 ms 19816 KB Output is correct
61 Correct 136 ms 19436 KB Output is correct