Submission #531216

#	Time	Username	Problem	Language	Result	Execution time	Memory
531216		azberjibiou	Diversity (CEOI21_diversity)	C++17	0 / 100	6 ms	1484 KiB

diversity

#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fir first
#define sec second
#define pdd pair<double, double>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pmax pair<__int128, __int128>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]={0, 1, 0, -1}, dy[4]={1, 0, -1 , 0};
const int mxN=300003;
const int mxM=1010;
const int mxK=105;
const int MOD=1000000007;
const ll INF=1e18;
const ll P1=1000000007;
const ll P2=1000000009;
int N, Q;
int cnt[mxN];
ll ans;
int main()
{
    gibon
    cin >> N >> Q;
    for(int i=1;i<=N;i++)
    {
        int a;
        cin >> a;
        cnt[a]++;
    }
    sort(cnt, cnt+mxN);
    ll ncnt=0;
    for(int i=0;i<mxN;i++)
    {
        if(cnt[i]==0)   continue;
        ans+=(ll)N*(N+1)/2-ncnt*(ncnt+1)/2-(ll)(N-ncnt-cnt[i])*(N-ncnt-cnt[i]+1)/2;
        ncnt+=cnt[i];
    }
    cout << ans;
}

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