#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
ll n,q; cin >> n >> q;
vector<ll> a(n);
rep(i,n) cin >> a[i];
{
ll l,r; cin >> l >> r;
}
vector<ll> b;
rep(i,n) b.pb(a[i]);
sort(all(b));
b.resize(unique(all(b))-b.begin());
rep(i,n) a[i] = lower_bound(all(b),a[i])-b.begin();
ll m = sz(b);
vector<ll> cnt(m);
rep(i,n) cnt[a[i]]++;
ll dp[m][m];
memset(dp,0x3f,sizeof dp);
vector<pll> order;
rep(i,m) order.pb({cnt[i],i});
sort(all(order));
auto f = [&](ll i, ll c){
ll cost = 0;
cost += i*(n-i+1);
if(c > 1){
ll mx = n-i;
ll mn = n-i-c+2;
cost += mx*(mx+1)/2-mn*(mn-1)/2;
}
return cost;
};
vector<ll> order2;
rep(i,n){
if(!(i&1)){
order2.pb(order[i].ff);
}
}
rev(i,n-1,0){
if(i&1){
order2.pb(order[i].ff);
}
}
ll ans = 0;
ll i = 1;
trav(c,order2){
ans += f(i,c);
i += c;
}
cout << ans << endl;
// vector<ll> order(m);
// rep(i,m) order[i] = i;
// ll ans = inf2;
// do{
// ll i = 1;
// ll cost = 0;
// trav(x,order){
// ll c = cnt[x];
// ll add = 0;
// add = 2*i*(n-i+1)+(n-i)*(n+1-i)-(n+1-i-c)*(n+2-i-c);
// cost += add;
// // cost += i*(n-i+1);
// // if(c > 1){
// // ll mx = n-i;
// // ll mn = n-i-c+2;
// // assert(mn <= mx);
// // cost += mx*(mx+1)/2-mn*(mn-1)/2;
// // }
// i += c;
// }
// cost /= 2;
// amin(ans,cost);
// if(cost == 171){
// debug(order);
// }
// } while(next_permutation(all(order)));
// cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
