Submission #1326941

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326941		husseinjuanda	September (APIO24_september)	C++20	100 / 100	97 ms	6584 KiB

september

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

int co = 0;
vector<int> par;
vector<bool> vis;
vector<int> b;

void dfs(int k){
	if(b[k] == 0 && k != 0 && vis[k]){
		b[par[k]]--;
		co++;
		dfs(par[k]);
	} 
}

int solve(int n, int m, std::vector<int> f, std::vector<std::vector<int>> s){
	par = f;
	vis.clear();
	b.clear();
	vector<bool> d(n, false);
	vector<int> freq(n, 0);
	int l = 0;
	for(int i = 0; i < n-1; i++){
		for(int y = 0; y < m; y++){
			freq[s[y][i]]++;
			if(freq[s[y][i]] == m){
				l++;
			}
		}
		if(l == i+1){
			d[i] = true;
		}
	}
	co = 0;
	vis.resize(n, false);
	b.resize(n, 0);
	int ns = 0;
	for(int y = 1; y < n; y++){
		b[f[y]]++;
	}
	for(int i = 0; i < n-1; i++){
		int k = s[0][i];
		vis[k] = true;
		dfs(k);
		if(co == i+1){
			if(d[i]){
				ns++;
			}
		}
	}
	return ns;
}

• 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