Submission #684998

#TimeUsernameProblemLanguageResultExecution timeMemory
684998moonheroDiversity (CEOI21_diversity)C++14
0 / 100
7050 ms280288 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; const long long N = 3e5 + 5; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; vector <int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int l, r; cin >> l >> r; ll ans = 0; for (int i = 0; i < n; i++) { set<int> s; for (int j = i; j < n; j++) { s.insert(a[j]); ans += s.size(); } } map <vector <int>, int> used; used[a] = 1; while (next_permutation(a.begin(), a.end())) { if (used[a]) continue; used[a] = 1; ll res = 0; for (int i = 0; i < n; i++) { set<int> s; for (int j = i; j < n; j++) { s.insert(a[j]); res += s.size(); } } ans = min(ans, res); } cout << ans << '\n'; 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...