Submission #1178861

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178861		Muhammet	September (APIO24_september)	C++20	59 / 100	117 ms	19208 KiB

september

#include "bits/stdc++.h"
#include "september.h"
// #include "stub.cpp"

using namespace std;

const int N = 1e5 + 5;

int ind[10][N], a[10][N], m;

vector <vector <int>> v;

void dfs(int x) {
	for(auto i : v[x]) {
		dfs(i);
	}
	for(int i = 0; i < m; i++) {
		a[i][x] = ind[i][x];
	}
	for(auto i : v[x]) {
		for(int j = 0; j < m; j++) {
			a[j][x] = max(a[j][x], a[j][i]);
		}
	}
	return;
}

int solve(int n, int M, vector<int> f, vector<vector<int>> s) {
	m = M;
	for(int i = 0; i < m; i++) {
		for(int j = 0; j < n - 1; j++) {
			ind[i][s[i][j]] = j;
		}
	}

	v.clear();
	v.resize(n);
	for(int i = 1; i < n; i++) {
		v[f[i]].push_back(i);
	}

	dfs(0);

	int x = 0, ans = 0;
	for(int i = 0; i < n - 1; i++) {
		for(int j = 0; j < m; j++) {
			x = max(x, a[j][s[j][i]]);
		}
		if(x == i) ans++;
	}

	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 5 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 0 / 16