Submission #983313

#	Time	Username	Problem	Language	Result	Execution time	Memory
983313		c2zi6	Sequence (APIO23_sequence)	C++17	11 / 100	2102 ms	12136 KiB

sequence

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "sequence.h"

namespace TEST1 {
	int n;
	VI a;
	int val(VI a) {
		int n = a.size();
		sort(all(a));
		int m1 = a[(n-1)/2];
		int m2 = a[n/2];
		int c1 = 0, c2 = 0;
		for (int x : a) {
			c1 += (x == m1);
			c2 += (x == m2);
		}
		return max(c1, c2);
	}

	int solve(VI A) {a = A, n = a.size();
		int ans = 0;
		replr(l, 0, n-1) replr(r, l, n-1) {
			VI b;
			replr(i, l, r) b.pb(a[i]);
			setmax(ans, val(b));
		}
		return ans;
	}
};

int sequence(int n, VI a) {
	return TEST1::solve(a);
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18