제출 #1203905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203905		speedcode	September (APIO24_september)	C++20	0 / 100	1 ms	324 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>> graph(N);
	for (int i = 1; i < N; i++)
	{
		graph[F[i]].push_back(i);
	}

	int boundary = 0;

	vector<map<int, int>> cache(M);
	for (int i = 0; i < N; i++)
	{
		for (int v = 0; v < M; v++)
		{
			cache[v][S[v][i]] = i;
		}
	}

	int res = 0;

	for (int i = 0; i < N-1; i++)
	{
		boundary = max(boundary, i);
		for (int v = 0; v < M; v++)
		{
			for (int w = 0; w < M; w++)
			{
				boundary = max(boundary, cache[v][S[v][i]]);
			}

			for (auto c : graph[S[v][i]])
			{
				for (int w = 0; w < M; w++)
				{
					boundary = max(boundary, cache[w][c]);
				}
			}
		}

		if (boundary == i)
			{
				res++;
			}
	}


	return res;
}

• 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