Submission #983919

# Submission time Handle Problem Language Result Execution time Memory
983919 2024-05-16T07:59:46 Z Vvnx Sequence (APIO23_sequence) C++17
11 / 100
2000 ms 4768 KB
#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define pb push_back
#define fi first
#define se second

const ll N = 5e5+3;

vector<int> v,aa;
ll m,tmp,ans,bb,tmp1;

int sequence(int n, vector<int> a) {
	for(int i=0; i<n; i++) {
		for(int j=0; j<n; j++) {
			v.clear();
			for(int k=i; k<=j; k++) {
				v.pb(a[k]);
			}
			sort(v.begin(),v.end());
			tmp = 0;
			if((j-i+1) % 2 == 1) {
				for(int k=i; k<=j; k++) {
					if(a[k] == v[v.size()/2]) {
						tmp++;
					}
				}
			}
			else {
				tmp1 = 0;
				for(int k=i; k<=j; k++) {
					if(a[k] == v[v.size()/2]) {
						tmp++;
					}
					else if(a[k] == v[v.size()/2-1]) {
						tmp1++;
					}
				}
				tmp = max(tmp,tmp1);
			}
			ans = max(ans,tmp);
		}
	}
	return ans;
}

//int main() {
//	cin >> m;
//	for(int i=1; i<=m; i++) {
//		cin >> bb;
//		aa.pb(bb);
//	}
//	cout << sequence(m,aa) << endl;
//}

/*
7
1 2 3 1 2 1 3
out : 3

9
1 1 2 3 4 3 2 1 1
out : 2

14
2 6 2 5 3 4 2 1 4 3 5 6 3 2
out : 3
*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Execution timed out 2059 ms 452 KB Time limit exceeded
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2057 ms 4768 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2045 ms 4692 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2032 ms 4352 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Execution timed out 2059 ms 452 KB Time limit exceeded
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Execution timed out 2059 ms 452 KB Time limit exceeded
14 Halted 0 ms 0 KB -