oj.uz

답안 #926081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926081 2024-02-12T14:33:11 Z GrindMachine Diversity (CEOI21_diversity) C++17
38 / 100
 307 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> dp1(n+5,inf2);
    dp1[0] = 0;
    ll sum = 0;

    rep(ind,sz(order)){
        ll c = order[ind].ff;
        rev(i,sum,0){
            if(dp1[i] == inf2) conts;
            
            // front
            if(!(ind&1)){
                amin(dp1[i+c],dp1[i]+f(i+1,c));
            }

            // back
            if(ind&1){
                ll j = sum-i;
                dp1[i] += f(n-j-c+1,c);
            }
            else{
                dp1[i] = inf2;
            }
        }

        sum += c;
    }

    ll ans = *min_element(all(dp1));
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 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 348 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

# 결과 실행 시간 메모리 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 9 ms 2912 KB Output is correct
5 Correct 17 ms 5272 KB Output is correct
6 Correct 28 ms 8024 KB Output is correct
7 Correct 25 ms 7632 KB Output is correct
8 Correct 27 ms 7948 KB Output is correct
9 Correct 27 ms 7624 KB Output is correct
10 Correct 27 ms 9164 KB Output is correct
11 Correct 26 ms 9212 KB Output is correct
12 Correct 28 ms 9156 KB Output is correct
13 Correct 27 ms 7632 KB Output is correct
14 Correct 27 ms 8392 KB Output is correct
15 Correct 32 ms 8560 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 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 9 ms 2912 KB Output is correct
5 Correct 17 ms 5272 KB Output is correct
6 Correct 28 ms 8024 KB Output is correct
7 Correct 25 ms 7632 KB Output is correct
8 Correct 27 ms 7948 KB Output is correct
9 Correct 27 ms 7624 KB Output is correct
10 Correct 27 ms 9164 KB Output is correct
11 Correct 26 ms 9212 KB Output is correct
12 Correct 28 ms 9156 KB Output is correct
13 Correct 27 ms 7632 KB Output is correct
14 Correct 27 ms 8392 KB Output is correct
15 Correct 32 ms 8560 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 12 ms 2776 KB Output is correct
20 Correct 26 ms 5252 KB Output is correct
21 Correct 30 ms 9160 KB Output is correct
22 Correct 31 ms 8144 KB Output is correct
23 Correct 31 ms 8736 KB Output is correct
24 Correct 31 ms 7624 KB Output is correct
25 Correct 34 ms 8556 KB Output is correct
26 Correct 32 ms 8904 KB Output is correct
27 Correct 31 ms 7632 KB Output is correct
28 Correct 29 ms 7888 KB Output is correct
29 Correct 31 ms 8656 KB Output is correct
30 Correct 38 ms 8728 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 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 9 ms 2912 KB Output is correct
5 Correct 17 ms 5272 KB Output is correct
6 Correct 28 ms 8024 KB Output is correct
7 Correct 25 ms 7632 KB Output is correct
8 Correct 27 ms 7948 KB Output is correct
9 Correct 27 ms 7624 KB Output is correct
10 Correct 27 ms 9164 KB Output is correct
11 Correct 26 ms 9212 KB Output is correct
12 Correct 28 ms 9156 KB Output is correct
13 Correct 27 ms 7632 KB Output is correct
14 Correct 27 ms 8392 KB Output is correct
15 Correct 32 ms 8560 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 12 ms 2776 KB Output is correct
20 Correct 26 ms 5252 KB Output is correct
21 Correct 30 ms 9160 KB Output is correct
22 Correct 31 ms 8144 KB Output is correct
23 Correct 31 ms 8736 KB Output is correct
24 Correct 31 ms 7624 KB Output is correct
25 Correct 34 ms 8556 KB Output is correct
26 Correct 32 ms 8904 KB Output is correct
27 Correct 31 ms 7632 KB Output is correct
28 Correct 29 ms 7888 KB Output is correct
29 Correct 31 ms 8656 KB Output is correct
30 Correct 38 ms 8728 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 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 7 ms 8540 KB Output is correct
37 Correct 11 ms 3548 KB Output is correct
38 Correct 16 ms 9436 KB Output is correct
39 Correct 28 ms 10712 KB Output is correct
40 Correct 51 ms 13000 KB Output is correct
41 Correct 75 ms 16844 KB Output is correct
42 Correct 75 ms 16484 KB Output is correct
43 Correct 74 ms 15552 KB Output is correct
44 Correct 85 ms 16340 KB Output is correct
45 Correct 73 ms 16360 KB Output is correct
46 Correct 74 ms 16840 KB Output is correct
47 Correct 85 ms 15300 KB Output is correct
48 Correct 73 ms 17128 KB Output is correct
49 Correct 79 ms 16540 KB Output is correct
50 Correct 73 ms 16744 KB Output is correct
51 Correct 74 ms 16592 KB Output is correct
52 Correct 76 ms 17096 KB Output is correct
53 Correct 80 ms 15300 KB Output is correct
54 Correct 73 ms 16584 KB Output is correct
55 Correct 89 ms 15448 KB Output is correct
56 Correct 75 ms 15604 KB Output is correct
57 Correct 92 ms 16836 KB Output is correct
58 Correct 86 ms 16444 KB Output is correct
59 Correct 73 ms 15812 KB Output is correct
60 Correct 75 ms 16060 KB Output is correct

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 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 348 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 9 ms 2912 KB Output is correct
15 Correct 17 ms 5272 KB Output is correct
16 Correct 28 ms 8024 KB Output is correct
17 Correct 25 ms 7632 KB Output is correct
18 Correct 27 ms 7948 KB Output is correct
19 Correct 27 ms 7624 KB Output is correct
20 Correct 27 ms 9164 KB Output is correct
21 Correct 26 ms 9212 KB Output is correct
22 Correct 28 ms 9156 KB Output is correct
23 Correct 27 ms 7632 KB Output is correct
24 Correct 27 ms 8392 KB Output is correct
25 Correct 32 ms 8560 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 12 ms 2776 KB Output is correct
30 Correct 26 ms 5252 KB Output is correct
31 Correct 30 ms 9160 KB Output is correct
32 Correct 31 ms 8144 KB Output is correct
33 Correct 31 ms 8736 KB Output is correct
34 Correct 31 ms 7624 KB Output is correct
35 Correct 34 ms 8556 KB Output is correct
36 Correct 32 ms 8904 KB Output is correct
37 Correct 31 ms 7632 KB Output is correct
38 Correct 29 ms 7888 KB Output is correct
39 Correct 31 ms 8656 KB Output is correct
40 Correct 38 ms 8728 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 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 7 ms 8540 KB Output is correct
47 Correct 11 ms 3548 KB Output is correct
48 Correct 16 ms 9436 KB Output is correct
49 Correct 28 ms 10712 KB Output is correct
50 Correct 51 ms 13000 KB Output is correct
51 Correct 75 ms 16844 KB Output is correct
52 Correct 75 ms 16484 KB Output is correct
53 Correct 74 ms 15552 KB Output is correct
54 Correct 85 ms 16340 KB Output is correct
55 Correct 73 ms 16360 KB Output is correct
56 Correct 74 ms 16840 KB Output is correct
57 Correct 85 ms 15300 KB Output is correct
58 Correct 73 ms 17128 KB Output is correct
59 Correct 79 ms 16540 KB Output is correct
60 Correct 73 ms 16744 KB Output is correct
61 Correct 74 ms 16592 KB Output is correct
62 Correct 76 ms 17096 KB Output is correct
63 Correct 80 ms 15300 KB Output is correct
64 Correct 73 ms 16584 KB Output is correct
65 Correct 89 ms 15448 KB Output is correct
66 Correct 75 ms 15604 KB Output is correct
67 Correct 92 ms 16836 KB Output is correct
68 Correct 86 ms 16444 KB Output is correct
69 Correct 73 ms 15812 KB Output is correct
70 Correct 75 ms 16060 KB Output is correct
71 Correct 35 ms 32960 KB Output is correct
72 Correct 35 ms 32984 KB Output is correct
73 Correct 35 ms 32940 KB Output is correct
74 Correct 35 ms 32880 KB Output is correct
75 Correct 36 ms 32948 KB Output is correct
76 Correct 174 ms 198680 KB Output is correct
77 Correct 176 ms 198924 KB Output is correct
78 Correct 177 ms 198592 KB Output is correct
79 Correct 178 ms 198608 KB Output is correct
80 Correct 172 ms 198608 KB Output is correct
81 Runtime error 307 ms 524288 KB Execution killed with signal 9
82 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 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 348 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 9 ms 2912 KB Output is correct
15 Correct 17 ms 5272 KB Output is correct
16 Correct 28 ms 8024 KB Output is correct
17 Correct 25 ms 7632 KB Output is correct
18 Correct 27 ms 7948 KB Output is correct
19 Correct 27 ms 7624 KB Output is correct
20 Correct 27 ms 9164 KB Output is correct
21 Correct 26 ms 9212 KB Output is correct
22 Correct 28 ms 9156 KB Output is correct
23 Correct 27 ms 7632 KB Output is correct
24 Correct 27 ms 8392 KB Output is correct
25 Correct 32 ms 8560 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 12 ms 2776 KB Output is correct
30 Correct 26 ms 5252 KB Output is correct
31 Correct 30 ms 9160 KB Output is correct
32 Correct 31 ms 8144 KB Output is correct
33 Correct 31 ms 8736 KB Output is correct
34 Correct 31 ms 7624 KB Output is correct
35 Correct 34 ms 8556 KB Output is correct
36 Correct 32 ms 8904 KB Output is correct
37 Correct 31 ms 7632 KB Output is correct
38 Correct 29 ms 7888 KB Output is correct
39 Correct 31 ms 8656 KB Output is correct
40 Correct 38 ms 8728 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 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 7 ms 8540 KB Output is correct
47 Correct 11 ms 3548 KB Output is correct
48 Correct 16 ms 9436 KB Output is correct
49 Correct 28 ms 10712 KB Output is correct
50 Correct 51 ms 13000 KB Output is correct
51 Correct 75 ms 16844 KB Output is correct
52 Correct 75 ms 16484 KB Output is correct
53 Correct 74 ms 15552 KB Output is correct
54 Correct 85 ms 16340 KB Output is correct
55 Correct 73 ms 16360 KB Output is correct
56 Correct 74 ms 16840 KB Output is correct
57 Correct 85 ms 15300 KB Output is correct
58 Correct 73 ms 17128 KB Output is correct
59 Correct 79 ms 16540 KB Output is correct
60 Correct 73 ms 16744 KB Output is correct
61 Correct 74 ms 16592 KB Output is correct
62 Correct 76 ms 17096 KB Output is correct
63 Correct 80 ms 15300 KB Output is correct
64 Correct 73 ms 16584 KB Output is correct
65 Correct 89 ms 15448 KB Output is correct
66 Correct 75 ms 15604 KB Output is correct
67 Correct 92 ms 16836 KB Output is correct
68 Correct 86 ms 16444 KB Output is correct
69 Correct 73 ms 15812 KB Output is correct
70 Correct 75 ms 16060 KB Output is correct
71 Correct 35 ms 32960 KB Output is correct
72 Correct 35 ms 32984 KB Output is correct
73 Correct 35 ms 32940 KB Output is correct
74 Correct 35 ms 32880 KB Output is correct
75 Correct 36 ms 32948 KB Output is correct
76 Correct 174 ms 198680 KB Output is correct
77 Correct 176 ms 198924 KB Output is correct
78 Correct 177 ms 198592 KB Output is correct
79 Correct 178 ms 198608 KB Output is correct
80 Correct 172 ms 198608 KB Output is correct
81 Runtime error 307 ms 524288 KB Execution killed with signal 9
82 Halted 0 ms 0 KB -