oj.uz

Submission #926084

# Submission time Handle Problem Language Result Execution time Memory
926084 2024-02-12T14:35:51 Z GrindMachine Diversity (CEOI21_diversity) C++17
38 / 100
 299 ms 524288 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,q; cin >> n >> q;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    
    {
        ll l,r; cin >> l >> r;
    }

    vector<ll> b;
    rep(i,n) b.pb(a[i]);
    sort(all(b));
    b.resize(unique(all(b))-b.begin());
    rep(i,n) a[i] = lower_bound(all(b),a[i])-b.begin();
    ll m = sz(b);

    vector<ll> cnt(m);
    rep(i,n) cnt[a[i]]++;

    ll dp[m][m];
    memset(dp,0x3f,sizeof dp);

    vector<pll> order;
    rep(i,m) order.pb({cnt[i],i});
    sort(all(order));

    auto f = [&](ll i, ll c){
        ll cost = 0;
        cost += i*(n-i+1);
        if(c > 1){
            ll mx = n-i;
            ll mn = n-i-c+2;
            cost += mx*(mx+1)/2-mn*(mn-1)/2;
        }
        return cost;
    };

    vector<ll> order2;
    rep(i,m){
        if(!(i&1)){
            order2.pb(order[i].ff);
        }
    }
    rev(i,m-1,0){
        if(i&1){
            order2.pb(order[i].ff);
        }
    }

    ll ans = 0;
    ll i = 1;
    trav(c,order2){
        ans += f(i,c);
        i += c;
    }

    cout << ans << endl;

    // vector<ll> order(m);
    // rep(i,m) order[i] = i;

    // ll ans = inf2;

    // do{

    //     ll i = 1;
    //     ll cost = 0;

    //     trav(x,order){
    //         ll c = cnt[x];
    //         ll add = 0;
    //         add = 2*i*(n-i+1)+(n-i)*(n+1-i)-(n+1-i-c)*(n+2-i-c);            
    //         cost += add;

    //         // cost += i*(n-i+1);
    //         // if(c > 1){
    //         //     ll mx = n-i;
    //         //     ll mn = n-i-c+2;
    //         //     assert(mn <= mx);
    //         //     cost += mx*(mx+1)/2-mn*(mn-1)/2;
    //         // }
        
    //         i += c;            
    //     }

    //     cost /= 2;
    //     amin(ans,cost);

    //     if(cost == 171){
    //         debug(order);
    //     }

    // } while(next_permutation(all(order)));

    // cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 12 ms 2268 KB Output is correct
