Submission #1194741

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194741		Mousa_Aboubaker	September (APIO24_september)	C++20	0 / 100	0 ms	776 KiB

september

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

int solve(int N, int M, vector<int> F, vector<vector<int>> S)
{
	vector<vector<int>> adj(N, vector<int>());
	for(int i = 1; i < N; i++)
		adj[F[i]].push_back(i);
	vector<bool> vis(N, false);
	vector<vector<int>> pos(M, vector<int>(N));
	for(int i = 0; i < M; i++)
		for(int j = 0; j < N - 1; j++)
			pos[i][S[i][j]] = j;
	int K = 0;
	int mx = 0;
	auto dfs = [&](auto self, int u) -> void
	{
		if(vis[u])
			return;
		for(int i = 0; i < M; i++)
			if(mx < pos[i][u])
				mx = pos[i][u];
		vis[u] = true;
		for(auto i: adj[u])
			self(self, i);
	};
	for(int i = 0; i < N - 1;)
	{
		dfs(dfs, S[0][i]);
		while(i < mx)
		{
			dfs(dfs, S[0][i]);
			i++;
		}
		K++;
		mx++;
	}
	return K - 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