Submission #1168640

#TimeUsernameProblemLanguageResultExecution timeMemory
1168640rayan_bdSequence (APIO23_sequence)C++20
0 / 100
472 ms35644 KiB
#include <bits/stdc++.h>
using namespace std;

const double INF = 5e18;
const int mxN = 5e5+100;

#define fi first
#define se second
#define all(v) v.begin(), v.end()



int sequence(int N,vector<int> A){
	map<int,pair<int,int>> mp;
	for(int i=0;i<N;++i){
		if(!mp.count(A[i])) mp[A[i]].fi=i;
		mp[A[i]].se=i;
	}
	int ans=1;
	for(auto it:A){
		if((mp[it].se-mp[it].fi+1)<=4) ans=2;
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...