제출 #991848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991848		tamir1	9월 (APIO24_september)	C++17	100 / 100	159 ms	22732 KiB

september

#include<bits/stdc++.h>
#include "september.h"
#include <vector>
using namespace std;
int K,i,j,idx,child[100005],w[100005],mx[100005],x;
vector<int> v[100005],u;
bitset<100005> vis;
void dfs(int x){
	u.push_back(x);
	child[x]=1;
	for(int i:v[x]){
		dfs(i);
		child[x]+=child[i];
	}
}
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S){
	K=0;
	u.clear();
	for(i=0;i<N;i++){
		v[i].clear();
		mx[i]=0;
	}
	vis.reset();
	for(i=1;i<N;i++){
		v[F[i]].push_back(i);
	}
	for(j=0;j<M;j++){
		for(i=0;i<N-1;i++){
			mx[S[j][i]]=max(mx[S[j][i]],i+1);
		}
	}
	dfs(0);
	for(i=0;i<N;i++) w[u[i]]=i;
	idx=1;
	i=0;
	while(idx<N){
		K++;
		for(;i<idx;i++){
			x=S[M-1][i];
			for(j=w[x];j<w[x]+child[x];j++){
				if(vis[u[j]]){
					j+=child[u[j]];
					j--;
					continue;
				}
				vis[u[j]]=1;
				idx=max(idx,mx[u[j]]);
			}
		}
		idx++;
	}
	return K;
}

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