제출 #684994

#제출 시각아이디문제언어결과실행 시간메모리
684994moonheroDiversity (CEOI21_diversity)C++17
0 / 100
7049 ms212 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 = 1; i <= n; i++) cin >> a[i];
    int 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();
        }
    } while (next_permutation(a.begin(), a.end())) {
        int 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...