oj.uz

Submission #789635

# Submission time Handle Problem Language Result Execution time Memory
789635 2023-07-21T15:29:37 Z math_rabbit_1028 Diversity (CEOI21_diversity) C++14
0 / 100
 18 ms 12100 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, q, b;
int arr[303030];
ll cnt[303030], cnt2[303030], reord[303030], ans = 0, res[50505];

const int m = 300000;

struct query{
    int idx, lt, rt;
} Q[50505];

bool compare(query p, query q) {
    if (p.lt/b == q.lt/b) return p.rt < q.rt;
    return (p.lt/b) < (q.lt/b);
}

ll sum[m + 1], xsum[m + 1];

void update(int i, ll x) {
    while (i <= m) {
        sum[i] += x;
        xsum[i] += (ll)i * x;
        i += (i & -i);
    }
}

ll getsum(int i) {
    ll ans = 0;
    while (i > 0) {
        ans += sum[i];
        i -= (i & -i);
    }
    return ans;
}

ll getxsum(int i) {
    ll ans = 0;
    while (i > 0) {
        ans += xsum[i];
        i -= (i & -i);
    }
    return ans;
}

void init(int p) {
    for (int i = 1; i <= m; i++) cnt[i] = 0;
    ans = 0;

    for (int i = Q[p].lt; i <= Q[p].rt; i++) cnt[arr[i]]++;
    for (int i = 1; i <= m; i++) cnt2[i] = cnt[i];

    sort(cnt2 + 1, cnt2 + m + 1);

    for (int i = 1; i <= m/2; i++) {
        reord[i] = cnt2[2 * i - 1];
    }
    for (int i = 1; i <= m/2; i++) {
        reord[m - i + 1] = cnt2[2 * i];
    }
    for (int i = 1; i <= m; i++) update(i, reord[i]);

    for (ll i = 1; i <= m; i++) ans += reord[i] * (reord[i] + 1) / 2;

    for (ll i = 1; i <= m; i++) {
        ans += reord[i] * ((i + 1) * getsum(i - 1) - getxsum(i - 1));
    }
}

void add(int j) {
    int idx, i;
    idx = upper_bound(cnt2 + 1, cnt2 + m + 1, cnt[arr[j]]) - cnt2 - 1;
    assert(cnt2[idx] == cnt[arr[j]]);
    cnt[arr[j]]++;
    cnt2[idx]++;
    if (idx % 2 == 0) i = m - idx/2 + 1;
    else i = (idx + 1) / 2;
    reord[i]++;
    ans += reord[i];
    ans += (i + 1) * getsum(i - 1) - getxsum(i - 1);
    ans += (getxsum(m) - getxsum(i)) - (i - 1) * (getsum(m) - getsum(i));
    update(i, 1);
}

void rem(int j) {
    int idx, i;
    idx = lower_bound(cnt2 + 1, cnt2 + m + 1, cnt[arr[j]]) - cnt2;
    assert(cnt2[idx] == cnt[arr[j]]);
    cnt[arr[j]]--;
    cnt2[idx]--;
    if (idx % 2 == 0) i = m - idx/2 + 1;
    else i = (idx + 1) / 2;
    reord[i]--;
    ans -= reord[i] + 1;
    ans -= (i + 1) * getsum(i - 1) - getxsum(i - 1);
    ans -= (getxsum(m) - getxsum(i)) - (i - 1) * (getsum(m) - getsum(i));
    update(i, -1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> q; b = (int)sqrt(n);
    for (int i = 1; i <= n; i++) cin >> arr[i];

    for (int i = 1; i <= q; i++) cin >> Q[i].lt >> Q[i].rt;
    for (int i = 1; i <= q; i++) Q[i].idx = i;

    sort(Q + 1, Q + q + 1, compare);

    int p = 1;
    for (int i = 0; i <= n/b; i++) {
        if (Q[p].lt/b != i) continue;

        init(p);
        res[Q[p].idx] = ans;

        p++;
        while (p <= q && Q[p].lt/b == i) {
            for (int j = Q[p - 1].rt + 1; j <= Q[p].rt; j++) add(j);
            if (Q[p - 1].lt > Q[p].lt) for (int j = Q[p].lt; j < Q[p - 1].lt; j++) add(j);
            else for (int j = Q[p - 1].lt; j < Q[p].lt; j++) rem(j);
            res[Q[p].idx] = ans;
            p++;
        }
    }

    for (int i = 1; i <= q; i++) cout << res[i] << "\n";

    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 11988 KB Output is correct
2 Correct 16 ms 12088 KB Output is correct
3 Correct 16 ms 12040 KB Output is correct
4 Incorrect 16 ms 12100 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 11980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 11980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 11980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 11988 KB Output is correct
2 Correct 16 ms 12088 KB Output is correct
3 Correct 16 ms 12040 KB Output is correct
4 Incorrect 16 ms 12100 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 11988 KB Output is correct
2 Correct 16 ms 12088 KB Output is correct
3 Correct 16 ms 12040 KB Output is correct
4 Incorrect 16 ms 12100 KB Output isn't correct
5 Halted 0 ms 0 KB -