제출 #734563

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

catinatree

#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<(int)n;i++)
#define Fo(i, k, n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define sp(x, y) fixed<<setprecision(y)<<x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define trr(it, x) for(auto it = x.rbegin(); it != x.rend(); it+)
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vvl adj(200001);
int seen[200001];
vl order;

void dfs(int u, int last, int d){
    if(d<=0) return;
    if(seen[u]) return;
    seen[u] = 1;
    for(auto v : adj[u]){
        if(v == last) continue;
        dfs(v, u, d-1);
    }
}

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit); // remove if to endof file

    ll n, k, to;
    cin >> n >> k;
    fo(i, n-1){
        cin >> to;
        adj[i+1].pb(to);
        adj[to].pb(i+1);
    }
    queue<ll> q;
    q.push(0);
    memset(seen, 0, sizeof(seen));
    ll last = 0;
    while(!q.empty()){
        ll pos = q.front();
        q.pop();
        if(seen[pos]) continue;
        last = pos;
        seen[pos]= 1;
        for(auto v : adj[pos]) q.push(v);
    }
    q.push(last);
    memset(seen, 0, sizeof(seen));
    while(!q.empty()){
        ll pos = q.front();
        q.pop();
        if(seen[pos]) continue;
        seen[pos]= 1;
        order.pb(pos);
        for(auto v : adj[pos]) q.push(v);
    }
    ll ans = 0;
    memset(seen, 0, sizeof(seen));
    while(order.size()){
        ll pos = order[order.size()-1];
        order.pop_back();
        if(seen[pos]) continue;
        dfs(pos, pos, k);
        ans++;
    }
    cout << ans;

    return 0;
}

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