Submission #826721

#	Time	Username	Problem	Language	Result	Execution time	Memory
826721		NK_	Diversity (CEOI21_diversity)	C++17	0 / 100	1 ms	212 KiB

diversity

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using vi = V<int>;
using ll = long long;
using pl = pair<ll, ll>;
using vl = V<ll>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
 	
	int N, Q; cin >> N >> Q;
	vi A(N); for(auto& x : A) cin >> x;

	map<int, int> F; for(auto x : A) F[x]++;
	vi C; for(auto& x : F) C.pb(x.s);

	int l, r; cin >> l >> r;
	assert(l == 1 && r == N);

	ll ans = (N * 1LL * (N + 1)) / 2LL; 
 	
	int M = sz(C); sort(begin(C), end(C));

	vi best;
	for(int i = 0; i < M; i += 2) best.pb(C[i]);
	for(int i = 1; i < M; i += 2) best.pb(C[i]);

	int L = 0, R = N;
	for(int i = 0; i < M; i++) {
		ans += L * 1LL * R;
		L += best[i]; R -= best[i];
	}

	cout << ans << nl;
	exit(0-0);
}				

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