Submission #1226702

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226702		SpyrosAliv	September (APIO24_september)	C++20	45 / 100	85 ms	2848 KiB

september

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

int n, m;
vector<int> par;

int solve(int N, int M, vector<int> F, vector<std::vector<int>> S) {
	n = N;
	m = M;
	assert(m == 1);
	par = F;
	vector<int> cnt(n, 0);
	vector<bool> inside(n, false);
	for (int i = 1; i < n; i++) cnt[par[i]]++;
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	int tot = 0;
	for (auto x: S[0]) {
		pq.push({cnt[x], x});
		inside[x] = true;
		while (!pq.empty()) {
			if (cnt[pq.top().second] != pq.top().first) {
				pq.pop();
				continue;
			}
			int curr = pq.top().second;
			if (cnt[curr] == 0) {
				pq.pop();
				cnt[par[curr]]--;
				if (inside[par[curr]]) pq.push({cnt[par[curr]], par[curr]});
				continue;
			}
			break;
		}
		if (pq.empty()) tot++;
	}
	return tot;
}	

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16