Submission #868884

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <set>
#include <iomanip>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <bitset>
#include <list>

#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define sqr(x) ((x)*(x))
#define bitcnt(x) __builtin_popcountll(x)
#define rt return


typedef unsigned long long ull;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;

using namespace std;


const int INF = (int)1e9 + 37;
const ld PI = acos(-1.0);
const int MAXN = (int)100000 + 222;
const ll MOD = (ll)1e6 + 3;
const int MAXQ = (int)1e5 + 222;
const int dx[4] = { 0, 0, 1, -1 };
const int dy[4] = { -1, 1, 0, 0 };

vector <int> g[MAXN];
int a[MAXN];
int ans = 0;
int n, x;

int dfs(int v) {
	int cur = 0;
	for (auto u : g[v]) {
		cur = max(cur, dfs(u) + 1);
	}
	if (cur == x - 1 && a[v] != 0) {
		a[v] = 0;
		cur = -1;
		ans++;
	}
	return cur;
}

int main() {
	//freopen("input.txt", "rt", stdin);
	//freopen("output.txt", "wt", stdout);

	
	cin >> n >> x;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		a[i]--;
		if (i == 0) {
			ans += (a[0] != 0);
			a[0] = 0;
		}
		else {
			g[a[i]].pb(i);
		}
	}
	
	dfs(0);

	cout << ans << endl;
    
	rt 0;
}

Submission Info

Judge Result