Submission #1202193

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202193		AI_2512	September (APIO24_september)	C++20	100 / 100	82 ms	6304 KiB

september

#include <bits/stdc++.h>
#define ff first 
#define ss second
using namespace std;

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	int k = 0;
	vector<int> mp(N, 0);
	vector<int> st;
	vector<int> chs(N, 0), cnt(N, 0);
	for (int i = 1; i< N;i++) chs[F[i]]++;
	int l = 0;
	for (int i = 0; i< N-1;i++){
		l++;
		for (int j = 0; j< M;j++){
			mp[S[j][i]]++;
			if (mp[S[j][i]] == M && cnt[S[j][i]] == chs[S[j][i]]){
				st.push_back(S[j][i]);
				int cur = F[S[j][i]];
				cnt[cur]++;
				while (cnt[cur] == chs[cur] && mp[cur] == M){
					st.push_back(cur);
					cur = F[cur];
					cnt[cur]++;
				}
			}
		}
		if (st.size() == l){
			l = 0;
			k++;
			st.clear();
		}
	}
	return k;
}

• 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