#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
int n;
vector<int>e[200005];
int vis[200005];
int fa[2500][2005];
int dis[2500][2005];
int dph[200005];
int sbsz[200005];
int lvl[200005];
void dfssz(int nw,int pa){
sbsz[nw]=1;
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i];
if(vis[v]||v==pa){continue;}
dfssz(v,nw);
sbsz[v]+=sbsz[nw];
}
}
int fincen(int nw,int pa,int tot){
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i];
if(vis[v]||v==pa){continue;}
int vl=fincen(v,nw,tot);
if(vl){return vl;}
}
if(sbsz[nw]*2>=tot){
return nw;
}return 0;
}
void dfsdph(int nw,int pa,int flv,int cfa){
dph[nw]=dph[pa]+1;
for(int i=0;i<e[nw].size();i++){
int v=e[nw][i];
if(v==pa||vis[v]){continue;}
dfsdph(v,nw,flv,cfa);
}
dis[flv][nw]=dph[nw]-1;
fa[flv][nw]=cfa;
}
void decompose(int rt,int lv){
dfssz(rt,0);
int cen=fincen(rt,0,sbsz[rt]);
lvl[cen]=lv;
dfsdph(cen,0,lv,cen);
vis[cen]=1;
for(int i=0;i<e[cen].size();i++){
int v=e[cen][i];
if(vis[v]){continue;}
decompose(v,lv+1);
}
}
int mnd[200005];
void upd(int v){
mnd[v]=0;
int nw=v;
for(int i=lvl[v]-1;i>=1;i--){
nw=fa[i][v];
int d=dis[i][v];
mnd[nw]=min(mnd[nw],d);
}
}
int qry(int v){
int ret=mnd[v];
int nw=v;
for(int i=lvl[v]-1;i>=1;i--){
nw=fa[i][v];
int d=dis[i][v];
ret=min(ret,d+mnd[nw]);
}
return ret;
}
int D;
signed main() {
cin>>n>>D;
for(int i=2;i<=n;i++){
int a;int b;
cin>>a;
a++;b=i;
e[a].push_back(b);
e[b].push_back(a);
}
decompose(1,1);
for(int i=1;i<=n;i++){
vis[i]=0;
}
dfsdph(1,0,0,0);
for(int i=1;i<=n;i++){
mnd[i]=1e9;
}
vector<pair<int,int>>vc;
for(int i=1;i<=n;i++){
vc.push_back({-dph[i],i});
}
sort(vc.begin(),vc.end());
int ans=0;
for(int i=0;i<vc.size();i++){
int v=vc[i].second;
if(qry(v)<D){continue;}
ans++;
upd(v);
}
cout<<ans<<endl;
}
Compilation message
catinatree.cpp: In function 'void dfssz(int, int)':
catinatree.cpp:18:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
18 | for(int i=0;i<e[nw].size();i++){
| ~^~~~~~~~~~~~~
catinatree.cpp: In function 'int fincen(int, int, int)':
catinatree.cpp:26:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | for(int i=0;i<e[nw].size();i++){
| ~^~~~~~~~~~~~~
catinatree.cpp: In function 'void dfsdph(int, int, int, int)':
catinatree.cpp:38:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
38 | for(int i=0;i<e[nw].size();i++){
| ~^~~~~~~~~~~~~
catinatree.cpp: In function 'void decompose(int, int)':
catinatree.cpp:53:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for(int i=0;i<e[cen].size();i++){
| ~^~~~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:104:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
104 | for(int i=0;i<vc.size();i++){
| ~^~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
5076 KB |
Output is correct |
2 |
Correct |
3 ms |
5076 KB |
Output is correct |
3 |
Correct |
3 ms |
5076 KB |
Output is correct |
4 |
Correct |
3 ms |
5076 KB |
Output is correct |
5 |
Correct |
3 ms |
5076 KB |
Output is correct |
6 |
Correct |
3 ms |
5076 KB |
Output is correct |
7 |
Correct |
3 ms |
5076 KB |
Output is correct |
8 |
Correct |
3 ms |
5076 KB |
Output is correct |
9 |
Correct |
3 ms |
5076 KB |
Output is correct |
10 |
Correct |
3 ms |
5076 KB |
Output is correct |
11 |
Correct |
3 ms |
5076 KB |
Output is correct |
12 |
Correct |
3 ms |
5076 KB |
Output is correct |
13 |
Correct |
3 ms |
5076 KB |
Output is correct |
14 |
Correct |
3 ms |
5088 KB |
Output is correct |
15 |
Correct |
3 ms |
5076 KB |
Output is correct |
16 |
Correct |
3 ms |
5076 KB |
Output is correct |
17 |
Correct |
3 ms |
5076 KB |
Output is correct |
18 |
Correct |
3 ms |
5076 KB |
Output is correct |
19 |
Correct |
4 ms |
5080 KB |
Output is correct |
20 |
Correct |
3 ms |
5076 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
5076 KB |
Output is correct |
2 |
Correct |
3 ms |
5076 KB |
Output is correct |
3 |
Correct |
3 ms |
5076 KB |
Output is correct |
4 |
Correct |
3 ms |
5076 KB |
Output is correct |
5 |
Correct |
3 ms |
5076 KB |
Output is correct |
6 |
Correct |
3 ms |
5076 KB |
Output is correct |
7 |
Correct |
3 ms |
5076 KB |
Output is correct |
8 |
Correct |
3 ms |
5076 KB |
Output is correct |
9 |
Correct |
3 ms |
5076 KB |
Output is correct |
10 |
Correct |
3 ms |
5076 KB |
Output is correct |
11 |
Correct |
3 ms |
5076 KB |
Output is correct |
12 |
Correct |
3 ms |
5076 KB |
Output is correct |
13 |
Correct |
3 ms |
5076 KB |
Output is correct |
14 |
Correct |
3 ms |
5088 KB |
Output is correct |
15 |
Correct |
3 ms |
5076 KB |
Output is correct |
16 |
Correct |
3 ms |
5076 KB |
Output is correct |
17 |
Correct |
3 ms |
5076 KB |
Output is correct |
18 |
Correct |
3 ms |
5076 KB |
Output is correct |
19 |
Correct |
4 ms |
5080 KB |
Output is correct |
20 |
Correct |
3 ms |
5076 KB |
Output is correct |
21 |
Correct |
52 ms |
24964 KB |
Output is correct |
22 |
Correct |
9 ms |
10980 KB |
Output is correct |
23 |
Correct |
8 ms |
10964 KB |
Output is correct |
24 |
Correct |
8 ms |
10964 KB |
Output is correct |
25 |
Correct |
21 ms |
20772 KB |
Output is correct |
26 |
Correct |
28 ms |
20820 KB |
Output is correct |
27 |
Correct |
21 ms |
20744 KB |
Output is correct |
28 |
Correct |
43 ms |
28692 KB |
Output is correct |
29 |
Correct |
45 ms |
28720 KB |
Output is correct |
30 |
Correct |
44 ms |
28816 KB |
Output is correct |
31 |
Correct |
42 ms |
28796 KB |
Output is correct |
32 |
Correct |
38 ms |
28264 KB |
Output is correct |
33 |
Correct |
35 ms |
28340 KB |
Output is correct |
34 |
Correct |
31 ms |
27148 KB |
Output is correct |
35 |
Correct |
30 ms |
27220 KB |
Output is correct |
36 |
Correct |
38 ms |
28760 KB |
Output is correct |
37 |
Correct |
37 ms |
28748 KB |
Output is correct |
38 |
Correct |
53 ms |
28760 KB |
Output is correct |
39 |
Correct |
44 ms |
28804 KB |
Output is correct |
40 |
Correct |
47 ms |
25024 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
5076 KB |
Output is correct |
2 |
Correct |
3 ms |
5076 KB |
Output is correct |
3 |
Correct |
3 ms |
5076 KB |
Output is correct |
4 |
Correct |
3 ms |
5076 KB |
Output is correct |
5 |
Correct |
3 ms |
5076 KB |
Output is correct |
6 |
Correct |
3 ms |
5076 KB |
Output is correct |
7 |
Correct |
3 ms |
5076 KB |
Output is correct |
8 |
Correct |
3 ms |
5076 KB |
Output is correct |
9 |
Correct |
3 ms |
5076 KB |
Output is correct |
10 |
Correct |
3 ms |
5076 KB |
Output is correct |
11 |
Correct |
3 ms |
5076 KB |
Output is correct |
12 |
Correct |
3 ms |
5076 KB |
Output is correct |
13 |
Correct |
3 ms |
5076 KB |
Output is correct |
14 |
Correct |
3 ms |
5088 KB |
Output is correct |
15 |
Correct |
3 ms |
5076 KB |
Output is correct |
16 |
Correct |
3 ms |
5076 KB |
Output is correct |
17 |
Correct |
3 ms |
5076 KB |
Output is correct |
18 |
Correct |
3 ms |
5076 KB |
Output is correct |
19 |
Correct |
4 ms |
5080 KB |
Output is correct |
20 |
Correct |
3 ms |
5076 KB |
Output is correct |
21 |
Correct |
52 ms |
24964 KB |
Output is correct |
22 |
Correct |
9 ms |
10980 KB |
Output is correct |
23 |
Correct |
8 ms |
10964 KB |
Output is correct |
24 |
Correct |
8 ms |
10964 KB |
Output is correct |
25 |
Correct |
21 ms |
20772 KB |
Output is correct |
26 |
Correct |
28 ms |
20820 KB |
Output is correct |
27 |
Correct |
21 ms |
20744 KB |
Output is correct |
28 |
Correct |
43 ms |
28692 KB |
Output is correct |
29 |
Correct |
45 ms |
28720 KB |
Output is correct |
30 |
Correct |
44 ms |
28816 KB |
Output is correct |
31 |
Correct |
42 ms |
28796 KB |
Output is correct |
32 |
Correct |
38 ms |
28264 KB |
Output is correct |
33 |
Correct |
35 ms |
28340 KB |
Output is correct |
34 |
Correct |
31 ms |
27148 KB |
Output is correct |
35 |
Correct |
30 ms |
27220 KB |
Output is correct |
36 |
Correct |
38 ms |
28760 KB |
Output is correct |
37 |
Correct |
37 ms |
28748 KB |
Output is correct |
38 |
Correct |
53 ms |
28760 KB |
Output is correct |
39 |
Correct |
44 ms |
28804 KB |
Output is correct |
40 |
Correct |
47 ms |
25024 KB |
Output is correct |
41 |
Execution timed out |
1077 ms |
18760 KB |
Time limit exceeded |
42 |
Halted |
0 ms |
0 KB |
- |