제출 #1160095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160095		kiwimsy	9월 (APIO24_september)	C++20	0 / 100	1 ms	580 KiB

september

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

vector<vector<int>> ch;
vector<bool> vis, passed;
queue<int> q;

void dfs(int node){
	vis[node] = true;
	for(int i : ch[node]){
		if(!vis[i]) dfs(i);
	}
	q.push(node);
}

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	ch.resize(N+5);
	int k, ans = N;
	for(int i = 1; i < N; ++i){
		ch[F[i]].push_back(i);
	}
	for(int i = 0; i < M; ++i){
		k = 0;
		vis.assign(N+5, false);
		passed.assign(N+5, false);
		while(!q.empty()) q.pop();
		for(int j = 0; j < N-1; ++j){
			passed[S[i][j]] = true;
			if(!vis[S[i][j]]) dfs(S[i][j]);
			while(!q.empty() && passed[q.front()]) q.pop();
			if(q.empty()) k++;
		}
		ans = min(ans, k);
	}
	return ans;
}

• 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