oj.uz

답안 #678241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678241 2023-01-05T10:45:43 Z stanislavpolyn Diversity (CEOI21_diversity) C++17
38 / 100
 65 ms 7616 KB 
#include <bits/stdc++.h>

#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define all(x) (x).begin(), (x).end()
#define pw(x) (1LL << (x))
#define sz(x) (int)(x).size()

using namespace std;

//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

mt19937_64 rng(228);

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umn(T& a, T b) {
    return a > b ? a = b, 1 : 0;
}
template <typename T>
bool umx(T& a, T b) {
    return a < b ? a = b, 1 : 0;
}

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

const int B = 560;

int calc(ve<int> a) {
    int ans = 0;
    fr (i, 0, sz(a) - 1) {
        set<int> s;
        fr (j, i, sz(a) - 1) {
            s.insert(a[j]);
            ans += sz(s);
        }
    }
    return ans;
}


ll calc2(ve<int> a) {
    int total = 0;
    fe (x, a) total += x;
    ll ans = 0;
    int toLeft = 0;
    ans += 1LL * sz(a) * total * (total + 1) / 2;
    fr (i, 0, sz(a) - 1) {
        int toRight = total - toLeft - a[i];
        ans -= 1LL * toLeft * (toLeft + 1) / 2;
        ans -= 1LL * toRight * (toRight + 1) / 2;
        toLeft += a[i];
    }
    return ans;
}

ll calc3Brute(ve<pii> a) {
    assert(sz(a) <= 2 * B);
    int total = 0;
    int gr = 0;
    fe (x, a) {
        total += x.fi * x.se;
        gr += x.se;
    }
    ll ans = 0;

    ans += 1LL * gr * total * (total + 1) / 2;
    int toLeft = 0;
    fe (cur, a) {
        fr (j, 1, cur.se) {
            ans -= 1LL * toLeft * (toLeft + 1) / 2;
            toLeft += cur.fi;
        }
    }
    reverse(all(a));
    toLeft = 0;
    fe (cur, a) {
        fr (j, 1, cur.se) {
            ans -= 1LL * toLeft * (toLeft + 1) / 2;
            toLeft += cur.fi;
        }
    }
    return ans;
}

ll calc3(ve<pii> a) {
    assert(sz(a) <= 2 * B);

    ll total = 0;
    ll gr = 0;
    fe (x, a) {
        total += x.fi * x.se;
        gr += x.se;
    }
    ll ans = 0;

    ans += 1LL * gr * total * (total + 1) / 2;
    ll toLeft = 0;
    fe (cur, a) {
        ll res = 0;

        res += toLeft * cur.se;
        res += cur.fi * 1LL * cur.se * (cur.se - 1) / 2;

        res += 1LL * toLeft * toLeft * cur.se;
        {
            ll t = cur.se * (cur.se - 1) / 2;
            t *= 2;
            res += t * cur.fi * toLeft;
        }

        cur.se--;
        ll sumSquares = (__int128)cur.se * (cur.se + 1) * (2 * cur.se + 1) / 6;
        cur.se++;

        res += sumSquares * cur.fi * cur.fi;

        res /= 2;
        ans -= res;

        toLeft += cur.fi * cur.se;
    }
    reverse(all(a));

    toLeft = 0;
    fe (cur, a) {
        ll res = 0;

        res += toLeft * cur.se;
        res += cur.fi * 1LL * cur.se * (cur.se - 1) / 2;

        res += 1LL * toLeft * toLeft * cur.se;
        {
            ll t = cur.se * (cur.se - 1) / 2;
            t *= 2;
            res += t * cur.fi * toLeft;
        }

        cur.se--;
        ll sumSquares = (__int128)cur.se * (cur.se + 1) * (2 * cur.se + 1) / 6;
        cur.se++;

        res += sumSquares * cur.fi * cur.fi;

        res /= 2;
        ans -= res;

        toLeft += cur.fi * cur.se;
    }

    return ans;
}

const int N = 3e5 + 5;

int n, q;
int a[N];

int cnt[N];

int rnd(int l, int r) {
    return rng() % (r - l + 1) + l;
}

