Submission #1160069

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160069		kiwimsy	September (APIO24_september)	C++20	0 / 100	1 ms	320 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);
	int k = 0, ans = N;
	for(int i = 1; i < N; i++) ch[F[i]].push_back(i);
	for(vector<int> i : S){
		k = 0;
		vis.assign(N, false);
		passed.assign(N, false);
		for(int j : i){
			passed[j] = true;
			if(q.empty()) k++;
			if(!vis[j]) dfs(j);
			if(passed[q.front()]){
				while(passed[q.front()]) q.pop();
			}
		}
		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