Submission #1160430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160430		mentalmath231	September (APIO24_september)	C++20	100 / 100	627 ms	12972 KiB

september

#include <bits/stdc++.h>
using namespace std; 
typedef long long ll;
int cnt = 0;
vector<int> visited(100002,0);
vector<vector<int>> kid(100002,vector<int>());
void dfs(int x){
	if (!visited[x]){
		cnt +=1;
		visited[x] = 1;
		for (auto i: kid[x]){
			dfs(i);
		}
	}
}
int solve(int n, int m, vector<int> f,  vector<vector<int>> s) {
	int ans = 0;
	cnt = 0;
	visited = vector<int>(100002,0);
	kid = vector<vector<int>>(100002,vector<int>());
	for (int i =1; i<n; i++){
		kid[f[i]].push_back(i);
	}
	for (int i =0; i<n-1; i++){
		for (int j= 0; j<m; j++){
			dfs(s[j][i]);
		}
		if (cnt == i+1){
			ans +=1;
		}
	}
	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