제출 #1048148

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1048148		12345678	Diversity (CEOI21_diversity)	C++17	22 / 100	931 ms	71768 KiB

diversity

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e5+5, kx=1e7+5;

ll n, a[nx], v[nx], q, l, r, c, d, t, res, dp[kx];
map<ll, ll> mp;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>q;
    for (int i=1; i<=n; i++) cin>>a[i], mp[a[i]]++;
    cin>>c>>d;
    for (auto [x, y]:mp) res+=y*(n-y)+y*(y+1)/2, v[t]=y, t++;
    for (int msk=1; msk<(1<<t); msk++) 
    {
        ll sm=0;
        dp[msk]=LLONG_MAX;
        for (int j=0; j<t; j++) if (msk&(1<<j)) sm+=v[j];
        for (int j=0; j<t; j++) if (msk&(1<<j)) dp[msk]=min(dp[msk], dp[msk^(1<<j)]+(sm-v[j])*(n-sm));
    }
    cout<<res+dp[(1<<t)-1];
}

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