Submission #1136424

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136424		JahonaliX	September (APIO24_september)	C++20	55 / 100	1093 ms	1104 KiB

september

#include <bits/stdc++.h>

using namespace std;

int solve(int n, int m, vector<int> p, vector<vector<int>> s) {
    vector<set<int>> a(m);
    int k = 0;
    set<int> o;
    vector<int> l(n);
    queue<int> q;
    for (int i : p) if (i > -1) l[i]++;
    for (int i = 0; i < s[0].size(); ++i) {
        set<set<int>> y;
        bool z = true;
        for (int j = 0; j < m; ++j) {
            a[j].insert(s[j][i]);
            y.insert(a[j]);
            if (!o.count(s[j][i]) && s[j][i]) l[p[s[j][i]]]--;
            o.insert(s[j][i]);
            if (l[s[j][i]]) q.push(s[j][i]);
        }
        while (q.size() && !l[q.front()]) q.pop();
        k += q.empty() && y.size() == 1;
    }
    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: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16