# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685047 | moonhero | Diversity (CEOI21_diversity) | C++14 | 7026 ms | 38924 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
ans[a[i]]++;
}
while (q--) {
ll l, r; cin >> l >> r;
for (auto it : ans) res.push_back(it.second);
ll h = 0, g = 0;
sort(res.begin(), res.end());
vector <int> rs(res.size());
bool ok = 0;
int lt = 0, rt = rs.size() - 1;
for (auto it : res) {
if (ok) rs[rt] = it, rt--, ok = 0;
else rs[lt] = it, lt++, ok = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |