Submission #998973

#	Time	Username	Problem	Language	Result	Execution time	Memory
998973		THXuan	September (APIO24_september)	C++17	100 / 100	104 ms	27592 KiB

september

#include <bits/stdc++.h>
#include "september.h"
#define INF 1e9
using namespace std;
typedef long long ll;
 
vector<int>adj[800005];
bool visited[800005];
int v = 0;
 
void dfs(int s){
    if(visited[s]) return;
    visited[s] = true;
    ++v;
    for(auto u : adj[s]){
        dfs(u);
    }
}
 
int solve(int N, int M, vector<int> F, vector<vector<int>>S) {
    for(int i = 0;i<N;i++){
        adj[i].clear();
        visited[i] = false;
    }
    for(int i =1; i < N;i++){
        adj[F[i]].push_back(i);
    }
    int ans = 0;
    for(int i =0;i<N-1;i++){
        for(int j =0;j<M;j++)dfs(S[j][i]);
        ans += !--v;
    }
    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