Submission #1262362

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262362		PlayVoltz	September (APIO24_september)	C++20	100 / 100	107 ms	10944 KiB

september

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

#define pb push_back

int c=0;
vector<int> vect;
vector<vector<int> > graph;

void dfs(int node){
	if (vect[node])return;
	++c;
	++vect[node];
	for (auto num:graph[node])if (!vect[num])dfs(num);
}

int solve(int n, int m, vector<int> f, vector<vector<int> > s) {
	c=0;
	vect.clear();
	graph.clear();
	int ans=0;
	vect.resize(n, 0);
	graph.resize(n);
	for (int i=1; i<(int)f.size(); ++i)graph[f[i]].pb(i);
	for (int i=0; i<n-1; ans+=!c, ++i)for (int j=0; j<m; ++j){
		dfs(s[j][i]);
		if (vect[s[j][i]]==m)--c;
		++vect[s[j][i]];
	}
	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