ll solve(ve<int> a) {
    fe (x, a) cnt[x] = 0;

    fe (x, a) cnt[x]++;

    ve<pii> order;
    fe (x, a) {
        if (cnt[x]) {
            order.pb({cnt[x], x});
            cnt[x] = 0;
        }
    }
    sort(all(order));
    reverse(all(order));

    {
        ve<pii> st;
        fe (cur, order) {
            if (!sz(st) || cur.fi != st.back().fi) {
                st.pb({cur.fi, 1});
            } else {
                st.back().se++;
            }
        }
        deque<pii> d;
        bool who = 0;
        fe (x, st) {
            if (x.se > 1) {
                d.push_front({x.fi, x.se / 2});
                d.pb({x.fi, x.se / 2});
                x.se %= 2;
            }
            if (x.se) {
                if (who == 0) {
                    if (sz(d) && d.front().fi == x.fi) d.front().se++;
                    else d.push_front({x.fi, 1});
                } else {
                    if (sz(d) && d.back().fi == x.fi) d.back().se++;
                    else d.pb({x.fi, 1});
                }
                who ^= 1;
            }
        }

        ve<pii> v;
        fe (x, d) v.pb(x);

//        cout << calc3Brute(v) << "\n";

        return calc3(v);
    }
    assert(0);
}



int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif



    cin >> n >> q;

    ve<int> v;
    fr (i, 1, n) {
        cin >> a[i];
//        a[i] = rnd(1, 100000);
        v.pb(a[i]);
    }

    sort(all(v));

    cout << solve(v) << "\n";


//    int mn = 1e9;
//    do {
//        umn(mn, calc(v));
//    } while (next_permutation(all(v)));
//
//    cout << solve(v) << " " << mn << "\n";
//
//    do {
//        if (calc(v) == mn) {
//            cout << "v: ";
//            fe (x, v) cout << x << " ";
//            cout << "\n";
//        }
//    } while (next_permutation(all(v)));


    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 9 ms 1620 KB Output is correct
