제출 #1147800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147800		yeyso	9월 (APIO24_september)	C++20	45 / 100	452 ms	12568 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
void dfs(int u, int v, vector<vector<int>> &adj, set<int> &disconnected, set<int> &cleared){
	if(!cleared.count(u)){
		disconnected.insert(u);
		for(int i = 0; i < adj[u].size(); i ++){
			dfs(adj[u][i], u, adj, disconnected, cleared);
		}
	}
}
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
	vector<vector<int>> adj(N, vector<int>());
	for(int i = 1; i < F.size(); i ++){
		//cout << F[i] << " ";
		adj[F[i]].push_back(i);
	}
	for(int i = 0; i < adj.size(); i ++){
		for(int j = 0; j < adj[i].size(); j ++){
			//cout << adj[i][j] << " ";
		} //cout << "\n";
	}
	vector<int> record = S[0];
	set<int> disconnected;
	set<int> cleared;
	int days = 0;
	for(int i = 0; i < record.size(); i ++){
		dfs(record[i], 0, adj, disconnected, cleared);
		disconnected.erase(record[i]);
		cleared.insert(record[i]);
		//cout << disconnected.size() << " ";
		if(disconnected.size() == 0){
			days ++;
		}
	}
	return days;
}
/*
g++ -std=gnu++17 -O2 -o september stub.cpp september.cpp

1
5 1
0 0 2 2
4 2 1 3
*/

• 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