oj.uz

Submission #732113

# Submission time Handle Problem Language Result Execution time Memory
732113 2023-04-28T13:05:14 Z Trunkty Cat in a tree (BOI17_catinatree) C++14
0 / 100
 3 ms 5024 KB 
#include <bits/extc++.h>
using namespace std;
typedef long long ll;
#define int ll

int n,d;
vector<int> roads[200005];
int dp[200005],mini[200005];

void dfs(int x){
    vector<int> v;
    for(int i:roads[x]){
        dfs(i);
        dp[x] += dp[i];
        v.push_back(mini[i]);
    }
    if(v.size()==0){
        dp[x]++;
    }
    else{
        sort(v.begin(),v.end());
        while(v.size()>=2){
            int a = v.back();
            v.pop_back();
            if(a+v.back()+2LL<d){
                dp[x]--;
                continue;
            }
            else{
                v.push_back(a);
                break;
            }
        }
        if(v[0]+1LL<d){
            mini[x] = v[0]+1LL;
        }
        else{
            dp[x]++;
        }
    }
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    cin >> n >> d;
    for(int i=1;i<=n-1;i++){
        int a;
        cin >> a;
        roads[a].push_back(i);
    }
    dfs(0);
    cout << dp[0] << "\n";
	return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -