Submission #881884

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
881884	2023-12-02T07:38:45 Z	TAhmed33	Diversity (CEOI21_diversity)	C++	4 / 100	21 ms	2660 KB

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.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	2 ms	2404 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	2 ms	2392 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	2 ms	2396 KB	Output is correct
3	Correct	3 ms	2396 KB	Output is correct
4	Incorrect	21 ms	2660 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	2 ms	2396 KB	Output is correct
3	Correct	3 ms	2396 KB	Output is correct
4	Incorrect	21 ms	2660 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	2 ms	2396 KB	Output is correct
3	Correct	3 ms	2396 KB	Output is correct
4	Incorrect	21 ms	2660 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #5

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	2 ms	2404 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	2 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	2 ms	2396 KB	Output is correct
13	Correct	3 ms	2396 KB	Output is correct
14	Incorrect	21 ms	2660 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	2 ms	2404 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	2 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	2 ms	2396 KB	Output is correct
13	Correct	3 ms	2396 KB	Output is correct
14	Incorrect	21 ms	2660 KB	Output isn't correct
15	Halted	0 ms	0 KB	-