Submission #1078215

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078215		Maite_Morale	September (APIO24_september)	C++17	0 / 100	6 ms	12124 KiB

september

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vll vector<ll>
#define pll pair<ll,ll>
#define F first
#define S second
#define MAX 500005

vll v[MAX];
ll a[MAX];
ll mn[MAX],mx[MAX];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	for(int i=0;i<N;i++){
		v[i]={};a[i]=i;
	}
	for(int i=0;i<N-1;i++){
		v[F[i]].push_back(i);
	}
	for(int j=0;j<M;j++){
		map<ll,ll> mp;
		for(int i=0;i<N-1;i++){
			mp[S[j][i]]=i;
			mn[S[j][i]]=min(mn[S[j][i]],(ll)i);
			mx[S[j][i]]=max(mx[S[j][i]],(ll)i);
		}
		for(int i=0;i<N-1;i++){
			for(auto u : v[S[j][i]]){
				a[i]=max(a[i],mp[u]);
			}
		}
	}
	for(int i=1;i<N-1;i++){
		a[mn[i]]=max(mx[i],a[mn[i]]);
	}
	ll K=0;ll limit=0;
	for(int i=0;i<N-1;i++){
		//cout<<a[i]<<
		limit=max(limit,a[i]);
		if(limit==i)K++;
	}
return K;
}

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