oj.uz

Submission #642715

# Submission time Handle Problem Language Result Execution time Memory
642715 2022-09-20T12:05:12 Z karrigan Cat in a tree (BOI17_catinatree) C++14
100 / 100
 255 ms 26832 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int>a[200001];
int dep[200001];
int dep2[200001];
int in[200001];
int out[200001];
int p[200001];
int cnt=0;
void dfs(int u,int par){
in[u]=++cnt;
for (auto v:a[u]){
    if (v==par)continue;
    dep[v]=dep[u]+1;
    p[v]=u;
    dfs(v,u);
}
out[u]=cnt;
}
int st[800001];
int st2[800001];
void update(int id,int l,int r,int u,int val){
if (l>u||r<u)return;
if (l==r){
    st[id]=val;
    st2[id]=val;
    return;
}
int mid=(l+r)/2;
update(id*2,l,mid,u,val);
update(id*2+1,mid+1,r,u,val);
if (dep[st[id*2]]>dep[st[id*2+1]])st[id]=st[id*2+1];
else st[id]=st[id*2];
if (dep2[st2[id*2]]<dep2[st2[id*2+1]])st2[id]=st2[id*2+1];
else st2[id]=st2[id*2];
}
int get(int id,int l,int r,int u,int v){
if (l>v||r<u||u>v)return 0;
if (u<=l&&r<=v)return st[id];
int mid=(l+r)/2;
int t1=get(id*2,l,mid,u,v);
int t2=get(id*2+1,mid+1,r,u,v);
if (dep[t1]>dep[t2])return t2;
else return t1;
}
int get2(int id,int l,int r,int u,int v){
if (l>v||r<u||u>v)return 0;
if (u<=l&&r<=v)return st2[id];
int mid=(l+r)/2;
int t1=get2(id*2,l,mid,u,v);
int t2=get2(id*2+1,mid+1,r,u,v);
if (dep2[t1]<dep2[t2])return t2;
else return t1;
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	//freopen(".INP","r",stdin);
	//freopen(".OUT","w",stdout);
	int n,d;
	cin>>n>>d;
	for (int i=2;i<=n;i++){
        int p;
        cin>>p;
        p++;
        a[p].push_back(i);
        a[i].push_back(p);
	}
	dfs(1,0);
	dep[0]=n+1;
	for (int i=1;i<=n;i++)dep2[i]=dep[i];
	for (int i=1;i<=n;i++){
        update(1,1,n,in[i],i);
	}
	vector<int>tp;
	while (get2(1,1,n,in[1],out[1])!=0){
        auto t=get2(1,1,n,in[1],out[1]);
        update(1,1,n,in[t],0);
        tp.push_back(t);
        for (int i=0;i<d;i++){
            if (t==0)break;
            while (get(1,1,n,in[t],out[t])!=0){
                int del=get(1,1,n,in[t],out[t]);
                if (dep[del]+dep[tp.back()]-2*dep[t]>=d){
                break;
                }
                else {
                update(1,1,n,in[del],0);
                }
            }
            t=p[t];
        }
	}
	cout<<tp.size()<<'\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5032 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5032 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4996 KB Output is correct
17 Correct 3 ms 5024 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 4 ms 5024 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 5 ms 5204 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 4 ms 5028 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 4 ms 5076 KB Output is correct
29 Correct 5 ms 5172 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 4 ms 5084 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 4 ms 5160 KB Output is correct
35 Correct 5 ms 5076 KB Output is correct
36 Correct 4 ms 5076 KB Output is correct
37 Correct 10 ms 5196 KB Output is correct
38 Correct 4 ms 5160 KB Output is correct
39 Correct 4 ms 5156 KB Output is correct
40 Correct 4 ms 5204 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5032 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5032 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4996 KB Output is correct
17 Correct 3 ms 5024 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 4 ms 5024 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 5 ms 5204 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 4 ms 5028 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 4 ms 5076 KB Output is correct
28 Correct 4 ms 5076 KB Output is correct
29 Correct 5 ms 5172 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 4 ms 5084 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 4 ms 5160 KB Output is correct
35 Correct 5 ms 5076 KB Output is correct
36 Correct 4 ms 5076 KB Output is correct
37 Correct 10 ms 5196 KB Output is correct
38 Correct 4 ms 5160 KB Output is correct
39 Correct 4 ms 5156 KB Output is correct
40 Correct 4 ms 5204 KB Output is correct
41 Correct 164 ms 20372 KB Output is correct
42 Correct 92 ms 13448 KB Output is correct
43 Correct 92 ms 12824 KB Output is correct
44 Correct 100 ms 12928 KB Output is correct
45 Correct 95 ms 12836 KB Output is correct
46 Correct 255 ms 21316 KB Output is correct
47 Correct 212 ms 20560 KB Output is correct
48 Correct 193 ms 20656 KB Output is correct
49 Correct 213 ms 20788 KB Output is correct
50 Correct 80 ms 13012 KB Output is correct
51 Correct 80 ms 13100 KB Output is correct
52 Correct 80 ms 13012 KB Output is correct
53 Correct 167 ms 21068 KB Output is correct
54 Correct 175 ms 21164 KB Output is correct
55 Correct 173 ms 21072 KB Output is correct
56 Correct 4 ms 5204 KB Output is correct
57 Correct 22 ms 7904 KB Output is correct
58 Correct 106 ms 18380 KB Output is correct
59 Correct 227 ms 26832 KB Output is correct
60 Correct 162 ms 20668 KB Output is correct
61 Correct 168 ms 19932 KB Output is correct