Submission #1078282

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078282		Maite_Morale	September (APIO24_september)	C++17	100 / 100	474 ms	18112 KiB

september

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vll vector<ll>
#define MAX 500005
#define oo 10000000000
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vll a(N-1,0),mn(N,oo),mx(N,0);
	for(int i=0;i<N-1;i++)a[i]=i;
	for(int i=0;i<M;i++){
		map<ll,ll> mp;
		for(int j=0;j<N-1;j++){
			mp[S[i][j]]=j;
			mn[S[i][j]]=min(mn[S[i][j]],(ll)j);
			mx[S[i][j]]=max(mx[S[i][j]],(ll)j);
		}
		for(int j=0;j<N-1;j++){
			if(F[S[i][j]]!=0)a[mp[F[S[i][j]]]]=max(a[mp[F[S[i][j]]]],(ll)j);
		}
	}
	for(int j=1;j<N;j++){
		a[mn[j]]=max(a[mn[j]],mx[j]);
	}
	ll K=0,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: 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