Submission #1026311

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026311		Turkhuu	September (APIO24_september)	C++17	45 / 100	98 ms	3208 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 pos(M, vector<int>(N));
    vector mx(M, vector<int>(N));
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < N - 1; j++) {
            pos[i][S[0][j]] = mx[i][S[0][j]] = j;
        }
    }
    for (int i = 0; i < M; i++) {
        for (int j = N - 1; j; j--) {
            mx[i][P[j]] = max(mx[i][P[j]], pos[i][j]);
        }
    }
    int ans = 0;
    for (int i = 0, j = -1; i < N - 1; i++) {
        for (int k = 0; k < M; k++) {
            j = max(j, mx[k][S[0][i]]);
        }
        if (j == 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