Submission #1167333

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167333		thinknoexit	Diversity (CEOI21_diversity)	C++20	0 / 100	0 ms	328 KiB

diversity

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 300300;
int a[N], qs[N];
int cnt[N];
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        cnt[a[i]]++;
    }
    sort(a + 1, a + 1 + n, [&](int a, int b) {
        if (cnt[a] != cnt[b]) return cnt[a] > cnt[b];
        return a < b;
        });
    // Subtask : l = 1, r = n, Q = 1
    while (q--) {
        int __;
        cin >> __ >> __;
    }
    ll ans = 0;
    for (int i = 1;i <= n;i++) {
        qs[i] = qs[i - 1] + (a[i] != a[i - 1]);
        ans += 1ll * qs[i] * (n - i + 1);
    }
    cout << ans << '\n';
    return 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