Submission #1186740

#TimeUsernameProblemLanguageResultExecution timeMemory
1186740UnforgettableplDiversity (CEOI21_diversity)C++20
4 / 100
7092 ms436 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int modulo = 1e9+7;


int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,Q;
    cin >> N >> Q;
    vector<int> arr(N);
    for(int&i:arr)cin>>i;
    sort(arr.begin(),arr.end());
    {
        int c=0;
        map<int,int> comp;
        for(int&i:arr){
            if(!comp.count(i))comp[i]=c++;
            i=comp[i];
        }
    }
    auto test = [&](){
        int ans = 0;
        vector<int> last(N);
        for(int i=1;i<=N;i++){
            ans+=(i-last[arr[i-1]])*(N-i+1);
            last[arr[i-1]]=i;
        }
        return ans;
    };
    int minima = 1e17;
    do{
        minima=min(minima,test());
    } while(next_permutation(arr.begin(),arr.end()));
    cout << minima << '\n';
}
#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...