Submission #1186737

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186737		Unforgettablepl	Diversity (CEOI21_diversity)	C++20	0 / 100	7094 ms	436 KiB

diversity

#pragma GCC optimize("Ofast","unroll-loops")
#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());
    auto test = [&](){
        map<int,int> last;
        int ans = 0;
        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';
}

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