Submission #1312239

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312239		azamurai	September (APIO24_september)	C++20	0 / 100	1 ms	572 KiB

september

#include "september.h"

#include <vector>

using namespace std;

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector <int> dp(N + 1, 0);
	vector <int> pos(N, 0);
	for (int i = 0; i < N - 1; i++) {
		pos[S[0][i]] = i;
	}
	for (int i = 1; i < N; i++) {
		if (F[i] == 0) continue;
		if (pos[F[i]] < pos[i]) {
			dp[pos[F[i]]]++;
			dp[pos[i] + 1]--;
		}
	}
	for (int i = 1; i < N; i++) {
		dp[i] += dp[i - 1];
	}
	int ans = 1;
	for (int i = 1; i < N - 1; i++) {
		if (dp[i] == 0) ans++;
		else if (!dp[i - 1]) ans++;
	}
	return ans;
}

• 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