Submission #1173050

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173050		Robert_junior	September (APIO24_september)	C++20	100 / 100	87 ms	14016 KiB

september

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
vector<int>g[N];
int sz[N], pr[N];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S){
    vector<int>cnt(N);
    for(int i = 0; i < N; i++){
        g[i].clear();
        sz[i] = cnt[i] = pr[i] = 0;
    }
    for(int i = 1; i < N; i++){
        pr[i] = F[i];
        g[F[i]].push_back(i);
    }
    for(int i = 0; i < N; i++){
        sz[i] = g[i].size();
    }
    int cur = 0;
    int ans = 0;
    int j = 0;
    while(j < N - 1){
        for(int i = 0; i < M; i++){
            cnt[S[i][j]]++;
            if(cnt[S[i][j]] == M){
                int v = S[i][j];
                while(v != 0 && cnt[v] == M && sz[v] == 0){
                    sz[pr[v]]--;
                    v = pr[v];
                    cur++;
                }
            }
        }
        if(cur == j + 1) ans++;
        j++;
    }
    return ans;
}

• 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: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 16 / 16