제출 #848396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848396		BidoTeima	Cat in a tree (BOI17_catinatree)	C++17	0 / 100	0 ms	348 KiB

catinatree

#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const int N = 1e3 + 3;
vector<int>adj[N];
bool marked[N];
int sub[N],D;
int lol=0,sz;
int dfs_subtree(int node, int prev, int mxD){
    sub[node] = 1;
    for(int child : adj[node]){
        if(child != prev && !marked[child]){
            sub[node] += dfs_subtree(child, node,mxD+1);
        }
    }
    return sub[node];
}
int find_centroid(int node, int prev){
    for(int child : adj[node]){
        if(child != prev && !marked[child] && 2 * sub[child] > sz){
            return find_centroid(child, node);
        }
    }
    return node;
}
int main()
{ 
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);   
    int n;
    cin>>n>>D;
    for(int i = 1; i < n; i++){
        int x;
        cin>>x;
        adj[x].push_back(i);
        adj[i].push_back(x);
    } 
    cout<<int(ceil(log(n)/log(D)));
    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 40
• Subtask 3: 0 / 49