oj.uz

Submission #703137

# Submission time Handle Problem Language Result Execution time Memory
703137 2023-02-26T08:22:59 Z browntoad Cat in a tree (BOI17_catinatree) C++14
0 / 100
 8 ms 15196 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5+5;
int n, d;
vector<int> graph[maxn], dp(maxn);
multiset<int> pen[maxn]; // pending
multiset<int> ::iterator it, it2;
void dfs(int x, int dep){
    for (int i=0; i<graph[x].size(); i++){
        dfs(graph[x][i], dep+1);
        dp[x]+=dp[graph[x][i]];
        if (pen[graph[x][i]].size() > pen[x].size()) swap(pen[x], pen[graph[x][i]]);
        for (int j:pen[graph[x][i]]) pen[x].insert(j);
    }
    while(pen[x].size()>=1 && (*prev(pen[x].end()))>=dep+d) {
        dp[x]++;
        pen[x].erase(prev(pen[x].end()));
    }
    while(pen[x].size()>=2){
        it=prev(pen[x].end());
        it2=prev(it);
        if ((*it)-dep+(*it2)-dep < d){
            pen[x].erase(it);
        }
        else break;
    }
    if (pen[x].size()==0) pen[x].insert(dep);
}

int main(){
    cin>>n>>d;
    for (int i=2; i<=n; i++){
        int x; cin>>x;
        graph[x+1].push_back(i);
    }
    dfs(1, 0);
    cout<<dp[1]+pen[1].size()<<endl;
}

Compilation message

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:10:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i=0; i<graph[x].size(); i++){
      |                   ~^~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15192 KB Output is correct
3 Correct 8 ms 15196 KB Output is correct
4 Correct 8 ms 15188 KB Output is correct
5 Correct 8 ms 15088 KB Output is correct
6 Incorrect 8 ms 15184 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15192 KB Output is correct
3 Correct 8 ms 15196 KB Output is correct
4 Correct 8 ms 15188 KB Output is correct
5 Correct 8 ms 15088 KB Output is correct
6 Incorrect 8 ms 15184 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15192 KB Output is correct
3 Correct 8 ms 15196 KB Output is correct
4 Correct 8 ms 15188 KB Output is correct
5 Correct 8 ms 15088 KB Output is correct
6 Incorrect 8 ms 15184 KB Output isn't correct
7 Halted 0 ms 0 KB -