Submission #991960

#	Time	Username	Problem	Language	Result	Execution time	Memory
991960		ttamx	September (APIO24_september)	C++17	100 / 100	216 ms	18036 KiB

september

#include"september.h"
#include<bits/stdc++.h>

using namespace std;

int solve(int n,int m,vector<int> f,vector<vector<int>> s){
	vector<vector<int>> adj(n);
	for(int i=1;i<n;i++)adj[f[i]].emplace_back(i);
	vector<vector<bool>> vis(n,vector<bool>(m));
	vector<bool> added(n);
	vector<int> cnt(n);
	multiset<int> ms;
	function<void(int,int)> dfs=[&](int u,int i){
		if(vis[u][i])return;
		vis[u][i]=true;
		if(!added[u]){
			added[u]=true;
			for(int i=0;i<m;i++)ms.emplace(u);
		}
		for(auto v:adj[u])dfs(v,i);
	};
	int ans=0;
	for(int i=0;i<n-1;i++){
		for(int j=0;j<m;j++)dfs(s[j][i],j);
		for(int j=0;j<m;j++)ms.erase(ms.find(s[j][i]));
		ans+=ms.empty();
	}
	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