제출 #1177868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177868		trashaccount	9월 (APIO24_september)	C++20	55 / 100	1095 ms	11056 KiB

september

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

const int NM = 1e5;

int N, M;
vector <int> son[NM+5];
int timer, tin[NM+5], tout[NM+5];
int sum[NM+5], res[NM+5];

void dfs(int u){
	tin[u] = ++timer;
	for (int v : son[u]) dfs(v);
	tout[u] = timer;
}

bool is_ancestor(int u, int v){
	return tin[u] <= tin[v] && tout[u] >= tout[v];
}

int solve(int _N, int _M, vector <int> F, vector <vector <int> > S){
	N = _N, M = _M;
	for (int i = 0; i < N; i++) son[i].clear();
	for (int i = 1; i < N; i++){
		int p = F[i];
		son[p].push_back(i);
	}
	timer = 0;
	dfs(0);

	for (int i = 0; i < M; i++){
		for (int j = 0; j < N; j++) sum[j] = 0;
		for (int j = 0; j < N-1; j++)
			for (int k = j+1; k < N-1; k++)
				if (is_ancestor(S[i][j], S[i][k]) || (i > 0 && res[S[i][j]] >= res[S[i][k]])) sum[j]++, sum[k]--;

		res[S[i][0]] = 1;
		for (int j = 0; j+1 < N-1; j++){
			if (j > 0) sum[j] += sum[j-1];
			if (sum[j] > 0) res[S[i][j+1]] = res[S[i][j]];
			else res[S[i][j+1]] = res[S[i][j]]+1;
		}
	}
	int mx = 0;
	for (int i = 1; i < N; i++) mx = max(mx, res[i]);
	return mx;
}

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