oj.uz

답안 #678227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678227 2023-01-05T10:23:26 Z stanislavpolyn Diversity (CEOI21_diversity) C++17
64 / 100
 84 ms 8152 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>;

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 calc3(ve<pii> a) {
    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;
}

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);

        return calc3(v);
    }
    assert(0);
//
//    deque<int> d;
//    bool who = 0;
//    fe (cur, order) {
//        if (who == 0) d.push_front(cur.fi);
//        else d.pb(cur.fi);
//        who ^= 1;
//    }
//    ve<int> v;
//    int now = 1;
//    fe (x, d) {
//        v.pb(x);
//    }
//    return calc2(v);
}



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];
        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 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 9 ms 1744 KB Output is correct
5 Correct 17 ms 2988 KB Output is correct
6 Correct 29 ms 4212 KB Output is correct
7 Correct 26 ms 4180 KB Output is correct
8 Correct 28 ms 4164 KB Output is correct
9 Correct 28 ms 4124 KB Output is correct
10 Correct 28 ms 4152 KB Output is correct
11 Correct 26 ms 4196 KB Output is correct
12 Correct 29 ms 4176 KB Output is correct
13 Correct 26 ms 4172 KB Output is correct
14 Correct 27 ms 4216 KB Output is correct
15 Correct 40 ms 4220 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 9 ms 1744 KB Output is correct
5 Correct 17 ms 2988 KB Output is correct
6 Correct 29 ms 4212 KB Output is correct
7 Correct 26 ms 4180 KB Output is correct
8 Correct 28 ms 4164 KB Output is correct
9 Correct 28 ms 4124 KB Output is correct
10 Correct 28 ms 4152 KB Output is correct
11 Correct 26 ms 4196 KB Output is correct
12 Correct 29 ms 4176 KB Output is correct
13 Correct 26 ms 4172 KB Output is correct
14 Correct 27 ms 4216 KB Output is correct
15 Correct 40 ms 4220 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 11 ms 1840 KB Output is correct
20 Correct 26 ms 3040 KB Output is correct
21 Correct 28 ms 4196 KB Output is correct
22 Correct 42 ms 4232 KB Output is correct
23 Correct 29 ms 4232 KB Output is correct
24 Correct 30 ms 4212 KB Output is correct
25 Correct 27 ms 4184 KB Output is correct
26 Correct 28 ms 4224 KB Output is correct
27 Correct 31 ms 4132 KB Output is correct
28 Correct 29 ms 4244 KB Output is correct
29 Correct 29 ms 4240 KB Output is correct
30 Correct 43 ms 4216 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 9 ms 1744 KB Output is correct
5 Correct 17 ms 2988 KB Output is correct
6 Correct 29 ms 4212 KB Output is correct
7 Correct 26 ms 4180 KB Output is correct
8 Correct 28 ms 4164 KB Output is correct
9 Correct 28 ms 4124 KB Output is correct
10 Correct 28 ms 4152 KB Output is correct
11 Correct 26 ms 4196 KB Output is correct
12 Correct 29 ms 4176 KB Output is correct
13 Correct 26 ms 4172 KB Output is correct
14 Correct 27 ms 4216 KB Output is correct
15 Correct 40 ms 4220 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 11 ms 1840 KB Output is correct
20 Correct 26 ms 3040 KB Output is correct
21 Correct 28 ms 4196 KB Output is correct
22 Correct 42 ms 4232 KB Output is correct
23 Correct 29 ms 4232 KB Output is correct
24 Correct 30 ms 4212 KB Output is correct
25 Correct 27 ms 4184 KB Output is correct
26 Correct 28 ms 4224 KB Output is correct
27 Correct 31 ms 4132 KB Output is correct
28 Correct 29 ms 4244 KB Output is correct
29 Correct 29 ms 4240 KB Output is correct
30 Correct 43 ms 4216 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 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 10 ms 1156 KB Output is correct
38 Correct 7 ms 1240 KB Output is correct
39 Correct 12 ms 1804 KB Output is correct
40 Correct 23 ms 3060 KB Output is correct
41 Correct 35 ms 4228 KB Output is correct
42 Correct 37 ms 4224 KB Output is correct
43 Correct 54 ms 4164 KB Output is correct
44 Correct 35 ms 4224 KB Output is correct
45 Correct 35 ms 4172 KB Output is correct
46 Correct 35 ms 4160 KB Output is correct
47 Correct 35 ms 4168 KB Output is correct
48 Correct 34 ms 4200 KB Output is correct
49 Correct 34 ms 4192 KB Output is correct
50 Correct 44 ms 4136 KB Output is correct
51 Correct 53 ms 4216 KB Output is correct
52 Correct 35 ms 4164 KB Output is correct
53 Correct 34 ms 4216 KB Output is correct
54 Correct 35 ms 4204 KB Output is correct
55 Correct 36 ms 4156 KB Output is correct
56 Correct 52 ms 4188 KB Output is correct
57 Correct 36 ms 4216 KB Output is correct
58 Correct 38 ms 4164 KB Output is correct
59 Correct 51 ms 4200 KB Output is correct
60 Correct 37 ms 4240 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 9 ms 1744 KB Output is correct
15 Correct 17 ms 2988 KB Output is correct
16 Correct 29 ms 4212 KB Output is correct
17 Correct 26 ms 4180 KB Output is correct
18 Correct 28 ms 4164 KB Output is correct
19 Correct 28 ms 4124 KB Output is correct
20 Correct 28 ms 4152 KB Output is correct
21 Correct 26 ms 4196 KB Output is correct
22 Correct 29 ms 4176 KB Output is correct
23 Correct 26 ms 4172 KB Output is correct
24 Correct 27 ms 4216 KB Output is correct
25 Correct 40 ms 4220 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 11 ms 1840 KB Output is correct
30 Correct 26 ms 3040 KB Output is correct
31 Correct 28 ms 4196 KB Output is correct
32 Correct 42 ms 4232 KB Output is correct
33 Correct 29 ms 4232 KB Output is correct
34 Correct 30 ms 4212 KB Output is correct
35 Correct 27 ms 4184 KB Output is correct
36 Correct 28 ms 4224 KB Output is correct
37 Correct 31 ms 4132 KB Output is correct
38 Correct 29 ms 4244 KB Output is correct
39 Correct 29 ms 4240 KB Output is correct
40 Correct 43 ms 4216 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 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 10 ms 1156 KB Output is correct
48 Correct 7 ms 1240 KB Output is correct
49 Correct 12 ms 1804 KB Output is correct
50 Correct 23 ms 3060 KB Output is correct
51 Correct 35 ms 4228 KB Output is correct
52 Correct 37 ms 4224 KB Output is correct
53 Correct 54 ms 4164 KB Output is correct
54 Correct 35 ms 4224 KB Output is correct
55 Correct 35 ms 4172 KB Output is correct
56 Correct 35 ms 4160 KB Output is correct
57 Correct 35 ms 4168 KB Output is correct
58 Correct 34 ms 4200 KB Output is correct
59 Correct 34 ms 4192 KB Output is correct
60 Correct 44 ms 4136 KB Output is correct
61 Correct 53 ms 4216 KB Output is correct
62 Correct 35 ms 4164 KB Output is correct
63 Correct 34 ms 4216 KB Output is correct
64 Correct 35 ms 4204 KB Output is correct
65 Correct 36 ms 4156 KB Output is correct
66 Correct 52 ms 4188 KB Output is correct
67 Correct 36 ms 4216 KB Output is correct
68 Correct 38 ms 4164 KB Output is correct
69 Correct 51 ms 4200 KB Output is correct
70 Correct 37 ms 4240 KB Output is correct
71 Correct 9 ms 1240 KB Output is correct
72 Correct 8 ms 1240 KB Output is correct
73 Correct 8 ms 1240 KB Output is correct
74 Correct 9 ms 1248 KB Output is correct
75 Correct 7 ms 1240 KB Output is correct
76 Correct 14 ms 1876 KB Output is correct
77 Correct 14 ms 1876 KB Output is correct
78 Correct 14 ms 1812 KB Output is correct
79 Correct 14 ms 1876 KB Output is correct
80 Correct 14 ms 1868 KB Output is correct
81 Correct 32 ms 3140 KB Output is correct
82 Correct 42 ms 3096 KB Output is correct
83 Correct 29 ms 3100 KB Output is correct
84 Correct 28 ms 3188 KB Output is correct
85 Correct 27 ms 3184 KB Output is correct
86 Correct 32 ms 3324 KB Output is correct
87 Correct 35 ms 3352 KB Output is correct
88 Correct 34 ms 3440 KB Output is correct
89 Correct 31 ms 3404 KB Output is correct
90 Correct 44 ms 3312 KB Output is correct
91 Correct 58 ms 6208 KB Output is correct
92 Correct 56 ms 6316 KB Output is correct
93 Correct 68 ms 6272 KB Output is correct
94 Correct 56 ms 6208 KB Output is correct
95 Correct 58 ms 6308 KB Output is correct
96 Correct 80 ms 7872 KB Output is correct
97 Correct 68 ms 7908 KB Output is correct
98 Correct 70 ms 7920 KB Output is correct
99 Correct 69 ms 7936 KB Output is correct
100 Correct 67 ms 7936 KB Output is correct
101 Correct 65 ms 7872 KB Output is correct
102 Correct 75 ms 7956 KB Output is correct
103 Correct 68 ms 7932 KB Output is correct
104 Correct 66 ms 7880 KB Output is correct
105 Correct 70 ms 7872 KB Output is correct
106 Correct 65 ms 8048 KB Output is correct
107 Correct 70 ms 8060 KB Output is correct
108 Correct 71 ms 8060 KB Output is correct
109 Correct 67 ms 8052 KB Output is correct
110 Correct 84 ms 8056 KB Output is correct
111 Correct 69 ms 8076 KB Output is correct
112 Correct 76 ms 8132 KB Output is correct
113 Correct 72 ms 8112 KB Output is correct
114 Correct 74 ms 8056 KB Output is correct
115 Correct 70 ms 8152 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 9 ms 1744 KB Output is correct
15 Correct 17 ms 2988 KB Output is correct
16 Correct 29 ms 4212 KB Output is correct
17 Correct 26 ms 4180 KB Output is correct
18 Correct 28 ms 4164 KB Output is correct
19 Correct 28 ms 4124 KB Output is correct
20 Correct 28 ms 4152 KB Output is correct
21 Correct 26 ms 4196 KB Output is correct
22 Correct 29 ms 4176 KB Output is correct
23 Correct 26 ms 4172 KB Output is correct
24 Correct 27 ms 4216 KB Output is correct
25 Correct 40 ms 4220 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 11 ms 1840 KB Output is correct
30 Correct 26 ms 3040 KB Output is correct
31 Correct 28 ms 4196 KB Output is correct
32 Correct 42 ms 4232 KB Output is correct
33 Correct 29 ms 4232 KB Output is correct
34 Correct 30 ms 4212 KB Output is correct
35 Correct 27 ms 4184 KB Output is correct
36 Correct 28 ms 4224 KB Output is correct
37 Correct 31 ms 4132 KB Output is correct
38 Correct 29 ms 4244 KB Output is correct
39 Correct 29 ms 4240 KB Output is correct
40 Correct 43 ms 4216 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 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 10 ms 1156 KB Output is correct
48 Correct 7 ms 1240 KB Output is correct
49 Correct 12 ms 1804 KB Output is correct
50 Correct 23 ms 3060 KB Output is correct
51 Correct 35 ms 4228 KB Output is correct
52 Correct 37 ms 4224 KB Output is correct
53 Correct 54 ms 4164 KB Output is correct
54 Correct 35 ms 4224 KB Output is correct
55 Correct 35 ms 4172 KB Output is correct
56 Correct 35 ms 4160 KB Output is correct
57 Correct 35 ms 4168 KB Output is correct
58 Correct 34 ms 4200 KB Output is correct
59 Correct 34 ms 4192 KB Output is correct
60 Correct 44 ms 4136 KB Output is correct
61 Correct 53 ms 4216 KB Output is correct
62 Correct 35 ms 4164 KB Output is correct
63 Correct 34 ms 4216 KB Output is correct
64 Correct 35 ms 4204 KB Output is correct
65 Correct 36 ms 4156 KB Output is correct
66 Correct 52 ms 4188 KB Output is correct
67 Correct 36 ms 4216 KB Output is correct
68 Correct 38 ms 4164 KB Output is correct
69 Correct 51 ms 4200 KB Output is correct
70 Correct 37 ms 4240 KB Output is correct
71 Correct 9 ms 1240 KB Output is correct
72 Correct 8 ms 1240 KB Output is correct
73 Correct 8 ms 1240 KB Output is correct
74 Correct 9 ms 1248 KB Output is correct
75 Correct 7 ms 1240 KB Output is correct
76 Correct 14 ms 1876 KB Output is correct
77 Correct 14 ms 1876 KB Output is correct
78 Correct 14 ms 1812 KB Output is correct
79 Correct 14 ms 1876 KB Output is correct
80 Correct 14 ms 1868 KB Output is correct
81 Correct 32 ms 3140 KB Output is correct
82 Correct 42 ms 3096 KB Output is correct
83 Correct 29 ms 3100 KB Output is correct
84 Correct 28 ms 3188 KB Output is correct
85 Correct 27 ms 3184 KB Output is correct
86 Correct 32 ms 3324 KB Output is correct
87 Correct 35 ms 3352 KB Output is correct
88 Correct 34 ms 3440 KB Output is correct
89 Correct 31 ms 3404 KB Output is correct
90 Correct 44 ms 3312 KB Output is correct
91 Correct 58 ms 6208 KB Output is correct
92 Correct 56 ms 6316 KB Output is correct
93 Correct 68 ms 6272 KB Output is correct
94 Correct 56 ms 6208 KB Output is correct
95 Correct 58 ms 6308 KB Output is correct
96 Correct 80 ms 7872 KB Output is correct
97 Correct 68 ms 7908 KB Output is correct
98 Correct 70 ms 7920 KB Output is correct
99 Correct 69 ms 7936 KB Output is correct
100 Correct 67 ms 7936 KB Output is correct
101 Correct 65 ms 7872 KB Output is correct
102 Correct 75 ms 7956 KB Output is correct
103 Correct 68 ms 7932 KB Output is correct
104 Correct 66 ms 7880 KB Output is correct
105 Correct 70 ms 7872 KB Output is correct
106 Correct 65 ms 8048 KB Output is correct
107 Correct 70 ms 8060 KB Output is correct
108 Correct 71 ms 8060 KB Output is correct
109 Correct 67 ms 8052 KB Output is correct
110 Correct 84 ms 8056 KB Output is correct
111 Correct 69 ms 8076 KB Output is correct
112 Correct 76 ms 8132 KB Output is correct
113 Correct 72 ms 8112 KB Output is correct
114 Correct 74 ms 8056 KB Output is correct
115 Correct 70 ms 8152 KB Output is correct
116 Incorrect 2 ms 600 KB Output isn't correct
117 Halted 0 ms 0 KB -