제출 #659732

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
659732		fatemetmhr	Diversity (CEOI21_diversity)	C++17	64 / 100	37 ms	4040 KiB

diversity

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define pb     push_back
#define fi     first
#define se     second
#define all(x) x.begin(), x.end()
 
const int maxn5 = 4e5 + 10;
 
int cnt[maxn5];
vector <int> av, tmp[2];
 
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    int n, q; cin >> n >> q;
    for(int i = 0; i < n; i++){
        int a; cin >> a;
        cnt[a]++;
    }
    sort(cnt, cnt + maxn5);
    int num = 0;
    for(int i = 0; i < maxn5; i++) if(cnt[i]){
        tmp[num].pb(cnt[i]);
        num ^= 1;
    }
    for(auto u : tmp[0])
        av.pb(u);
    reverse(all(tmp[1]));
    for(auto u : tmp[1])
        av.pb(u);
    ll ans = 0;
    int a; cin >> a >> a;
    ll ind = 1;
    for(auto u : av){
        //cout << u << endl;
        int v = u;
        ans += ind * (n + 1 - ind);
        ind++; v--;
        while(v--){
            ans += (n + 1 - ind);
            ind++;
        }
    }
    cout << ans << endl;
 
}

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