제출 #708063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708063		vjudge1	Diversity (CEOI21_diversity)	C++11	64 / 100	379 ms	16260 KiB

diversity

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  int n, q;
  cin >> n >> q;
  using VI = vector<int>;
  VI A(n), cnt;
  map<int, int> M;
  for (int &a : A) cin >> a, M[a] = 0;

  int id = 0, k = M.size();
  for (auto &p : M) p.second = id++;
  cnt.resize(k);
  for (int &a : A) a = M[a], ++cnt[a];

  int L, R;
  cin >> L >> R;
  assert(q == 1 && L == 1 && R == n);

  ll ans = 0;
  for (int c : cnt) ans += (ll)c * (c + 1) / 2 + (ll)c * (n - c);
  sort(cnt.begin(), cnt.end());

  ll l = 0, r = 0, where = 1;
  for (int c : cnt) {
    if (where)
      ans += l * (n - c - l), l += c;
    else
      ans += r * (n - c - r), r += c;
    where ^= 1;
  }
  cout << ans << '\n';
  return 0;
}

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