제출 #1277270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277270		tasso7	September (APIO24_september)	C++20	45 / 100	129 ms	12208 KiB

september

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

using namespace std;

vector<bool> caduti;

vector<vector<int>> adj;

int edv = 0;

void DFS(int n){
	//cout<<"D:"<<n << endl;
	if(caduti[n]){return;}
	//cout << "=>" << endl;
	caduti[n] = true;
	edv++;
	for(int k : adj[n]){DFS(k);}
	//cout << "-" << endl;
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	//caso M = 1
	adj = vector<vector<int>>(N, vector<int>{});
	caduti=vector<bool>(N,false);
	for(int i = 1; i < N; i++){
		adj[F[i]].push_back(i);
	}
	
	int i = 0;
	int g = 0;
	while(i < N-1){
		g++;
		DFS(S[0][i]);
		edv--;
		i++;
		while(edv != 0 && i < N-1){
			DFS(S[0][i]);
			edv--;
			i++;
		}
	}
	return g;
}

• 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