Submission #1193392

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193392		yuichiro17	9월 (APIO24_september)	C++20	55 / 100	1095 ms	3288 KiB

september

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

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector<vector<int>> s(1);
	vector<set<int>> vs(M);
	vector<int> rs(N);
	rs[0]=N;
	for(int i=0;i<N-1;i++){
		s[s.size()-1].push_back(S[0][i]);
		rs[S[0][i]] = s.size()-1;
		bool flag=true;
		for(int j=0;j<M;j++){
			vs[j].insert(S[j][i]);
			if(vs[j]!=vs[0]){
				flag=false;
			}
		}
		if(flag){
			s.push_back({});
		}
	}
	s.pop_back();
	int ans=0;
	vector<bool> visited(N,false);
	visited[0]=true;
	int mi=s.size()-1;
	for(int i=s.size()-1;i>=0;i--){
		if(mi>i){
			mi=i;
		}
		for(int j:s[i]){
			mi = min(mi,rs[F[j]]);
		}
		if(mi==i){
			ans++;
		}
	}
	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: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16