Submission #1361003

#	Time	Username	Problem	Language	Result	Execution time	Memory
1361003		MuhammadSaram	September (APIO24_september)	C++20	16 / 100	62 ms	15660 KiB

september

#include "september.h"
#include <bits/stdc++.h>

using namespace std;

const int M = 1e5 + 1;

vector<int> nei[M];
int mx[M];

void dfs(int u)
{
	while (nei[u].size())
	{
		int x=nei[u].back();nei[u].pop_back();
		dfs(x), mx[u]=max(mx[u],mx[x]);
	}
}

int solve(int n, int m, vector<int> p, vector<vector<int>> s)
{
	mx[0]=0;
	for (int i=1;i<n;i++)
		nei[p[i]].push_back(i), mx[i]=0;
	for (int i=0;i<m;i++)
		for (int j=0;j<n;j++)
			mx[s[i][j]]=max(mx[s[i][j]],j);
	dfs(0);
	int id=0, ans=0;
	for (int i=0;i<n-1;i++)
	{
		for (int j=0;j<m;j++)
			id=max(id,mx[s[j][i]]);
		if (id==i)
			ans++;
	}
	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 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