Submission #1186731

#TimeUsernameProblemLanguageResultExecution timeMemory
1186731UnforgettableplDiversity (CEOI21_diversity)C++20
0 / 100
0 ms324 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());
    auto solve = [&](int L,int R){
        int ans = 1;
        for(int i=L;i<R;i++){
            if(arr[i]!=arr[i-1])ans++;
        }
        return ans;
    };
    int ans = 0;
    for(int i=1;i<=N;i++){
        for(int j=i;j<=N;j++){
            ans+=solve(i,j);
        }
    }
    cout << ans << '\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...