Submission #1189792

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189792		Tsagana	September (APIO24_september)	C++20	100 / 100	67 ms	5320 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<int> mx(N);
    
    for (int i = 0; i < M; i++)
    for (int j = 0; j < N-1; j++)
        mx[S[i][j]] = max(mx[S[i][j]], j);
    
    for (int i = N-1; i >= 1; i--) mx[F[i]] = max(mx[F[i]], mx[i]);
    
    int cc = -1, k = 0;
    for (int i = 0; i < N-1; i++) {
        if (i > cc) k++;
        for (int j = 0; j < M; j++) cc = max(cc, mx[S[j][i]]);
    }
    
    return k;
}

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