제출 #1160221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160221		lpostrophe	9월 (APIO24_september)	C++20	100 / 100	149 ms	14548 KiB

september

#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define PB push_back
#define MP make_pair
#define fi first
#define se second



int vertices;
vector<set<int>> adj;
vector<bool> visited;



void dfs(int x){
	if(!visited[x]){
		visited[x]=true;
		vertices+=1;
		for(auto y:adj[x]){
			dfs(y);
		}
	}
}

int solve(int n, int m, vector<int> f, vector<vector<int>>s){
	
	adj.clear();
	visited.resize(n);
	fill(visited.begin(), visited.end(), false);
	adj.resize(n);
	for(int i=1; i<n; i++){
		adj[f[i]].insert(i);

	}
	vertices=0;
	int ans=0;

	for(int i=0; i<n-1; i++){
		for(int j=0; j<m; j++){
			dfs(s[j][i]);
		}
		if(vertices==i+1){
			ans+=1;
		}
		

	}
	return ans;


	
	

}
// int main(){
// 	cout<<solve(3, 1, {-1, 0, 0}, {{1, 2}});
// }

• 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: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 16 / 16