Submission #1332946

#	Time	Username	Problem	Language	Result	Execution time	Memory
1332946		edo	September (APIO24_september)	C++20	100 / 100	102 ms	10688 KiB

september

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#include "september.h"
const int nax = 1e5;
bool vis[nax + 10];
vector<int> g[nax];
int cnt;

void dfs(int u) {
    if(vis[u]) return;
    vis[u] = 1;
    cnt++;
    for(int v : g[u]) {
        dfs(v);
    }
}

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    for(int i = 0; i < N + 2; i++) {
        vis[i] = 0;
        g[i].clear();
    }
    for(int i = 1; i < N; i++) {
        g[F[i]].push_back(i);
    }
    cnt = 0;
    int ans = 0;
    for(int i = 0; i < N - 1; i++) {
        for(int j = 0; j < M; j++) {
            dfs(S[j][i]);
        }
        if(!--cnt) ans+=1;
    }

    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