Submission #1353861

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353861		JungPS	September (APIO24_september)	C++20	45 / 100	84 ms	2468 KiB

september

#include "september.h"

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

int degree[100007];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	for(int i=0;i<N;++i) degree[i]=0;
	for(int i=1;i<N;++i) ++degree[F[i]];
	multiset<pair<int,int>,greater<pair<int,int>>> st[M];
	int cnt=0;
	for(int r=0;r<N-1;++r){
		for(int c=0;c<M;++c){
			if(st[c].count({degree[F[S[c][r]]],F[S[c][r]]})){
				st[c].erase({degree[F[S[c][r]]],F[S[c][r]]});
				st[c].insert({degree[F[S[c][r]]]-1,F[S[c][r]]});
			}
			--degree[F[S[c][r]]];
			st[c].insert({degree[S[c][r]],S[c][r]});
		}
		bool ok=true;
		for(int c=0;c<M;++c){
			if((*st[c].begin()).first!=0){
				ok=false;
			}
		}
		if(ok){
			for(int c=0;c<M;++c) st[c].clear();
			++cnt;
		}
	}

	return cnt;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16