Submission #524932

#TimeUsernameProblemLanguageResultExecution timeMemory
524932ZielDiversity (CEOI21_diversity)C++17
0 / 100
7062 ms292 KiB
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
#define sz(x) (int)x.size()
 
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
 
	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;
		bool f = false;
		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 && cur >= ans) {
					f = true;
					break;
				}
			}
			if (f)
				break;
		}
		if (ans == -1)
			ans = cur;
		ans = min(ans, cur);
	} while (next_permutation(a.begin() + 1, a.end()));
	cout << ans;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...