Submission #1226634

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226634		dizzy_groovy	September (APIO24_september)	C++20	100 / 100	122 ms	15520 KiB

september

#include "september.h"

#include <bits/stdc++.h>

using namespace std;

void dfs(int i, vector<vector<int>> &gr, vector<int> &mx) {
	for (auto &j : gr[i]) {
		dfs(j, gr, mx);
		mx[i] = max(mx[i], mx[j]);
	}
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector<int> mx(N);
	for (int i = 0; i < M; i++) {
		for (int j = 0; j < N - 1; j++) {
			mx[S[i][j]] = max(mx[S[i][j]], j);
		}
	}
	vector<vector<int>> gr(N);
	for (int i = 1; i < N; i++) {
		gr[F[i]].push_back(i);
	}
	dfs(0, gr, mx);
	int cnt = 0;
	int r = 1;
	int cr = 0;
	while (r < N) {
		while (cr < r) {
			for (int i = 0; i < M; i++) {
				r = max(r, mx[S[i][cr]] + 1);
			}
			cr++;
		}
		r++;
		cnt++;
	}
	return cnt;
}

• 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