Submission #1362554

#	Time	Username	Problem	Language	Result	Execution time	Memory
1362554		opeleklanos	September (APIO24_september)	C++20	45 / 100	78 ms	7884 KiB

september

#include <iostream>
#include <vector>
#include <set>
using namespace std;

#include "september.h"

vector<vector<int>> adj;
set<int> needToFind;
vector<int> vis;

void dfs(int st){
    vis[st] = 1;
    for(auto i : adj[st]){
        if(vis[i]) continue;
        needToFind.insert(i);
        dfs(i);
    }
}

int solve(int N, int M, vector<int> F, vector<vector<int>> S){
    needToFind.clear();
    adj.assign(N, {});
    for(int i = 1; i<N; i++) adj[F[i]].push_back(i);
    vis.assign(N, 0);

    int ans = 0;
    for(int i = 0; i<N-1; i++){
        needToFind.erase(S[0][i]);
        dfs(S[0][i]);
        if(needToFind.size() == 0) ans++;
    }

    return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16