제출 #613612

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
613612		yuto1115	Diversity (CEOI21_diversity)	C++17	64 / 100	188 ms	14428 KiB

diversity

#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); ++i)
#define rrep(i, n) for(ll i = ll(n) - 1; i >= 0; --i)
#define rrep2(i, n, t) for(ll i = ll(n) - 1; i >= ll(t); --i)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define SZ(a) int(a.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int n, q;
    cin >> n >> q;
    vi a(n);
    map<int, int> mp;
    for (int &i: a) {
        cin >> i;
        ++mp[i];
    }
    vi ls;
    for (auto[f, s]: mp) ls.pb(s);
    sort(all(ls));
    ls.pop_back();
    vi v(2);
    ll ans = 0;
    for (int i: ls) {
        v[0] += i;
        ans += (ll) v[0] * (n - v[0]);
        swap(v[0], v[1]);
    }
    rep(i, 2) assert(v[i] <= n / 2);
    ans += (ll) n * (n + 1) / 2;
    cout << ans << endl;
}

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