Submission #1203645

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203645		fadyscube	September (APIO24_september)	C++20	0 / 100	0 ms	324 KiB

september

#include "september.h"

#include <vector>
#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>> prefMax(M, vector<int>(N, 0));
    for (int i = 0; i < M; i++) {
        prefMax[i][0] = S[i][0];
        for (int j = 1; j < N-1; j++) {
            prefMax[i][j] = max(prefMax[i][j-1], S[i][j]);
        }
    }

    int k = 0;

    for (int i = 0; i < N-1; i++) {
        int currMax = prefMax[0][i];
        for (int j = 1; j < M; j++) {
            if (prefMax[j][i] != currMax) {
                goto here;
            }
        }
        if (currMax == i+1) k++;

        here:;
    }

    return k;
}

• 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