Submission #1167071

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167071		rayan_bd	9월 (APIO24_september)	C++20	100 / 100	96 ms	15624 KiB

september

#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5+1000;
vector<int> adj[mxN];
int mx[mxN];
void dfs(int u=0){
	for(auto it:adj[u]){
		dfs(it);
		mx[u]=max(mx[u],mx[it]);
	}
}
int solve(int N,int M,vector<int> F,vector<vector<int>> S){
	for(int i=0;i<=N;++i) adj[i].clear(),mx[i]=0;
	for(int i=1;i<N;++i) adj[F[i]].push_back(i);
	for(int i=0;i<M;++i){
		for(int j=0;j<N-1;++j){	
			mx[S[i][j]]=max(mx[S[i][j]],j);
		}
	}
	dfs();
	int ans=0,curr=0;
	for(int i=0;i<N-1;++i){
		if(i==curr) ++ans;
		curr=max(curr,mx[S[0][i]]+1);
	}
	return ans;
}

• 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