Submission #1333831

#	Time	Username	Problem	Language	Result	Execution time	Memory
1333831		ThylOne	September (APIO24_september)	C++20	0 / 100	1 ms	580 KiB

september

#include "september.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;

const int maxN = 1e5;

vector<int> links[maxN];
vector<bool> rem(maxN);


void getSub(int node, unordered_set<int> &sub){
	if(rem[node])return;
	rem[node] = true;
	sub.insert(node);
	for(int u:links[node])
		getSub(u, sub);
}
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	for(int i =  1 ;  i < N ; i++){
		links[F[i]].push_back(i);
	}
	fill(rem.begin(), rem.end(), false);
	unordered_set<int> SET;
	int act = 0;
	int ans = 0;
	while(act < N -1){
		ans++;
		do{
			getSub(S[0][act], SET);
			SET.erase(S[0][act]);
			act++;
		}while(!SET.empty());
	}
	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