Submission #1084835

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084835		Timosh	September (APIO24_september)	C++17	0 / 100	1 ms	344 KiB

september

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

int solve(int N, int M, vector<int> F, vector<vector<int>> S)
{
    vector<int> freq(N);
    int ans = 0;
    for (int i = 1; i < N; i++)
        freq[F[i]]++;
    map<int, int> mp;
    int cnt = 0;
    set<int> need;
    for (int i = 0; i < N - 1; i++)
    {
        for (int j = 0; j < M; j++)
        {
            mp[S[j][i]]++;
            if (mp[S[j][i]] == 1)
                cnt++;
            if (mp[S[j][i]] == M)
                cnt--;
        }
        if (cnt == 0)
        {
            for (auto &[key, val] : mp)
            {
                freq[F[key]]--;
                if (freq[F[key]] == 0)
                    need.erase(F[key]);
                if (freq[key] != 0)
                    need.insert(F[key]);
            }
            ans += need.size() == 0;
            mp.clear();
        }
    }
    return ans;
}

• 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