Submission #1353851

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

• 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