제출 #1202182

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202182		AI_2512	9월 (APIO24_september)	C++20	0 / 100	0 ms	320 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 = 0; 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: 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