oj.uz

Submission #924942

# Submission time Handle Problem Language Result Execution time Memory
924942 2024-02-10T05:34:01 Z Faisal_Saqib Cat in a tree (BOI17_catinatree) C++17
51 / 100
 1000 ms 115680 KB 
#include <iostream>
#include <vector>
#include <bitset>
#include <map>
using namespace std;
const int N=2e5+10;
int n,d;
vector<int> ma[N],vep[N];
int part[N];
int h[N],dist[N],sz[N];
bitset<N> dead;
int cn;
void dfs(int&x,int p=-1)
{
	sz[x]=1;
	for(int&y:ma[x])
	{
		if(y!=p)
		{
			dfs(y,x);
			sz[x]+=sz[y];
		}
	}
}
int find_centriod(int&x,int p=-1)
{
	for(int&y:ma[x])
	{
		if(y!=p and !dead[y] and sz[y]>(cn/2))
		{
			sz[x]-=sz[y];
			sz[y]+=sz[x];
			return find_centriod(y,x);
		}
	}
	return x;
}
map<int,int> dist1[N];
int tlp;
void compute_distance(int&x,int p=-1)
{
	for(int&y:ma[x])
	{
		if(p!=y and !dead[y])
		{
			dist1[tlp][y]=dist1[tlp][x]+1;
			compute_distance(y,x);
		}
	}
}
int solve(int&x)
{
	cn=sz[x];
	int c=find_centriod(x);
	dist1[c][c]=0;
	tlp=c;
	compute_distance(c);
	dead[c]=1;
	for(int&y:ma[c])
		if(!dead[y])
			part[solve(y)]=c;
	return c;
}
void color(int&st)
{
	int x=st;
	while(x>0)
	{
		dist[x]=min(dist[x],dist1[x][st]);	
		x=part[x];
	}
}
int query(int&st)
{
	int x=st;
	int ans=dist[x];
	while(x>0)
	{
		ans=min(ans,dist1[x][st]+dist[x]);
		x=part[x];
	}
	return ans;
}
int main()
{
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);
	cin>>n>>d;
	vep[0].push_back(1);
	int max_h=0;
	for(int i=2;i<=n;i++)
	{
		int p;
		cin>>p;
		p++;
		h[i]=h[p]+1;
		vep[h[i]].push_back(i);
		max_h=max(max_h,h[i]);
		ma[p].push_back(i);
		ma[i].push_back(p);
	}
	int ans=0;
	for(int j=1;j<=n;j++)
		dist[j]=1e9;
	int o_1=1;
	dfs(o_1);
	solve(o_1);
	for(int cur_h=max_h;cur_h>=0;cur_h--)
	{
		for(int&v:vep[cur_h])
		{
			if(query(v)>=d)
			{
				ans++;
				color(v);
			}
		}
	}
	cout<<ans<<'\n';
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 20316 KB Output is correct
2 Correct 5 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 4 ms 20316 KB Output is correct
5 Correct 5 ms 20316 KB Output is correct
6 Correct 5 ms 20300 KB Output is correct
7 Correct 5 ms 20120 KB Output is correct
8 Correct 5 ms 20316 KB Output is correct
9 Correct 4 ms 20316 KB Output is correct
10 Correct 5 ms 20148 KB Output is correct
11 Correct 4 ms 20316 KB Output is correct
12 Correct 4 ms 20316 KB Output is correct
13 Correct 5 ms 20312 KB Output is correct
14 Correct 5 ms 20316 KB Output is correct
15 Correct 4 ms 20360 KB Output is correct
16 Correct 4 ms 20312 KB Output is correct
17 Correct 5 ms 20316 KB Output is correct
18 Correct 4 ms 20316 KB Output is correct
19 Correct 4 ms 20316 KB Output is correct
20 Correct 4 ms 20560 KB Output is correct
21 Correct 7 ms 21080 KB Output is correct
22 Correct 5 ms 20316 KB Output is correct
23 Correct 5 ms 20316 KB Output is correct
24 Correct 5 ms 20316 KB Output is correct
25 Correct 8 ms 20572 KB Output is correct
26 Correct 6 ms 20572 KB Output is correct
27 Correct 6 ms 20664 KB Output is correct
28 Correct 7 ms 20828 KB Output is correct
29 Correct 7 ms 20828 KB Output is correct
30 Correct 7 ms 20828 KB Output is correct
31 Correct 6 ms 20824 KB Output is correct
32 Correct 6 ms 20568 KB Output is correct
33 Correct 5 ms 20572 KB Output is correct
34 Correct 6 ms 20568 KB Output is correct
35 Correct 7 ms 20552 KB Output is correct
36 Correct 6 ms 20572 KB Output is correct
37 Correct 8 ms 20900 KB Output is correct
38 Correct 7 ms 20824 KB Output is correct
39 Correct 7 ms 20828 KB Output is correct
40 Correct 7 ms 21112 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 20316 KB Output is correct
2 Correct 5 ms 20316 KB Output is correct
3 Correct 4 ms 20316 KB Output is correct
4 Correct 4 ms 20316 KB Output is correct
5 Correct 5 ms 20316 KB Output is correct
6 Correct 5 ms 20300 KB Output is correct
7 Correct 5 ms 20120 KB Output is correct
8 Correct 5 ms 20316 KB Output is correct
9 Correct 4 ms 20316 KB Output is correct
10 Correct 5 ms 20148 KB Output is correct
11 Correct 4 ms 20316 KB Output is correct
12 Correct 4 ms 20316 KB Output is correct
13 Correct 5 ms 20312 KB Output is correct
14 Correct 5 ms 20316 KB Output is correct
15 Correct 4 ms 20360 KB Output is correct
16 Correct 4 ms 20312 KB Output is correct
17 Correct 5 ms 20316 KB Output is correct
18 Correct 4 ms 20316 KB Output is correct
19 Correct 4 ms 20316 KB Output is correct
20 Correct 4 ms 20560 KB Output is correct
21 Correct 7 ms 21080 KB Output is correct
22 Correct 5 ms 20316 KB Output is correct
23 Correct 5 ms 20316 KB Output is correct
24 Correct 5 ms 20316 KB Output is correct
25 Correct 8 ms 20572 KB Output is correct
26 Correct 6 ms 20572 KB Output is correct
27 Correct 6 ms 20664 KB Output is correct
28 Correct 7 ms 20828 KB Output is correct
29 Correct 7 ms 20828 KB Output is correct
30 Correct 7 ms 20828 KB Output is correct
31 Correct 6 ms 20824 KB Output is correct
32 Correct 6 ms 20568 KB Output is correct
33 Correct 5 ms 20572 KB Output is correct
34 Correct 6 ms 20568 KB Output is correct
35 Correct 7 ms 20552 KB Output is correct
36 Correct 6 ms 20572 KB Output is correct
37 Correct 8 ms 20900 KB Output is correct
38 Correct 7 ms 20824 KB Output is correct
39 Correct 7 ms 20828 KB Output is correct
40 Correct 7 ms 21112 KB Output is correct
41 Correct 162 ms 55028 KB Output is correct
42 Correct 525 ms 67664 KB Output is correct
43 Correct 497 ms 68896 KB Output is correct
44 Correct 486 ms 68520 KB Output is correct
45 Correct 458 ms 67856 KB Output is correct
46 Execution timed out 1062 ms 115680 KB Time limit exceeded
47 Halted 0 ms 0 KB -