Submission #1021853

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021853		adrielcp	September (APIO24_september)	C++17	45 / 100	145 ms	15416 KiB

september

#include "september.h"

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

int solve(int n, int m, vector<int> p, vector<vector<int>> b) {
	vector<vector<int>> adj(n, vector<int>());
	for (int i = 1; i < n; i++) adj[p[i]].push_back(i);

	int ans = n-1;
	for (auto vec : b) {
		set<int> pending;
		vector<int> vis(n);
		int day = 0;
		for (int i = 0; i < n-1; i++) {
			pending.erase(vec[i]);
			vis[vec[i]] = 1;
			for (auto children : adj[vec[i]]) {
				if (!vis[children]) pending.insert(children);
			}
			day += pending.size() == 0;
		}
		ans = min(ans, day);
	}
	return ans;
}

• 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