例题9-12(uva-12186)

#include <iostream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int MAXSIZE = 1e5 + 7;
vector<int> d[MAXSIZE];
int n, t;

int dp(int index) {
	if (d[index].empty()) return 1;

	int len = d[index].size();

	vector<int> temp;
	for (int i = 0; i < len; ++i)
		temp.push_back(dp(d[index][i]));
	sort(temp.begin(), temp.end());
	int c = (len * t - 1) / 100 + 1;
	int ans = 0;
	for (int i = 0; i < c; ++i) ans += temp[i];
	return ans;
}
int main()
{
	int id;
	while (cin >> n >> t && n && t) {

		for (int i = 1; i <= n; ++i) {
			cin >> id;
			d[id].push_back(i);
		}
		cout << dp(0) << endl;
		for (int i = 0; i <= n; ++i) d[i].clear();
	}
	return 0;
}