5 Correct 20 ms 2716 KB Output is correct
6 Correct 26 ms 3980 KB Output is correct
7 Correct 24 ms 3916 KB Output is correct
8 Correct 26 ms 4004 KB Output is correct
9 Correct 24 ms 3940 KB Output is correct
10 Correct 26 ms 3984 KB Output is correct
11 Correct 24 ms 3980 KB Output is correct
12 Correct 25 ms 3916 KB Output is correct
13 Correct 25 ms 3944 KB Output is correct
14 Correct 27 ms 3944 KB Output is correct
15 Correct 26 ms 3960 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 9 ms 1620 KB Output is correct
5 Correct 20 ms 2716 KB Output is correct
6 Correct 26 ms 3980 KB Output is correct
7 Correct 24 ms 3916 KB Output is correct
8 Correct 26 ms 4004 KB Output is correct
9 Correct 24 ms 3940 KB Output is correct
10 Correct 26 ms 3984 KB Output is correct
11 Correct 24 ms 3980 KB Output is correct
12 Correct 25 ms 3916 KB Output is correct
13 Correct 25 ms 3944 KB Output is correct
14 Correct 27 ms 3944 KB Output is correct
15 Correct 26 ms 3960 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 9 ms 1536 KB Output is correct
20 Correct 20 ms 2716 KB Output is correct
21 Correct 27 ms 3908 KB Output is correct
22 Correct 27 ms 3980 KB Output is correct
23 Correct 26 ms 3916 KB Output is correct
24 Correct 27 ms 3932 KB Output is correct
25 Correct 27 ms 3988 KB Output is correct
26 Correct 28 ms 3952 KB Output is correct
27 Correct 27 ms 3916 KB Output is correct
28 Correct 27 ms 3884 KB Output is correct
29 Correct 27 ms 4048 KB Output is correct
30 Correct 28 ms 3892 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 9 ms 1620 KB Output is correct
5 Correct 20 ms 2716 KB Output is correct
6 Correct 26 ms 3980 KB Output is correct
7 Correct 24 ms 3916 KB Output is correct
8 Correct 26 ms 4004 KB Output is correct
9 Correct 24 ms 3940 KB Output is correct
10 Correct 26 ms 3984 KB Output is correct
11 Correct 24 ms 3980 KB Output is correct
12 Correct 25 ms 3916 KB Output is correct
13 Correct 25 ms 3944 KB Output is correct
14 Correct 27 ms 3944 KB Output is correct
15 Correct 26 ms 3960 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 9 ms 1536 KB Output is correct
20 Correct 20 ms 2716 KB Output is correct
21 Correct 27 ms 3908 KB Output is correct
22 Correct 27 ms 3980 KB Output is correct
23 Correct 26 ms 3916 KB Output is correct
24 Correct 27 ms 3932 KB Output is correct
25 Correct 27 ms 3988 KB Output is correct
26 Correct 28 ms 3952 KB Output is correct
27 Correct 27 ms 3916 KB Output is correct
28 Correct 27 ms 3884 KB Output is correct
29 Correct 27 ms 4048 KB Output is correct
30 Correct 28 ms 3892 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 6 ms 984 KB Output is correct
38 Correct 6 ms 984 KB Output is correct
39 Correct 12 ms 1648 KB Output is correct
40 Correct 23 ms 2768 KB Output is correct
41 Correct 34 ms 3968 KB Output is correct
42 Correct 34 ms 3980 KB Output is correct
43 Correct 34 ms 3976 KB Output is correct
44 Correct 34 ms 3984 KB Output is correct
45 Correct 39 ms 3904 KB Output is correct
46 Correct 34 ms 3976 KB Output is correct
47 Correct 34 ms 3976 KB Output is correct
48 Correct 34 ms 3964 KB Output is correct
49 Correct 35 ms 3960 KB Output is correct
50 Correct 35 ms 3968 KB Output is correct
51 Correct 34 ms 3976 KB Output is correct
52 Correct 34 ms 3908 KB Output is correct
53 Correct 34 ms 3916 KB Output is correct
54 Correct 34 ms 3956 KB Output is correct
55 Correct 34 ms 3892 KB Output is correct
56 Correct 35 ms 3976 KB Output is correct
57 Correct 33 ms 3960 KB Output is correct
58 Correct 33 ms 3948 KB Output is correct
59 Correct 34 ms 3904 KB Output is correct
60 Correct 34 ms 3916 KB Output is correct

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 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 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 9 ms 1620 KB Output is correct
15 Correct 20 ms 2716 KB Output is correct
16 Correct 26 ms 3980 KB Output is correct
17 Correct 24 ms 3916 KB Output is correct
18 Correct 26 ms 4004 KB Output is correct
19 Correct 24 ms 3940 KB Output is correct
20 Correct 26 ms 3984 KB Output is correct
21 Correct 24 ms 3980 KB Output is correct
22 Correct 25 ms 3916 KB Output is correct
23 Correct 25 ms 3944 KB Output is correct
24 Correct 27 ms 3944 KB Output is correct
25 Correct 26 ms 3960 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 9 ms 1536 KB Output is correct
30 Correct 20 ms 2716 KB Output is correct
31 Correct 27 ms 3908 KB Output is correct
32 Correct 27 ms 3980 KB Output is correct
33 Correct 26 ms 3916 KB Output is correct
34 Correct 27 ms 3932 KB Output is correct
35 Correct 27 ms 3988 KB Output is correct
36 Correct 28 ms 3952 KB Output is correct
37 Correct 27 ms 3916 KB Output is correct
38 Correct 27 ms 3884 KB Output is correct
39 Correct 27 ms 4048 KB Output is correct
40 Correct 28 ms 3892 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 6 ms 984 KB Output is correct
48 Correct 6 ms 984 KB Output is correct
49 Correct 12 ms 1648 KB Output is correct
50 Correct 23 ms 2768 KB Output is correct
51 Correct 34 ms 3968 KB Output is correct
52 Correct 34 ms 3980 KB Output is correct
53 Correct 34 ms 3976 KB Output is correct
54 Correct 34 ms 3984 KB Output is correct
55 Correct 39 ms 3904 KB Output is correct
56 Correct 34 ms 3976 KB Output is correct
57 Correct 34 ms 3976 KB Output is correct
58 Correct 34 ms 3964 KB Output is correct
59 Correct 35 ms 3960 KB Output is correct
60 Correct 35 ms 3968 KB Output is correct
61 Correct 34 ms 3976 KB Output is correct
62 Correct 34 ms 3908 KB Output is correct
63 Correct 34 ms 3916 KB Output is correct
64 Correct 34 ms 3956 KB Output is correct
65 Correct 34 ms 3892 KB Output is correct
66 Correct 35 ms 3976 KB Output is correct
67 Correct 33 ms 3960 KB Output is correct
68 Correct 33 ms 3948 KB Output is correct
69 Correct 34 ms 3904 KB Output is correct
70 Correct 34 ms 3916 KB Output is correct
71 Correct 6 ms 984 KB Output is correct
72 Correct 7 ms 984 KB Output is correct
73 Correct 7 ms 984 KB Output is correct
74 Correct 6 ms 984 KB Output is correct
75 Correct 7 ms 984 KB Output is correct
76 Correct 14 ms 1656 KB Output is correct
77 Correct 14 ms 1648 KB Output is correct
78 Correct 14 ms 1620 KB Output is correct
79 Correct 14 ms 1652 KB Output is correct
80 Correct 14 ms 1620 KB Output is correct
81 Correct 28 ms 2812 KB Output is correct
82 Correct 27 ms 2888 KB Output is correct
83 Correct 27 ms 2880 KB Output is correct
84 Correct 27 ms 2948 KB Output is correct
85 Correct 27 ms 2852 KB Output is correct
86 Correct 31 ms 3056 KB Output is correct
87 Correct 32 ms 3152 KB Output is correct
88 Correct 31 ms 3152 KB Output is correct
89 Correct 31 ms 3108 KB Output is correct
90 Correct 31 ms 3052 KB Output is correct
91 Correct 56 ms 6004 KB Output is correct
92 Correct 54 ms 5956 KB Output is correct
93 Correct 55 ms 6008 KB Output is correct
94 Correct 55 ms 5932 KB Output is correct
95 Correct 56 ms 6004 KB Output is correct
96 Incorrect 65 ms 7616 KB Output isn't correct
97 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 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 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 9 ms 1620 KB Output is correct
15 Correct 20 ms 2716 KB Output is correct
16 Correct 26 ms 3980 KB Output is correct
17 Correct 24 ms 3916 KB Output is correct
18 Correct 26 ms 4004 KB Output is correct
19 Correct 24 ms 3940 KB Output is correct
20 Correct 26 ms 3984 KB Output is correct
21 Correct 24 ms 3980 KB Output is correct
22 Correct 25 ms 3916 KB Output is correct
23 Correct 25 ms 3944 KB Output is correct
24 Correct 27 ms 3944 KB Output is correct
25 Correct 26 ms 3960 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 9 ms 1536 KB Output is correct
30 Correct 20 ms 2716 KB Output is correct
31 Correct 27 ms 3908 KB Output is correct
32 Correct 27 ms 3980 KB Output is correct
33 Correct 26 ms 3916 KB Output is correct
34 Correct 27 ms 3932 KB Output is correct
35 Correct 27 ms 3988 KB Output is correct
36 Correct 28 ms 3952 KB Output is correct
37 Correct 27 ms 3916 KB Output is correct
38 Correct 27 ms 3884 KB Output is correct
39 Correct 27 ms 4048 KB Output is correct
40 Correct 28 ms 3892 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 6 ms 984 KB Output is correct
48 Correct 6 ms 984 KB Output is correct
49 Correct 12 ms 1648 KB Output is correct
50 Correct 23 ms 2768 KB Output is correct
51 Correct 34 ms 3968 KB Output is correct
52 Correct 34 ms 3980 KB Output is correct
53 Correct 34 ms 3976 KB Output is correct
54 Correct 34 ms 3984 KB Output is correct
55 Correct 39 ms 3904 KB Output is correct
56 Correct 34 ms 3976 KB Output is correct
57 Correct 34 ms 3976 KB Output is correct
58 Correct 34 ms 3964 KB Output is correct
59 Correct 35 ms 3960 KB Output is correct
60 Correct 35 ms 3968 KB Output is correct
61 Correct 34 ms 3976 KB Output is correct
62 Correct 34 ms 3908 KB Output is correct
63 Correct 34 ms 3916 KB Output is correct
64 Correct 34 ms 3956 KB Output is correct
65 Correct 34 ms 3892 KB Output is correct
66 Correct 35 ms 3976 KB Output is correct
67 Correct 33 ms 3960 KB Output is correct
68 Correct 33 ms 3948 KB Output is correct
69 Correct 34 ms 3904 KB Output is correct
70 Correct 34 ms 3916 KB Output is correct
71 Correct 6 ms 984 KB Output is correct
72 Correct 7 ms 984 KB Output is correct
73 Correct 7 ms 984 KB Output is correct
74 Correct 6 ms 984 KB Output is correct
75 Correct 7 ms 984 KB Output is correct
76 Correct 14 ms 1656 KB Output is correct
77 Correct 14 ms 1648 KB Output is correct
78 Correct 14 ms 1620 KB Output is correct
79 Correct 14 ms 1652 KB Output is correct
80 Correct 14 ms 1620 KB Output is correct
81 Correct 28 ms 2812 KB Output is correct
82 Correct 27 ms 2888 KB Output is correct
83 Correct 27 ms 2880 KB Output is correct
84 Correct 27 ms 2948 KB Output is correct
85 Correct 27 ms 2852 KB Output is correct
86 Correct 31 ms 3056 KB Output is correct
87 Correct 32 ms 3152 KB Output is correct
88 Correct 31 ms 3152 KB Output is correct
89 Correct 31 ms 3108 KB Output is correct
90 Correct 31 ms 3052 KB Output is correct
91 Correct 56 ms 6004 KB Output is correct
92 Correct 54 ms 5956 KB Output is correct
93 Correct 55 ms 6008 KB Output is correct
94 Correct 55 ms 5932 KB Output is correct
95 Correct 56 ms 6004 KB Output is correct
96 Incorrect 65 ms 7616 KB Output isn't correct
97 Halted 0 ms 0 KB -