Submission #1283324

#TimeUsernameProblemLanguageResultExecution timeMemory
1283324kawhietDiversity (CEOI21_diversity)C++20
38 / 100
7088 ms2624 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif

constexpr int N = 3e5 + 1;

int cnt[N];

signed 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.rbegin(), a.rend());
    n = a.size();
    deque<int> b;
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            b.push_back(a[i]);
        } else {
            b.push_front(a[i]);
        }
    }
    int res = 0;
    for (int s = 0; s < n; s++) {
        for (int i = 0; i + s < n; i++) {
            int j = i + s;
            if (i == j) {
                res += (b[i] * (b[i] - 1) / 2 + b[i]) * (s + 1);
            } else {
                res += b[i] * b[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...