Submission #1026310

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026310		Turkhuu	September (APIO24_september)	C++17	45 / 100	86 ms	9800 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int solve(int N, int M, vector<int> P, vector<vector<int>> S) {
	vector<int> pos(N), mx(N);
	for (int i = 0; i < N - 1; i++) {
		pos[S[0][i]] = mx[S[0][i]] = i;
	}
	for (int i = N - 1; i; i--) {
		mx[P[i]] = max(mx[P[i]], pos[i]);
	}
	int ans = 0;
	for (int i = 0, j = -1; i < N - 1; i++) {
		if ((j = max(j, mx[S[0][i]])) == i) ans++, j = -1;
	}
	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16