제출 #1186734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186734		Unforgettablepl	Diversity (CEOI21_diversity)	C++20	0 / 100	7093 ms	436 KiB

diversity

#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 = [&](){
        auto solve = [&](int L,int R){
            set<int> s(arr.begin()+L-1,arr.begin()+R);
            return s.size();
        };
        int ans = 0;
        for(int i=1;i<=N;i++){
            for(int j=i;j<=N;j++){
                ans+=solve(i,j);
            }
        }
        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