oj.uz

Submission #347202

# Submission time Handle Problem Language Result Execution time Memory
347202 2021-01-12T11:13:23 Z AmShZ Cat in a tree (BOI17_catinatree) C++11
100 / 100
 510 ms 54764 KB 
// khodaya khodet komak kon
//# pragma GCC target ("avx2")
//# pragma GCC optimize("Ofast")
//# pragma GCC optimize("unroll-loops")
//# pragma GCC target("avx,avx2,sse,sse2,fma")
# pragma comment(linker, "/stack:200000000")
# pragma GCC optimize("Ofast")
# include <bits/stdc++.h>
 
/*
// ordered_set 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
# define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
*/
 
using namespace std;
 
typedef long long                                        ll;
typedef long double                                      ld;
typedef pair <int, int>                                  pii;
typedef pair <pii, int>                                  ppi;
typedef pair <int, pii>                                  pip;
typedef pair <pii, pii>                                  ppp;
typedef pair <ll, ll>                                    pll;
 
# define A                                               first
# define B                                               second
# define endl                                            '\n'
# define sep                                             ' '
# define all(x)                                          x.begin(), x.end()
# define kill(x)                                         return cout << x << endl, 0
# define SZ(x)                                           int(x.size())
# define lc                                              id << 1
# define rc                                              id << 1 | 1
# define InTheNameOfGod                                  ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
 
ll power(ll a, ll b, ll md) {return (!b ? 1 : (b & 1 ? a * power(a * a % md, b / 2, md) % md : power(a * a % md, b / 2, md) % md));}
 
const int xn = 2e5 + 10;
const int xm = 10 + 10;
const int sq = 10;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int mod = 998244353;
const int base = 257;

int n, sz[xn], H[xn], ord[xn];
int f[xn], ans, d, ptr[xn];
pii rts[xn][xm];
vector <int> adj[xn];
bool hide[xn];

void plant(int v, int p = - 1){
	sz[v] = 1;
	for (int u : adj[v])
		if (u != p && !hide[u])
			plant(u, v), sz[v] += sz[u];
}
void add(int v, int root, int h = 0, int p = - 1){
	rts[v][ptr[v] ++] = {root, h};
	for (int u : adj[v])
		if (!hide[u] && u != p)
			add(u, root, h + 1, v);
}
int find_centroid(int v, int s, int p = - 1){
	for (int u : adj[v])
		if (!hide[u] && u != p && sz[u] + sz[u] > s)
			return find_centroid(u, s, v);
	return v;
}
void solve(int v){
	plant(v);
	v = find_centroid(v, sz[v]);
	f[v] = inf, add(v, v);
	hide[v] = true;
	for (int u : adj[v])
		if (!hide[u])
			solve(u);
}
bool cmp(int v, int u){ return H[v] > H[u];}

int main(){
	InTheNameOfGod;
	
	cin >> n >> d;
	for (int i = 1; i < n; ++ i){
		int par;
		cin >> par;
		adj[par].push_back(i);
		adj[i].push_back(par);
		H[i] = H[par] + 1;
		ord[i] = i;
	}
	solve(0);
	sort(ord, ord + n, cmp);
	for (int i = 0; i < n; ++ i){
		int v = ord[i];
		bool flag = false;
		for (int j = 0; j < ptr[v]; ++ j)
			flag |= rts[v][j].B + f[rts[v][j].A] < d;
		if (flag)
			continue;
		++ ans;
		for (int j = 0; j < ptr[v]; ++ j)
			f[rts[v][j].A] = min(f[rts[v][j].A], rts[v][j].B);
	}
	cout << ans << endl;
	
	return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 5 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 5 ms 5484 KB Output is correct
22 Correct 4 ms 5228 KB Output is correct
23 Correct 4 ms 5228 KB Output is correct
24 Correct 5 ms 5228 KB Output is correct
25 Correct 4 ms 5228 KB Output is correct
26 Correct 5 ms 5228 KB Output is correct
27 Correct 5 ms 5228 KB Output is correct
28 Correct 5 ms 5356 KB Output is correct
29 Correct 5 ms 5356 KB Output is correct
30 Correct 5 ms 5356 KB Output is correct
31 Correct 5 ms 5356 KB Output is correct
32 Correct 4 ms 5356 KB Output is correct
33 Correct 4 ms 5356 KB Output is correct
34 Correct 4 ms 5356 KB Output is correct
35 Correct 5 ms 5356 KB Output is correct
36 Correct 6 ms 5356 KB Output is correct
37 Correct 5 ms 5356 KB Output is correct
38 Correct 5 ms 5356 KB Output is correct
39 Correct 5 ms 5356 KB Output is correct
40 Correct 5 ms 5484 KB Output is correct
41 Correct 120 ms 44812 KB Output is correct
42 Correct 181 ms 25964 KB Output is correct
43 Correct 206 ms 25964 KB Output is correct
44 Correct 174 ms 25984 KB Output is correct
45 Correct 170 ms 25964 KB Output is correct
46 Correct 469 ms 46956 KB Output is correct
47 Correct 472 ms 47084 KB Output is correct
48 Correct 510 ms 47084 KB Output is correct
49 Correct 479 ms 47228 KB Output is correct
50 Correct 110 ms 26476 KB Output is correct
51 Correct 110 ms 26476 KB Output is correct
52 Correct 110 ms 26604 KB Output is correct
53 Correct 297 ms 47852 KB Output is correct
54 Correct 289 ms 47724 KB Output is correct
55 Correct 278 ms 47724 KB Output is correct
56 Correct 6 ms 5612 KB Output is correct
57 Correct 22 ms 10988 KB Output is correct
58 Correct 108 ms 33004 KB Output is correct
59 Correct 427 ms 54764 KB Output is correct
60 Correct 126 ms 45800 KB Output is correct
61 Correct 214 ms 44832 KB Output is correct