Submission #997476

#	Time	Username	Problem	Language	Result	Execution time	Memory
997476		ALTAKEXE	September (APIO24_september)	C++17	0 / 100	2 ms	3164 KiB

september

#include <bits/stdc++.h>
#include <vector>
using namespace std;
vector<vector<int>> adj(100005);
vector<bool> vis(100005, 0);
vector<int> p(100005, 0);
int c = -1;
void dfs(int u)
{
	if (vis[u])
		return;
	vis[u] = true;
	c = max(c, p[u]);
	for (auto i : adj[u])
		dfs(i);
}
int solve(int n, int m, vector<int> f, vector<vector<int>> s)
{
	for (int i = 1; i < n; i++)
		adj[f[i]].push_back(i);
	for (int j = 0; j < m; j++)
	{
		for (int i = 0; i < n - 1; i++)
			p[s[j][i]] = max(p[s[j][i]], i);
	}
	int ans = 0;
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (i > c && j == 0)
				ans++;
			dfs(s[j][i]);
		}
	}
	c = -1;
	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