Submission #1244513

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244513		faruk	September (APIO24_september)	C++20	100 / 100	89 ms	9792 KiB

september

#include "september.h"

#include <bits/stdc++.h>

using namespace std;

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector<vector<int> > pref_sizes(M, vector<int>(N - 1));
	vector<vector<int> > wher_is(M, vector<int>(N));
	for (int i = 0; i < M; i++) {
		for (int j = 0; j < N - 1; j++)
			wher_is[i][S[i][j]] = j;
	}
	
	vector<bool> is_same(N);
	for (int i = 0; i < N - 1; i++) {
		int max_val = i;
		for (int j = 0; j < M; j++) {
			pref_sizes[j][i] = wher_is[j][S[0][i]];
			if (i > 0)
				pref_sizes[j][i] = max(pref_sizes[j][i], pref_sizes[j][i - 1]);
			max_val = max(max_val, pref_sizes[j][i]);
		}
		if (max_val == i)
			is_same[i] = true;
	}

	vector<int> indeg(N, 0);
	vector<bool> tbd(N);
	for (int i = 1; i < N; i++)
		indeg[F[i]]++;
	
	int tbd_cnt = 0; int out = 0;
	for (int i = 0; i < N - 1; i++) {
		int me = S[0][i];
		tbd[me] = true;
		tbd_cnt++;
		while (indeg[me] == 0 and tbd[me]) {
			tbd[me] = false;
			tbd_cnt--;

			me = F[me];
			indeg[me]--;
		}

		if (tbd_cnt == 0 and is_same[i])
			out++;
	}
	

	return out;
}

• 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