Submission #1200142

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200142		hackstar	September (APIO24_september)	C++17	45 / 100	122 ms	7884 KiB

september

#include "september.h"

#include <bits/stdc++.h>

using namespace std;

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector<vector<int>>g(N);
	for(int i=0;i<F.size();i++){
		if(~F[i]){
			g[F[i]].emplace_back(i);
		}
	}
	set<int>st;
	vector<int>vis(N,0);
	auto dfs=[&](auto dfs,int u)->void{
		vis[u]=1;
		for(auto v:g[u]){
			if(vis[v]){
				continue;
			}
			st.insert(v);
			dfs(dfs,v);
		}
	};
	int ans=0;
	for(int i=0;i<N-1;i++){
		int cur=S[0][i];
		if(st.count(cur)){
			st.erase(cur);
		}
		else{
			dfs(dfs,cur);
		}
		ans+=(st.empty());
	}
	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