Submission #1181428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181428		Mighilon	Diversity (CEOI21_diversity)	C++20	64 / 100	119 ms	16704 KiB

diversity

#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
 
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first 
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
 
const char nl = '\n';
const int INF = 1e9;
const ll MOD = 998244353;
const int mxN = 1e7+1;

void solve(){
    int n,q;
    cin>>n>>q;
    vi a(n);
    F0R(i,n)
        cin>>a[i];
    map<int,int> mp;
    F0R(i,n)
        mp[a[i]]++;
    vi b(n);
    vpi tmp;
    for(auto it=mp.rbegin(); it!=mp.rend(); ++it){
        tmp.pb(*it);
    }
    sort(all(tmp),[&](pi& a,pi&b){return a.s<b.s;});
    int l=0,r=n-1;
    trav(i,tmp){
        if(l+1<=n-r){
            F0R(j,i.s)
                b[l++]=i.f;
        }
        else{
            F0R(j,i.s)
                b[r--]=i.f;
        }
    }
    ll ans=0;
    int p=0;
    F0R(i,n){
        if(i+1<n&&b[i+1]==b[i]){
            continue;
        }
        ans+=1LL*n*(n+1)/2-1LL*p*(p+1)/2-1LL*(n-1-i)*(n-i)/2;
        p=i+1;
    }
    cout<<ans<<nl;
}
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int TC = 1;
    // cin >> TC;
    while(TC--){
        solve();
    }
    return 0;
}

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