Submission #1346422

#	Time	Username	Problem	Language	Result	Execution time	Memory
1346422		phamngocphuc2008	9월 (APIO24_september)	C++20	0 / 100	1 ms	344 KiB

september

#include "september.h"

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

vector<bool> vis;
vector<vector<int>> adj;
int cnt;
void dfs(int v)
{
	if(!vis[v]) ++cnt;
	vis[v] = true;
	for(auto u : adj[v])
	{
		if(!vis[v]) dfs(u);
	}
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	adj.clear();
	adj.resize(N);
	vis.clear();
	vis.assign(N, false);
	for(int i = 1; i < N; ++i)
	{
		adj[F[i]].emplace_back(i);
	}
	cnt = 0;
	int ans = 0;
	for(int i = 0; i < N - 1; ++i)
	{
		for(int j = 0; j < M; ++j) dfs(S[j][i]);
		--cnt;
		if(cnt == 0) ++ans;
	}
	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