Submission #1048148

#TimeUsernameProblemLanguageResultExecution timeMemory
104814812345678Diversity (CEOI21_diversity)C++17
22 / 100
931 ms71768 KiB
#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]; }
#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...