oj.uz

Submission #798585

# Submission time Handle Problem Language Result Execution time Memory
798585 2023-07-30T21:05:14 Z Johann Diversity (CEOI21_diversity) C++14
22 / 100
 73 ms 9724 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const ll INF = 1e18;
int N, Q;
vi A, AA;
ll ans;
vi P;
vi answerPermutation;

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

    cin >> N >> Q;
    AA.resize(N);
    for (int i = 0; i < N; ++i)
        cin >> AA[i];

    while (Q--)
    {
        {
            int l, r;
            cin >> l >> r;
            --l;
            A = vi(AA.begin() + l, AA.begin() + r);
        }
        ll n = sz(A);

        vi heatMap(*max_element(all(A)) + 1, 0);
        for (int i = 0; i < sz(A); ++i)
            ++heatMap[A[i]];
        map<ll, ll> cnts;
        for (int i = 0; i < sz(heatMap); ++i)
            if (heatMap[i])
                ++cnts[heatMap[i]];

        ll pref = 0;
        ll num = sz(cnts);

        vi dp[2];
        for (int foo = 0; foo < 2; ++foo)
            dp[foo].reserve(N + 1), dp[foo].resize(N + 1);
        fill(all(dp[0]), INF);
        dp[0][0] = n * (n + 1) * (n + 1) / 2 - (2 * n + 1) * (n + 1) * n / 6;

        auto it = cnts.begin();
        for (int j = 0; j < num; ++j)
        {
            int ii = j & 1;
            int ni = ii ^ 1;
            fill(all(dp[ni]), INF);

            ll x = it->first;  // how much
            ll y = it->second; // how often

            ll subsure = 0;
            // either with left or right endpoint in set
            subsure += (n - x) * x * (x - 1) / 2;
            // if both are in set
            subsure += x * x * (x - 1) / 2 - (2 * x - 1) * x * (x - 1) / 6;
            // for every such set
            subsure *= y;

            for (ll left = 0; left < sz(dp[ii]); ++left)
            {
                ll tmp = dp[ii][left];
                if (tmp == INF)
                    continue;
                tmp -= subsure;

                vi L(y + 1, 0), R(y + 1, 0);
                ll l = left, r = pref - left;

                for (ll i = 1; i <= y; ++i)
                {
                    L[i] = L[i - 1] + (x - 1) * l * (n - l - x);
                    R[i] = R[i - 1] + (x - 1) * r * (n - r - x);
                    l += x, r -= x;
                }
                for (ll i = 0; i <= y; ++i)
                    dp[ni][left + x * i] = min(dp[ni][left + x * i], tmp - L[i] - R[y - i]);
            }
            ++it;
            pref += x * y;
        }
        ans = *min_element(all(dp[num & 1]));
        cout << ans << "\n";
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 14 ms 6504 KB Output is correct
6 Correct 25 ms 9716 KB Output is correct
7 Correct 24 ms 9684 KB Output is correct
8 Correct 23 ms 9724 KB Output is correct
9 Correct 22 ms 9716 KB Output is correct
10 Correct 22 ms 9716 KB Output is correct
11 Correct 23 ms 9724 KB Output is correct
12 Correct 24 ms 9684 KB Output is correct
13 Correct 22 ms 9684 KB Output is correct
14 Correct 34 ms 9656 KB Output is correct
15 Correct 23 ms 9712 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 14 ms 6504 KB Output is correct
6 Correct 25 ms 9716 KB Output is correct
7 Correct 24 ms 9684 KB Output is correct
8 Correct 23 ms 9724 KB Output is correct
9 Correct 22 ms 9716 KB Output is correct
10 Correct 22 ms 9716 KB Output is correct
11 Correct 23 ms 9724 KB Output is correct
12 Correct 24 ms 9684 KB Output is correct
13 Correct 22 ms 9684 KB Output is correct
14 Correct 34 ms 9656 KB Output is correct
15 Correct 23 ms 9712 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 628 KB Output is correct
19 Correct 20 ms 3420 KB Output is correct
20 Correct 45 ms 6508 KB Output is correct
21 Correct 56 ms 9720 KB Output is correct
22 Correct 57 ms 9716 KB Output is correct
23 Correct 59 ms 9724 KB Output is correct
24 Correct 57 ms 9584 KB Output is correct
25 Correct 73 ms 9720 KB Output is correct
26 Correct 57 ms 9684 KB Output is correct
27 Correct 58 ms 9704 KB Output is correct
28 Correct 57 ms 9716 KB Output is correct
29 Correct 59 ms 9720 KB Output is correct
30 Correct 58 ms 9684 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 14 ms 6504 KB Output is correct
6 Correct 25 ms 9716 KB Output is correct
7 Correct 24 ms 9684 KB Output is correct
8 Correct 23 ms 9724 KB Output is correct
9 Correct 22 ms 9716 KB Output is correct
10 Correct 22 ms 9716 KB Output is correct
11 Correct 23 ms 9724 KB Output is correct
12 Correct 24 ms 9684 KB Output is correct
13 Correct 22 ms 9684 KB Output is correct
14 Correct 34 ms 9656 KB Output is correct
15 Correct 23 ms 9712 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 628 KB Output is correct
19 Correct 20 ms 3420 KB Output is correct
20 Correct 45 ms 6508 KB Output is correct
21 Correct 56 ms 9720 KB Output is correct
22 Correct 57 ms 9716 KB Output is correct
23 Correct 59 ms 9724 KB Output is correct
24 Correct 57 ms 9584 KB Output is correct
25 Correct 73 ms 9720 KB Output is correct
26 Correct 57 ms 9684 KB Output is correct
27 Correct 58 ms 9704 KB Output is correct
28 Correct 57 ms 9716 KB Output is correct
29 Correct 59 ms 9720 KB Output is correct
30 Correct 58 ms 9684 KB Output is correct
31 Incorrect 1 ms 340 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 7 ms 3412 KB Output is correct
15 Correct 14 ms 6504 KB Output is correct
16 Correct 25 ms 9716 KB Output is correct
17 Correct 24 ms 9684 KB Output is correct
18 Correct 23 ms 9724 KB Output is correct
19 Correct 22 ms 9716 KB Output is correct
20 Correct 22 ms 9716 KB Output is correct
21 Correct 23 ms 9724 KB Output is correct
22 Correct 24 ms 9684 KB Output is correct
23 Correct 22 ms 9684 KB Output is correct
24 Correct 34 ms 9656 KB Output is correct
25 Correct 23 ms 9712 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 4 ms 628 KB Output is correct
29 Correct 20 ms 3420 KB Output is correct
30 Correct 45 ms 6508 KB Output is correct
31 Correct 56 ms 9720 KB Output is correct
32 Correct 57 ms 9716 KB Output is correct
33 Correct 59 ms 9724 KB Output is correct
34 Correct 57 ms 9584 KB Output is correct
35 Correct 73 ms 9720 KB Output is correct
36 Correct 57 ms 9684 KB Output is correct
37 Correct 58 ms 9704 KB Output is correct
38 Correct 57 ms 9716 KB Output is correct
39 Correct 59 ms 9720 KB Output is correct
40 Correct 58 ms 9684 KB Output is correct
41 Incorrect 1 ms 340 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 7 ms 3412 KB Output is correct
15 Correct 14 ms 6504 KB Output is correct
16 Correct 25 ms 9716 KB Output is correct
17 Correct 24 ms 9684 KB Output is correct
18 Correct 23 ms 9724 KB Output is correct
19 Correct 22 ms 9716 KB Output is correct
20 Correct 22 ms 9716 KB Output is correct
21 Correct 23 ms 9724 KB Output is correct
22 Correct 24 ms 9684 KB Output is correct
23 Correct 22 ms 9684 KB Output is correct
24 Correct 34 ms 9656 KB Output is correct
25 Correct 23 ms 9712 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 4 ms 628 KB Output is correct
29 Correct 20 ms 3420 KB Output is correct
30 Correct 45 ms 6508 KB Output is correct
31 Correct 56 ms 9720 KB Output is correct
32 Correct 57 ms 9716 KB Output is correct
33 Correct 59 ms 9724 KB Output is correct
34 Correct 57 ms 9584 KB Output is correct
35 Correct 73 ms 9720 KB Output is correct
36 Correct 57 ms 9684 KB Output is correct
37 Correct 58 ms 9704 KB Output is correct
38 Correct 57 ms 9716 KB Output is correct
39 Correct 59 ms 9720 KB Output is correct
40 Correct 58 ms 9684 KB Output is correct
41 Incorrect 1 ms 340 KB Output isn't correct
42 Halted 0 ms 0 KB -