Submission #1353854

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353854		JungPS	September (APIO24_september)	C++20	45 / 100	81 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;
	int cnt=0;
	for(auto i:S[0]){
		if(st.count({degree[F[i]],F[i]})){
			st.erase({degree[F[i]],F[i]});
			st.insert({degree[F[i]]-1,F[i]});
		}
		--degree[F[i]];
		st.insert({degree[i],i});

		if((*st.begin()).first==0){
			st.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