Submission #1273356

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

september

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

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