제출 #1160176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160176		pensive	9월 (APIO24_september)	C++20	55 / 100	1048 ms	11792 KiB

september

#include "september.h"
#include <unordered_set>
#include <vector>


using namespace std;
#define REP(a,i,n) for (int i=a;i<n;i++)


void loadChildren(int N, vector<int> F, vector<vector<int>> &childs) {
	REP(1,i,N) {
		childs[F[i]].push_back(i);
	}
}

void including(int parent, vector<vector<int>> &childs, int visited[], unordered_set<int> &leafed) {
	visited[parent]=1;
	leafed.insert(parent);
	for (auto leaf : childs[parent]) {
		if (!visited[leaf]) {
			including(leaf, childs, visited, leafed);
		}
	}
}

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	unordered_set<int> leafed;
	vector<vector<int>> childs(200001);
	int freq[200001], visited[200001];
	int K=0;
	fill(freq, freq+200001, 0); fill(visited, visited+200001, 0);
	loadChildren(N, F, childs);

	REP(0,i,N-1) {
		REP(0, log, M) {
			int leaf = S[log][i];
			freq[leaf]++;
			if (!visited[leaf]) {
				including(leaf, childs, visited, leafed);
			}
			if (freq[leaf]>=M) {
				leafed.erase(leaf);
			}
		}
		if (leafed.size()==0) {
			K++;
		}
	}
	return K;
}

• 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