제출 #524927

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
524927		Ziel	Diversity (CEOI21_diversity)	C++17	0 / 100	7048 ms	296 KiB

diversity

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define sz(x) (int)x.size()

signed main() {
	int n, q;
	cin >> n >> q;
	vector<int> a(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a.begin() + 1, a.end());
	int _, __;
	cin >> _ >> __;
	ll ans = -1;
	do {
		ll cur = 0;
		for (int l = 1; l <= n; l++) {
			set<int> s;
			for (int r = l; r <= n; r++) {
				s.insert(a[r]);
				cur += sz(s);
			}
		}
		if (ans == -1)
			ans = cur;
		ans = min(ans, cur);
	} while (next_permutation(a.begin() + 1, a.end()));
	cout << ans;
	return 0;
}

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