Submission #708152

#TimeUsernameProblemLanguageResultExecution timeMemory
708152vjudge1Diversity (CEOI21_diversity)C++11
4 / 100
8 ms852 KiB
#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; vector<int> A(n); map<int, int> M; // 离散化 for (int &a : A) cin >> a, M[a] = 0; vector<LL> cnt(M.size()); int id = 0; for (auto &p : M) p.second = id++; 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 += c * (c + 1) / 2 + c * (n - c); sort(cnt.begin(), cnt.end()); LL G[2] = {0}, gi = 0; for (int c : cnt) ans += G[gi] * (n - c - G[gi]), G[gi] += c, gi ^= 1; cout << ans << '\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...