oj.uz

답안 #924950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924950 2024-02-10T06:01:38 Z Faisal_Saqib Cat in a tree (BOI17_catinatree) C++17
100 / 100
 687 ms 42832 KB 
#include <iostream>
#include <vector>
#include <bitset>
#include <map>
using namespace std;
const int N=2e5+10;
const int LG=18;
int n,d;
int pw2[LG];
int par[N][LG];
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=0)
{
	h[x]=h[p]+1;
	vep[h[x]].push_back(x);
	sz[x]=1;
	par[x][0]=p;
	for(int j=1;j<LG;j++)
		par[x][j]=par[par[x][j-1]][j-1];
	for(int y:ma[x])
	{
		if(y!=p)
		{
			dfs(y,x);
			sz[x]+=sz[y];
		}
	}
}
int find_centriod(int x,int p=0)
{
	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;
}
int solve(int x)
{
	cn=sz[x];
	int c=find_centriod(x);
	dead[c]=1;
	for(int y:ma[c])
		if(!dead[y])
			part[solve(y)]=c;
	return c;
}
// map<pair<int,int>,int> memo;
int dist1(int x,int y)
{
	if(h[x]<h[y])
		swap(x,y);
	int ans=h[x]+h[y];
	for(int j=LG-1;j>=0;j--)
	{
		if(h[par[x][j]]>=h[y])
		{
			x=par[x][j];
		}
	}
	for(int j=LG-1;j>=0;j--)
	{
		if(par[x][j]!=par[y][j])
		{
			x=par[x][j];
			y=par[y][j];
		}
	}
	if(x!=y)
		x=par[x][0];
	return ans-(2*h[x]);
}
void color(int st)
{
	// cout<<"Marked "<<st<<endl;
	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);
	pw2[0]=1;
	for(int i=1;i<LG;i++)
		pw2[i]=(pw2[i-1]*2ll);
	cin>>n>>d;
	for(int i=2;i<=n;i++)
	{
		int p;
		cin>>p;
		p++;
		ma[p].push_back(i);
		ma[i].push_back(p);
	}
	int ans=0;
	for(int j=1;j<=n;j++)
		dist[j]=1e9;
	dfs(1);
	solve(1);
	for(int cur_h=n;cur_h>=1;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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 3 ms 14792 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 5 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14772 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14680 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 6 ms 14684 KB Output is correct
15 Correct 3 ms 14684 KB Output is correct
16 Correct 4 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14680 KB Output is correct
19 Correct 3 ms 14816 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 3 ms 14792 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 5 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14772 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14680 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 6 ms 14684 KB Output is correct
15 Correct 3 ms 14684 KB Output is correct
16 Correct 4 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14680 KB Output is correct
19 Correct 3 ms 14816 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 6 ms 14936 KB Output is correct
22 Correct 4 ms 14684 KB Output is correct
23 Correct 4 ms 14684 KB Output is correct
24 Correct 4 ms 14684 KB Output is correct
25 Correct 5 ms 14684 KB Output is correct
26 Correct 5 ms 14684 KB Output is correct
27 Correct 4 ms 14684 KB Output is correct
28 Correct 5 ms 14684 KB Output is correct
29 Correct 6 ms 14684 KB Output is correct
30 Correct 5 ms 14684 KB Output is correct
31 Correct 5 ms 14684 KB Output is correct
32 Correct 4 ms 14684 KB Output is correct
33 Correct 4 ms 14684 KB Output is correct
34 Correct 4 ms 14680 KB Output is correct
35 Correct 4 ms 14684 KB Output is correct
36 Correct 5 ms 14684 KB Output is correct
37 Correct 5 ms 14684 KB Output is correct
38 Correct 5 ms 14684 KB Output is correct
39 Correct 6 ms 14712 KB Output is correct
40 Correct 6 ms 14940 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 3 ms 14792 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 5 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 3 ms 14772 KB Output is correct
10 Correct 3 ms 14936 KB Output is correct
11 Correct 3 ms 14680 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 6 ms 14684 KB Output is correct
15 Correct 3 ms 14684 KB Output is correct
16 Correct 4 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14680 KB Output is correct
19 Correct 3 ms 14816 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 6 ms 14936 KB Output is correct
22 Correct 4 ms 14684 KB Output is correct
23 Correct 4 ms 14684 KB Output is correct
24 Correct 4 ms 14684 KB Output is correct
25 Correct 5 ms 14684 KB Output is correct
26 Correct 5 ms 14684 KB Output is correct
27 Correct 4 ms 14684 KB Output is correct
28 Correct 5 ms 14684 KB Output is correct
29 Correct 6 ms 14684 KB Output is correct
30 Correct 5 ms 14684 KB Output is correct
31 Correct 5 ms 14684 KB Output is correct
32 Correct 4 ms 14684 KB Output is correct
33 Correct 4 ms 14684 KB Output is correct
34 Correct 4 ms 14680 KB Output is correct
35 Correct 4 ms 14684 KB Output is correct
36 Correct 5 ms 14684 KB Output is correct
37 Correct 5 ms 14684 KB Output is correct
38 Correct 5 ms 14684 KB Output is correct
39 Correct 6 ms 14712 KB Output is correct
40 Correct 6 ms 14940 KB Output is correct
41 Correct 175 ms 33608 KB Output is correct
42 Correct 357 ms 24988 KB Output is correct
43 Correct 208 ms 24952 KB Output is correct
44 Correct 212 ms 24696 KB Output is correct
45 Correct 214 ms 24912 KB Output is correct
46 Correct 684 ms 34712 KB Output is correct
47 Correct 458 ms 34644 KB Output is correct
48 Correct 483 ms 34896 KB Output is correct
49 Correct 452 ms 34712 KB Output is correct
50 Correct 157 ms 25424 KB Output is correct
51 Correct 153 ms 25180 KB Output is correct
52 Correct 150 ms 25172 KB Output is correct
53 Correct 348 ms 35408 KB Output is correct
54 Correct 335 ms 35412 KB Output is correct
55 Correct 343 ms 35156 KB Output is correct
56 Correct 9 ms 14940 KB Output is correct
57 Correct 58 ms 17244 KB Output is correct
58 Correct 318 ms 32952 KB Output is correct
59 Correct 687 ms 42832 KB Output is correct
60 Correct 187 ms 34092 KB Output is correct
61 Correct 323 ms 33376 KB Output is correct