5 Correct 20 ms 4056 KB Output is correct
6 Correct 27 ms 7424 KB Output is correct
7 Correct 34 ms 7892 KB Output is correct
8 Correct 36 ms 7164 KB Output is correct
9 Correct 28 ms 8308 KB Output is correct
10 Correct 25 ms 8916 KB Output is correct
11 Correct 26 ms 8404 KB Output is correct
12 Correct 34 ms 7124 KB Output is correct
13 Correct 27 ms 8144 KB Output is correct
14 Correct 26 ms 8916 KB Output is correct
15 Correct 27 ms 7800 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 12 ms 2268 KB Output is correct
5 Correct 20 ms 4056 KB Output is correct
6 Correct 27 ms 7424 KB Output is correct
7 Correct 34 ms 7892 KB Output is correct
8 Correct 36 ms 7164 KB Output is correct
9 Correct 28 ms 8308 KB Output is correct
10 Correct 25 ms 8916 KB Output is correct
11 Correct 26 ms 8404 KB Output is correct
12 Correct 34 ms 7124 KB Output is correct
13 Correct 27 ms 8144 KB Output is correct
14 Correct 26 ms 8916 KB Output is correct
15 Correct 27 ms 7800 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 10 ms 2268 KB Output is correct
20 Correct 20 ms 4056 KB Output is correct
21 Correct 32 ms 7636 KB Output is correct
22 Correct 32 ms 7636 KB Output is correct
23 Correct 29 ms 7032 KB Output is correct
24 Correct 30 ms 8052 KB Output is correct
25 Correct 31 ms 7636 KB Output is correct
26 Correct 36 ms 7636 KB Output is correct
27 Correct 31 ms 7632 KB Output is correct
28 Correct 29 ms 8404 KB Output is correct
29 Correct 29 ms 7380 KB Output is correct
30 Correct 31 ms 7892 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 12 ms 2268 KB Output is correct
5 Correct 20 ms 4056 KB Output is correct
6 Correct 27 ms 7424 KB Output is correct
7 Correct 34 ms 7892 KB Output is correct
8 Correct 36 ms 7164 KB Output is correct
9 Correct 28 ms 8308 KB Output is correct
10 Correct 25 ms 8916 KB Output is correct
11 Correct 26 ms 8404 KB Output is correct
12 Correct 34 ms 7124 KB Output is correct
13 Correct 27 ms 8144 KB Output is correct
14 Correct 26 ms 8916 KB Output is correct
15 Correct 27 ms 7800 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 10 ms 2268 KB Output is correct
20 Correct 20 ms 4056 KB Output is correct
21 Correct 32 ms 7636 KB Output is correct
22 Correct 32 ms 7636 KB Output is correct
23 Correct 29 ms 7032 KB Output is correct
24 Correct 30 ms 8052 KB Output is correct
25 Correct 31 ms 7636 KB Output is correct
26 Correct 36 ms 7636 KB Output is correct
27 Correct 31 ms 7632 KB Output is correct
28 Correct 29 ms 8404 KB Output is correct
29 Correct 29 ms 7380 KB Output is correct
30 Correct 31 ms 7892 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 1116 KB Output is correct
36 Correct 6 ms 8540 KB Output is correct
37 Correct 11 ms 3184 KB Output is correct
38 Correct 12 ms 9180 KB Output is correct
39 Correct 24 ms 9944 KB Output is correct
40 Correct 34 ms 11412 KB Output is correct
41 Correct 52 ms 14708 KB Output is correct
42 Correct 49 ms 14528 KB Output is correct
43 Correct 58 ms 14020 KB Output is correct
44 Correct 50 ms 12992 KB Output is correct
45 Correct 53 ms 13444 KB Output is correct
46 Correct 50 ms 13476 KB Output is correct
47 Correct 61 ms 14320 KB Output is correct
48 Correct 50 ms 14016 KB Output is correct
49 Correct 50 ms 13248 KB Output is correct
50 Correct 49 ms 13764 KB Output is correct
51 Correct 52 ms 12976 KB Output is correct
52 Correct 50 ms 13508 KB Output is correct
53 Correct 61 ms 13156 KB Output is correct
54 Correct 50 ms 13508 KB Output is correct
55 Correct 53 ms 14276 KB Output is correct
56 Correct 50 ms 14020 KB Output is correct
57 Correct 49 ms 13000 KB Output is correct
58 Correct 63 ms 13440 KB Output is correct
59 Correct 55 ms 14204 KB Output is correct
60 Correct 64 ms 14244 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 12 ms 2268 KB Output is correct
15 Correct 20 ms 4056 KB Output is correct
16 Correct 27 ms 7424 KB Output is correct
17 Correct 34 ms 7892 KB Output is correct
18 Correct 36 ms 7164 KB Output is correct
19 Correct 28 ms 8308 KB Output is correct
20 Correct 25 ms 8916 KB Output is correct
21 Correct 26 ms 8404 KB Output is correct
22 Correct 34 ms 7124 KB Output is correct
23 Correct 27 ms 8144 KB Output is correct
24 Correct 26 ms 8916 KB Output is correct
25 Correct 27 ms 7800 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 10 ms 2268 KB Output is correct
30 Correct 20 ms 4056 KB Output is correct
31 Correct 32 ms 7636 KB Output is correct
32 Correct 32 ms 7636 KB Output is correct
33 Correct 29 ms 7032 KB Output is correct
34 Correct 30 ms 8052 KB Output is correct
35 Correct 31 ms 7636 KB Output is correct
36 Correct 36 ms 7636 KB Output is correct
37 Correct 31 ms 7632 KB Output is correct
38 Correct 29 ms 8404 KB Output is correct
39 Correct 29 ms 7380 KB Output is correct
40 Correct 31 ms 7892 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 856 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 6 ms 8540 KB Output is correct
47 Correct 11 ms 3184 KB Output is correct
48 Correct 12 ms 9180 KB Output is correct
49 Correct 24 ms 9944 KB Output is correct
50 Correct 34 ms 11412 KB Output is correct
51 Correct 52 ms 14708 KB Output is correct
52 Correct 49 ms 14528 KB Output is correct
53 Correct 58 ms 14020 KB Output is correct
54 Correct 50 ms 12992 KB Output is correct
55 Correct 53 ms 13444 KB Output is correct
56 Correct 50 ms 13476 KB Output is correct
57 Correct 61 ms 14320 KB Output is correct
58 Correct 50 ms 14016 KB Output is correct
59 Correct 50 ms 13248 KB Output is correct
60 Correct 49 ms 13764 KB Output is correct
61 Correct 52 ms 12976 KB Output is correct
62 Correct 50 ms 13508 KB Output is correct
63 Correct 61 ms 13156 KB Output is correct
64 Correct 50 ms 13508 KB Output is correct
65 Correct 53 ms 14276 KB Output is correct
66 Correct 50 ms 14020 KB Output is correct
67 Correct 49 ms 13000 KB Output is correct
68 Correct 63 ms 13440 KB Output is correct
69 Correct 55 ms 14204 KB Output is correct
70 Correct 64 ms 14244 KB Output is correct
71 Correct 31 ms 32464 KB Output is correct
72 Correct 26 ms 32472 KB Output is correct
73 Correct 27 ms 32472 KB Output is correct
74 Correct 26 ms 32464 KB Output is correct
75 Correct 26 ms 32720 KB Output is correct
76 Correct 129 ms 197812 KB Output is correct
77 Correct 125 ms 197868 KB Output is correct
78 Correct 125 ms 197836 KB Output is correct
79 Correct 147 ms 197836 KB Output is correct
80 Correct 135 ms 197840 KB Output is correct
81 Runtime error 299 ms 524288 KB Execution killed with signal 9
82 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 12 ms 2268 KB Output is correct
15 Correct 20 ms 4056 KB Output is correct
16 Correct 27 ms 7424 KB Output is correct
17 Correct 34 ms 7892 KB Output is correct
18 Correct 36 ms 7164 KB Output is correct
19 Correct 28 ms 8308 KB Output is correct
20 Correct 25 ms 8916 KB Output is correct
21 Correct 26 ms 8404 KB Output is correct
22 Correct 34 ms 7124 KB Output is correct
23 Correct 27 ms 8144 KB Output is correct
24 Correct 26 ms 8916 KB Output is correct
25 Correct 27 ms 7800 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 10 ms 2268 KB Output is correct
30 Correct 20 ms 4056 KB Output is correct
31 Correct 32 ms 7636 KB Output is correct
32 Correct 32 ms 7636 KB Output is correct
33 Correct 29 ms 7032 KB Output is correct
34 Correct 30 ms 8052 KB Output is correct
35 Correct 31 ms 7636 KB Output is correct
36 Correct 36 ms 7636 KB Output is correct
37 Correct 31 ms 7632 KB Output is correct
38 Correct 29 ms 8404 KB Output is correct
39 Correct 29 ms 7380 KB Output is correct
40 Correct 31 ms 7892 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 856 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 6 ms 8540 KB Output is correct
47 Correct 11 ms 3184 KB Output is correct
48 Correct 12 ms 9180 KB Output is correct
49 Correct 24 ms 9944 KB Output is correct
50 Correct 34 ms 11412 KB Output is correct
51 Correct 52 ms 14708 KB Output is correct
52 Correct 49 ms 14528 KB Output is correct
53 Correct 58 ms 14020 KB Output is correct
54 Correct 50 ms 12992 KB Output is correct
55 Correct 53 ms 13444 KB Output is correct
56 Correct 50 ms 13476 KB Output is correct
57 Correct 61 ms 14320 KB Output is correct
58 Correct 50 ms 14016 KB Output is correct
59 Correct 50 ms 13248 KB Output is correct
60 Correct 49 ms 13764 KB Output is correct
61 Correct 52 ms 12976 KB Output is correct
62 Correct 50 ms 13508 KB Output is correct
63 Correct 61 ms 13156 KB Output is correct
64 Correct 50 ms 13508 KB Output is correct
65 Correct 53 ms 14276 KB Output is correct
66 Correct 50 ms 14020 KB Output is correct
67 Correct 49 ms 13000 KB Output is correct
68 Correct 63 ms 13440 KB Output is correct
69 Correct 55 ms 14204 KB Output is correct
70 Correct 64 ms 14244 KB Output is correct
71 Correct 31 ms 32464 KB Output is correct
72 Correct 26 ms 32472 KB Output is correct
73 Correct 27 ms 32472 KB Output is correct
74 Correct 26 ms 32464 KB Output is correct
75 Correct 26 ms 32720 KB Output is correct
76 Correct 129 ms 197812 KB Output is correct
77 Correct 125 ms 197868 KB Output is correct
78 Correct 125 ms 197836 KB Output is correct
79 Correct 147 ms 197836 KB Output is correct
80 Correct 135 ms 197840 KB Output is correct
81 Runtime error 299 ms 524288 KB Execution killed with signal 9
82 Halted 0 ms 0 KB -