Submission #1173033

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173033		Robert_junior	September (APIO24_september)	C++20	0 / 100	2 ms	5192 KiB

september

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
vector<int>g[N];
int sz[N], pr[N];
void dfs(int v, int p){
    pr[v] = p;
    sz[v] = 1;
    for(auto to : g[v]){
        if(to == p) continue;
        dfs(to, v);
        sz[v] += sz[to];
    }
}
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++){
        g[F[i]].push_back(i);
    }
    dfs(0, 0);
    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(sz[S[i][j]] > 1 || S[i][j] == 0){
                return 1;
            }
            if(cnt[S[i][j]] == M){
                cur++;
                sz[pr[S[i][j]]]--;
            }
        }
        if(cur == j + 1) ans++;
        j++;
    }
    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