# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
684981 | 2023-01-23T03:45:18 Z | moonhero | Diversity (CEOI21_diversity) | C++17 | 1 ms | 212 KB |
#include<bits/stdc++.h> using namespace std; using ll = long long; const long long N = 3e5 + 5; long long a[N]; vector <long long> res; long long cont (long long r) { return (r + 1) * (r) / 2; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, q; cin >> n >> q; map <ll, ll> ans, s; for (ll i = 1; i <= n; i++) { cin >> a[i]; s[a[i]] = -1; } ll p = 1; for (auto &it : s) { it.second = p++; } for (int i = 1; i <= n; i++) { a[i] = s[a[i]]; ans[a[i]]++; } while (q--) { ll l, r; cin >> l >> r; for (auto it : ans) res.push_back(it.second); sort(res.begin(), res.end()); // for (auto it : res) cout << it << ' '; reverse(res.begin(), res.end()); ll h = LLONG_MAX; ll x = 0; for (int i = 0; i < res.size(); i++) { ll k = 2, nwres = res[i]; for (int j = i + 1; j < res.size(); j++) { nwres += k * res[j], k++; } x += nwres * res[i] - cont(res[i] - 1); } h = min(h, x); cout << h << '\n'; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |