Submission #1273357

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273357		kawhiet	September (APIO24_september)	C++20	0 / 100	1 ms	568 KiB

september

#include <bits/stdc++.h>
#include "september.h"
using namespace std;

int solve(int n, int m, vector<int> p, vector<vector<int>> s) {
    vector<multiset<int>> freq(m);
    int res = 0;
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < m; j++) {
            freq[j].insert(s[j][i]);
        }
        bool is = 1;
        for (int j = 1; j < m; j++) {
            if (freq[j] != freq[j - 1]) {
                is = 0;
                break;
            }
        }
        if (is) {
            res++;
            for (int j = 0; j < m; j++) {
                freq[j].clear();
            }
        }
    }
    return res;
}

• 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