# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089878 | juicy | Diversity (CEOI21_diversity) | C++17 | 7070 ms | 5892 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, q; cin >> n >> q;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
while (q--) {
int l, r; cin >> l >> r;
auto b = vector(a.begin() + l - 1, a.begin() + r);
sort(b.begin(), b.end());
vector<int> cnd;
int m = b.size();
for (int i = 0; i < m; ) {
int j = i;
while (j < m && b[j] == b[i]) {
++j;
}
cnd.push_back(j - i);
i = j;
}
sort(cnd.begin(), cnd.end());
int i = 0, j = m;
long long res = (long long) m * (m + 1) / 2;
for (int k = 0; k < cnd.size(); ++k) {
if (k & 1) {
j -= cnd[k];
res += (long long) j * (m - j);
} else {
res += (long long) i * (m - i);
i += cnd[k];
}
}
cout << res << "\n";
}
return 0;
}
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... |