Submission #1312235

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312235		azamurai	September (APIO24_september)	C++20	0 / 100	1 ms	568 KiB

september

#include "september.h"

#include <vector>

using namespace std;

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector <int> colour(N, 0);
	vector <vector<int>> g(N);
	for (int i = 0; i < N; i++) {
		if (F[i] != -1) {
			g[F[i]].push_back(i);
		}
	}
	for (int i = 0; i < N - 1; i++) {
		int v = S[0][i];
		int ok = 1;
		for (auto to : g[v]) {
			if (!colour[to]) ok = 0;
		}
		if (ok) {
			colour[v] = 1;
		}
		else {
			return i;
		}
	}
	return N - 1;
}

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