Submission #1121435

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121435		ezzzay	September (APIO24_september)	C++17	100 / 100	133 ms	38720 KiB

september

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int MN=1e6+5;
vector<int>v[MN];
bool vis[MN];
int par[MN];
int pos[5][MN];
int mx=-1;
void dfs(int a, int j){
	vis[a]=1;
	mx=max(mx,pos[j][a]);
	for(auto b:v[a]){
		if(vis[b]==1)continue;
		dfs(b,j);
	}
}
 
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
    mx=0;
	for(int i=0;i<N;i++){
		v[i].clear();
		vis[i]=0;
	}
	for(int i=1;i<N;i++){
		par[i]=F[i];
		v[F[i]].pb(i);
	}
	int k=0;
	for(int i=0;i<N-1;i++){
	    for(int j=0;j<M;j++){
	        pos[j][S[0][i]]=i;
	    }
	    
	}
	
	int i=0;
	while(i<N-1){
	    while(i<=mx){
	        for(int j=0;j<M;j++){
	            int a=S[j][i];
        	    if(vis[a]==0){
        	        dfs(a,j);
        	    }
	        }
	        
    	    i++;
	    }
	    mx++;
	    k++;
	}
	
	
	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