제출 #881884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
881884		TAhmed33	Diversity (CEOI21_diversity)	C++98	4 / 100	21 ms	2660 KiB

diversity

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 3e5 + 25;
int n, a[MAXN], q;
int freq[MAXN];
int main () {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) cin >> a[i];
	sort(a + 1, a + n + 1);
	for (auto i : a) freq[i]++;
	vector <int> x;
	for (int i = 1; i < MAXN; i++) {
		if (freq[i]) {
			x.push_back(freq[i]);
		}
	}
	sort(x.begin(), x.end());
	ll mn = 1e18;
	do {
		ll r = 0, sum = 0;
		for (auto i : x) {
			sum += r * (r + 1) / 2 + (n - i - r) * (n - i - r + 1) / 2;
			r += i;
		}
		sum = n * (n + 1) / 2 * ((int)x.size()) - sum;
		if (sum < mn) {
		//	for (auto i : x) cout << i << " ";
		//	cout << '\n';
			mn = sum;
		}
	} while (next_permutation(x.begin(), x.end()));
	cout << mn << '\n';
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 10
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36