# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556573 | eecs | Izbori (COCI22_izbori) | C++17 | 2945 ms | 14424 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;
const int maxn = 200010;
int n, a[maxn], sum[maxn], c[maxn * 2];
long long ans;
map<int, vector<int>> mp;
void add(int p) {
for (p += maxn; p < maxn * 2; p += p & -p) c[p]++;
}
int query(int p) {
int s = 0;
for (p += maxn; p; p -= p & -p) s += c[p];
return s;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]), mp[a[i]].push_back(i);
}
auto calc = [&](int x, int y, int lim) {
int t = min(x, max(0, y - lim));
return (2LL * lim + t + 1) * t / 2 + 1LL * (x - t) * y;
};
for (auto &p : mp) {
auto &pos = p.second;
if (pos.size() <= 400) {
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... |