Submission #1151199

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151199		TroySer	September (APIO24_september)	C++20	100 / 100	390 ms	42036 KiB

september

#include <bits/stdc++.h>
#include "september.h"

using namespace std;

int solve(int N, int M, vector<int> F, vector<vector<int> > S) {

	vector<vector<int> > adjList;
	adjList.resize(N);

	for (int i = 1; i < N; i++) {
		adjList[F[i]].push_back(i);
	}

	unordered_set<int> beenBanished;

	vector<unordered_map<int, int> > actualIndices(M);
	for(int i = 0; i < M; i++) {
		for (int j = 0; j < N - 1; j++) {
			actualIndices[i][S[i][j]] = j;
		}
	}

	unordered_map<int, int> actualIndex;
	for (int i = 1; i < N; i++) {
		actualIndex[i] = 0;
		for (int j = 0; j < M; j++) {
			actualIndex[i] = max(actualIndices[j][i], actualIndex[i]);
		}
	}

	int banishmentIndex = 0;
	int maxK = 1;

	for (int i = 0; i < N - 1; i++) {

		if (banishmentIndex < i) {
			maxK++;
		}

		queue<int> bfsQueue;
		for (int j = 0; j < M; j++) {
			bfsQueue.push(S[j][i]);
		}

		while (!bfsQueue.empty()) {

			int currentIndex = bfsQueue.front();
			bfsQueue.pop();

			if (beenBanished.find(currentIndex) != beenBanished.end()) {
				continue;
			}
			beenBanished.insert(currentIndex);
			banishmentIndex = max(banishmentIndex, actualIndex[currentIndex]);

			for (int v: adjList[currentIndex]) {
				bfsQueue.push(v);
			}

		}

	}

	return maxK;

}

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