Submission #1283319

#TimeUsernameProblemLanguageResultExecution timeMemory
1283319kawhietDiversity (CEOI21_diversity)C++20
0 / 100
2 ms712 KiB
#include <bits/stdc++.h>
using namespace std;

constexpr int N = 3e5 + 1;

int cnt[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        cnt[x]++;
    }
    while (q--) {
        int l, r;
        cin >> l >> r;
    }
    vector<int> a;
    for (int i = 1; i < N; i++) {
        if (cnt[i] > 0) {
            a.push_back(cnt[i]);
        }
    }
    sort(a.begin(), a.end());
    n = a.size();
    int64_t res = 0;
    for (int s = 0; s < n; s++) {
        for (int i = 0; i + s < n; i++) {
            int j = i + s;
            if (s == 0) {
                res += 1LL * a[i] * (a[i] - 1) / 2 + a[i];
            } else {
                res += 1LL * a[i] * a[j] * (s + 1);
            }
        }
    }
    cout << res << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...