Submission #992001

#	Time	Username	Problem	Language	Result	Execution time	Memory
992001		ttamx	September (APIO24_september)	C++17	0 / 100	1 ms	3164 KiB

september

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

using namespace std;

const int N=1e5+5;

int cnt;
vector<int> adj[N];
bool vis[N][5],add[N];

void dfs(int u,int i){
	if(vis[u][i])return;
	vis[u][i]=true;
	if(!add[u])add[u]=true,cnt++;
	for(auto v:adj[u])dfs(v,i);
}

int solve(int n,int m,vector<int> f,vector<vector<int>> s){
	for(int i=1;i<n;i++)adj[f[i]].emplace_back(i);
	int ans=0;
	for(int i=0;i<n-1;i++){
		for(int j=0;j<m;j++)dfs(s[j][i],j);
		ans+=--cnt==0;
	}
	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