oj.uz

Submission #524590

# Submission time Handle Problem Language Result Execution time Memory
524590 2022-02-09T15:20:35 Z Yazan_Alattar Cat in a tree (BOI17_catinatree) C++14
100 / 100
 558 ms 41784 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e9;
const ll mod = 998244353;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

vector < pair <int,int> > v;
vector <int> adj[M];
int n, d, p[M], mn[M], sz[M], add[M], dep[M], dist, ans, anc[M][20];
bool vist[M];

void calc(int node, int par)
{
	sz[node] = 1;
	for(auto i : adj[node]) if(i != par && !vist[i]){
		calc(i, node);
		sz[node] += sz[i];
	}
	return;
}

int get(int node, int par, int half)
{
	++dist;
	for(auto i : adj[node]) if(!vist[i] && i != par && sz[i] > half) return get(i, node, half);
	return node;
}

void decompose(int node, int par)
{
	dist = 0;
	calc(node, 0);
	int cen = get(node, 0, sz[node] / 2);
	vist[cen] = 1;
	p[cen] = par;
	add[cen] = dist;
	for(auto i : adj[cen]) if(!vist[i]) decompose(i, cen);
	return;
}

void dfs(int node, int par)
{
	v.pb({dep[node], node});
	for(auto i : adj[node]) if(i != par){
		dep[i] = dep[node] + 1;
		anc[i][0] = node;
		dfs(i, node);
	}
	return;
}

int lca(int x, int y)
{
	if(x == y) return 0;
	int ret = 0;
	if(dep[x] < dep[y]) swap(x, y);
	for(int i = 19; i >= 0; --i) if(dep[anc[x][i]] >= dep[y]){
		ret += (1 << i);
		x = anc[x][i];
	}
	if(x == y) return ret;
	for(int i = 19; i >= 0; --i) if(anc[x][i] != anc[y][i]){
		ret += 2 * (1 << i);
		x = anc[x][i];
		y = anc[y][i];
	}
	return ret + 2;
}

int main()
{
	scanf("%d%d", &n, &d);
	for(int i = 2; i <= n; ++i){
		int a;
		scanf("%d", &a);
		adj[a + 1].pb(i);
		adj[i].pb(a + 1);
	}
	decompose(1, 0);
	dep[1] = 1;
	dfs(1, 0);
	for(int j = 1; j < 20; ++j) for(int i = 1; i <= n; ++i) anc[i][j] = anc[anc[i][j - 1]][j - 1];
	sort(all(v), greater < pair <int,int> > ());
	for(int i = 1; i <= n; ++i) mn[i] = inf;
	for(auto i : v){
		bool ok = 1;
		int cur = i.S;
		while(cur){
			if(mn[cur] + lca(i.S, cur) < d) ok = 0;
			cur = p[cur];
		}
		if(ok){
			++ans;
			cur = i.S;
			while(cur){
				mn[cur] = min(mn[cur], lca(i.S, cur));
				dist += add[cur];
				cur = p[cur];
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:80:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |  scanf("%d%d", &n, &d);
      |  ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |   scanf("%d", &a);
      |   ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4988 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 2 ms 4988 KB Output is correct
9 Correct 3 ms 4996 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4996 KB Output is correct
13 Correct 3 ms 4996 KB Output is correct
14 Correct 2 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4992 KB Output is correct
18 Correct 3 ms 4996 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 4 ms 5324 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 3 ms 4996 KB Output is correct
25 Correct 4 ms 5124 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 3 ms 5068 KB Output is correct
28 Correct 4 ms 5244 KB Output is correct
29 Correct 4 ms 5172 KB Output is correct
30 Correct 4 ms 5252 KB Output is correct
31 Correct 4 ms 5220 KB Output is correct
32 Correct 3 ms 5196 KB Output is correct
33 Correct 4 ms 5196 KB Output is correct
34 Correct 4 ms 5196 KB Output is correct
35 Correct 4 ms 5152 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 5 ms 5256 KB Output is correct
38 Correct 5 ms 5192 KB Output is correct
39 Correct 5 ms 5216 KB Output is correct
40 Correct 4 ms 5324 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4988 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 2 ms 4988 KB Output is correct
9 Correct 3 ms 4996 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4996 KB Output is correct
13 Correct 3 ms 4996 KB Output is correct
14 Correct 2 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4992 KB Output is correct
18 Correct 3 ms 4996 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 4 ms 5324 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 3 ms 4996 KB Output is correct
25 Correct 4 ms 5124 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 3 ms 5068 KB Output is correct
28 Correct 4 ms 5244 KB Output is correct
29 Correct 4 ms 5172 KB Output is correct
30 Correct 4 ms 5252 KB Output is correct
31 Correct 4 ms 5220 KB Output is correct
32 Correct 3 ms 5196 KB Output is correct
33 Correct 4 ms 5196 KB Output is correct
34 Correct 4 ms 5196 KB Output is correct
35 Correct 4 ms 5152 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 5 ms 5256 KB Output is correct
38 Correct 5 ms 5192 KB Output is correct
39 Correct 5 ms 5216 KB Output is correct
40 Correct 4 ms 5324 KB Output is correct
41 Correct 132 ms 32620 KB Output is correct
42 Correct 202 ms 19540 KB Output is correct
43 Correct 148 ms 19580 KB Output is correct
44 Correct 160 ms 19544 KB Output is correct
45 Correct 140 ms 19588 KB Output is correct
46 Correct 435 ms 33968 KB Output is correct
47 Correct 386 ms 34076 KB Output is correct
48 Correct 365 ms 33968 KB Output is correct
49 Correct 365 ms 34076 KB Output is correct
50 Correct 90 ms 19864 KB Output is correct
51 Correct 98 ms 19920 KB Output is correct
52 Correct 111 ms 19800 KB Output is correct
53 Correct 228 ms 34484 KB Output is correct
54 Correct 227 ms 34476 KB Output is correct
55 Correct 215 ms 34416 KB Output is correct
56 Correct 6 ms 5452 KB Output is correct
57 Correct 35 ms 9724 KB Output is correct
58 Correct 203 ms 26476 KB Output is correct
59 Correct 558 ms 41784 KB Output is correct
60 Correct 153 ms 33176 KB Output is correct
61 Correct 288 ms 32500 KB Output is correct