oj.uz

Submission #576841

# Submission time Handle Problem Language Result Execution time Memory
576841 2022-06-13T16:06:47 Z talant117408 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 4640 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

const int MAXN = 3e5+7;

ll calc(ll n) {
    return n*(n+1)/2;
}

ll calc2(ll n) {
    return n*(n+1)*(2*n+1)/6;
}

struct MO {
    vector <int> freq;
    set <pii> comp;
    int N;
    
    MO() {
        N = 0;
        freq.resize(MAXN);
    }
    void add(int n) {
        auto it = comp.lb(mp(freq[n], 0));
        pii a;
        if (it != comp.end() && (*it).first == freq[n]) {
            a = *it;
            comp.erase(it);
            if (a.second > 1) {
                comp.insert(mp(a.first, a.second-1));
            }
        }
        
        it = comp.lb(mp(freq[n]+1, 0));
        if (it == comp.end() || (*it).first != freq[n]+1) {
            comp.insert(mp(freq[n]+1, 1));
        }
        else {
            a = *it;
            comp.erase(it);
            a.second++;
            comp.insert(a);
        }
        freq[n]++;
        N++;
    }
    void remove(int n) {
        auto it = comp.lb(mp(freq[n], 0));
        pii a;
        if (it != comp.end() && (*it).first == freq[n]) {
            a = *it;
            comp.erase(it);
            if (a.second > 1) {
                comp.insert(mp(a.first, a.second-1));
            }
        }
        
        if (freq[n] > 1) {
            it = comp.lb(mp(freq[n]-1, 0));
            if (it == comp.end() || (*it).first != freq[n]-1) {
                comp.insert(mp(freq[n]-1, 1));
            }
            else {
                a = *it;
                comp.erase(it);
                a.second++;
                comp.insert(a);
            }
        }
        freq[n]--;
        N--;
    }
    ll get() {
        int saizu = 0;  
        deque <pll> K;
        set <pii> :: reverse_iterator rit;
        for (rit = comp.rbegin(); rit != comp.rend(); rit++) {
            auto x = *rit;
            if (saizu % 2 == 0) {
                K.push_front(mp(x.first, (x.second+1)/2));
                if (x.second > 1)
                    K.push_back(mp(x.first, x.second/2));
            }
            else {
                if (x.second > 1) 
                    K.push_front(mp(x.first, x.second/2));
                K.push_back(mp(x.first, (x.second+1)/2));
            }
            saizu += x.second;
        }
        ll l = 0, r;
        ll ans = 0;
        for (auto p : K) {
            ll x = p.first, k = p.second;
            r = N-l-x;
            ll a = k*calc(x);
            ll b = k*l + x*calc(k-1);
            ll c = k*r - x*calc(k-1);
            ll d = k*l*r + x*(r*calc(k-1) - l*calc(k-1) - x*calc2(k-1));
            ans += a + b*x + c*x + d;
            l += k*x;
        }
        return ans;
    }
};

void solve() {
    int n, q;
    cin >> n >> q;
    vector <int> v(n);
    vector <ll> ans(q);
    vector <pair <pii, int>> queries(q);
    for (auto &to : v) cin >> to;
    for (int i = 0; i < q; i++) {
        cin >> queries[i].first.first >> queries[i].first.second;
        queries[i].first.first--;
        queries[i].first.second--;
        queries[i].second = i;
    }
    sort(all(queries), [&](pair <pii, int> a, pair <pii, int> b) {
        if (a.first.first/400 == b.first.first/400) {
            return a.first.second < b.first.second;
        }
        return a.first.first/400 < b.first.first/400;
    }); 
    
    int l = 0, r = -1;
    MO mo;
    for (auto to : queries) {
        auto ql = to.first.first, qr = to.first.second, ind = to.second;
        while (r < qr) {
            r++;
            mo.add(v[r]);
        }
        while (l > ql) {
            l--;
            mo.add(v[l]);
        }
        while (r > qr) {
            mo.remove(v[r]);
            r--;
        }
        while (l < ql) {
            mo.remove(v[l]);
            l++;
        }
        ans[ind] = mo.get();
    }
    for (auto to : ans) cout << to << endl;
}

int main() {
    //~ do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1452 KB Output is correct
4 Correct 1 ms 1448 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 3 ms 1492 KB Output is correct
4 Correct 22 ms 2044 KB Output is correct
5 Correct 43 ms 2628 KB Output is correct
6 Correct 67 ms 3252 KB Output is correct
7 Correct 76 ms 3244 KB Output is correct
8 Correct 68 ms 3236 KB Output is correct
9 Correct 67 ms 3368 KB Output is correct
10 Correct 65 ms 3272 KB Output is correct
11 Correct 68 ms 3244 KB Output is correct
12 Correct 70 ms 3248 KB Output is correct
13 Correct 76 ms 3264 KB Output is correct
14 Correct 67 ms 3272 KB Output is correct
15 Correct 70 ms 3240 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 3 ms 1492 KB Output is correct
4 Correct 22 ms 2044 KB Output is correct
5 Correct 43 ms 2628 KB Output is correct
6 Correct 67 ms 3252 KB Output is correct
7 Correct 76 ms 3244 KB Output is correct
8 Correct 68 ms 3236 KB Output is correct
9 Correct 67 ms 3368 KB Output is correct
10 Correct 65 ms 3272 KB Output is correct
11 Correct 68 ms 3244 KB Output is correct
12 Correct 70 ms 3248 KB Output is correct
13 Correct 76 ms 3264 KB Output is correct
14 Correct 67 ms 3272 KB Output is correct
15 Correct 70 ms 3240 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 4 ms 1492 KB Output is correct
19 Correct 26 ms 2120 KB Output is correct
20 Correct 57 ms 2764 KB Output is correct
21 Correct 107 ms 3460 KB Output is correct
22 Correct 79 ms 3396 KB Output is correct
23 Correct 79 ms 3376 KB Output is correct
24 Correct 77 ms 3424 KB Output is correct
25 Correct 79 ms 3504 KB Output is correct
26 Correct 89 ms 3404 KB Output is correct
27 Correct 87 ms 3424 KB Output is correct
28 Correct 74 ms 3368 KB Output is correct
29 Correct 78 ms 3380 KB Output is correct
30 Correct 84 ms 3444 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 3 ms 1492 KB Output is correct
4 Correct 22 ms 2044 KB Output is correct
5 Correct 43 ms 2628 KB Output is correct
6 Correct 67 ms 3252 KB Output is correct
7 Correct 76 ms 3244 KB Output is correct
8 Correct 68 ms 3236 KB Output is correct
9 Correct 67 ms 3368 KB Output is correct
10 Correct 65 ms 3272 KB Output is correct
11 Correct 68 ms 3244 KB Output is correct
12 Correct 70 ms 3248 KB Output is correct
13 Correct 76 ms 3264 KB Output is correct
14 Correct 67 ms 3272 KB Output is correct
15 Correct 70 ms 3240 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 4 ms 1492 KB Output is correct
19 Correct 26 ms 2120 KB Output is correct
20 Correct 57 ms 2764 KB Output is correct
21 Correct 107 ms 3460 KB Output is correct
22 Correct 79 ms 3396 KB Output is correct
23 Correct 79 ms 3376 KB Output is correct
24 Correct 77 ms 3424 KB Output is correct
25 Correct 79 ms 3504 KB Output is correct
26 Correct 89 ms 3404 KB Output is correct
27 Correct 87 ms 3424 KB Output is correct
28 Correct 74 ms 3368 KB Output is correct
29 Correct 78 ms 3380 KB Output is correct
30 Correct 84 ms 3444 KB Output is correct
31 Correct 2 ms 1492 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 2 ms 1492 KB Output is correct
34 Correct 5 ms 1464 KB Output is correct
35 Correct 7 ms 1520 KB Output is correct
36 Correct 5 ms 1492 KB Output is correct
37 Correct 23 ms 1840 KB Output is correct
38 Correct 24 ms 1768 KB Output is correct
39 Correct 49 ms 2244 KB Output is correct
40 Correct 96 ms 2976 KB Output is correct
41 Correct 150 ms 3808 KB Output is correct
42 Correct 149 ms 3804 KB Output is correct
43 Correct 157 ms 3748 KB Output is correct
44 Correct 141 ms 3804 KB Output is correct
45 Correct 153 ms 3756 KB Output is correct
46 Correct 152 ms 3764 KB Output is correct
47 Correct 155 ms 3748 KB Output is correct
48 Correct 145 ms 3748 KB Output is correct
49 Correct 143 ms 3796 KB Output is correct
50 Correct 187 ms 3768 KB Output is correct
51 Correct 153 ms 3828 KB Output is correct
52 Correct 160 ms 3788 KB Output is correct
53 Correct 147 ms 3796 KB Output is correct
54 Correct 183 ms 3884 KB Output is correct
55 Correct 156 ms 3752 KB Output is correct
56 Correct 150 ms 3876 KB Output is correct
57 Correct 159 ms 3780 KB Output is correct
58 Correct 156 ms 3764 KB Output is correct
59 Correct 145 ms 3788 KB Output is correct
60 Correct 146 ms 3796 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1452 KB Output is correct
4 Correct 1 ms 1448 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 3 ms 1492 KB Output is correct
14 Correct 22 ms 2044 KB Output is correct
15 Correct 43 ms 2628 KB Output is correct
16 Correct 67 ms 3252 KB Output is correct
17 Correct 76 ms 3244 KB Output is correct
18 Correct 68 ms 3236 KB Output is correct
19 Correct 67 ms 3368 KB Output is correct
20 Correct 65 ms 3272 KB Output is correct
21 Correct 68 ms 3244 KB Output is correct
22 Correct 70 ms 3248 KB Output is correct
23 Correct 76 ms 3264 KB Output is correct
24 Correct 67 ms 3272 KB Output is correct
25 Correct 70 ms 3240 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 1 ms 1364 KB Output is correct
28 Correct 4 ms 1492 KB Output is correct
29 Correct 26 ms 2120 KB Output is correct
30 Correct 57 ms 2764 KB Output is correct
31 Correct 107 ms 3460 KB Output is correct
32 Correct 79 ms 3396 KB Output is correct
33 Correct 79 ms 3376 KB Output is correct
34 Correct 77 ms 3424 KB Output is correct
35 Correct 79 ms 3504 KB Output is correct
36 Correct 89 ms 3404 KB Output is correct
37 Correct 87 ms 3424 KB Output is correct
38 Correct 74 ms 3368 KB Output is correct
39 Correct 78 ms 3380 KB Output is correct
40 Correct 84 ms 3444 KB Output is correct
41 Correct 2 ms 1492 KB Output is correct
42 Correct 2 ms 1492 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct
44 Correct 5 ms 1464 KB Output is correct
45 Correct 7 ms 1520 KB Output is correct
46 Correct 5 ms 1492 KB Output is correct
47 Correct 23 ms 1840 KB Output is correct
48 Correct 24 ms 1768 KB Output is correct
49 Correct 49 ms 2244 KB Output is correct
50 Correct 96 ms 2976 KB Output is correct
51 Correct 150 ms 3808 KB Output is correct
52 Correct 149 ms 3804 KB Output is correct
53 Correct 157 ms 3748 KB Output is correct
54 Correct 141 ms 3804 KB Output is correct
55 Correct 153 ms 3756 KB Output is correct
56 Correct 152 ms 3764 KB Output is correct
57 Correct 155 ms 3748 KB Output is correct
58 Correct 145 ms 3748 KB Output is correct
59 Correct 143 ms 3796 KB Output is correct
60 Correct 187 ms 3768 KB Output is correct
61 Correct 153 ms 3828 KB Output is correct
62 Correct 160 ms 3788 KB Output is correct
63 Correct 147 ms 3796 KB Output is correct
64 Correct 183 ms 3884 KB Output is correct
65 Correct 156 ms 3752 KB Output is correct
66 Correct 150 ms 3876 KB Output is correct
67 Correct 159 ms 3780 KB Output is correct
68 Correct 156 ms 3764 KB Output is correct
69 Correct 145 ms 3788 KB Output is correct
70 Correct 146 ms 3796 KB Output is correct
71 Correct 23 ms 1880 KB Output is correct
72 Correct 23 ms 1876 KB Output is correct
73 Correct 29 ms 1892 KB Output is correct
74 Correct 24 ms 1872 KB Output is correct
75 Correct 25 ms 1880 KB Output is correct
76 Correct 47 ms 2312 KB Output is correct
77 Correct 46 ms 2328 KB Output is correct
78 Correct 49 ms 2332 KB Output is correct
79 Correct 44 ms 2324 KB Output is correct
80 Correct 48 ms 2304 KB Output is correct
81 Correct 101 ms 3112 KB Output is correct
82 Correct 92 ms 3112 KB Output is correct
83 Correct 92 ms 3124 KB Output is correct
84 Correct 93 ms 3312 KB Output is correct
85 Correct 92 ms 3148 KB Output is correct
86 Correct 93 ms 3292 KB Output is correct
87 Correct 99 ms 3248 KB Output is correct
88 Correct 87 ms 3244 KB Output is correct
89 Correct 91 ms 3276 KB Output is correct
90 Correct 89 ms 3240 KB Output is correct
91 Correct 112 ms 4300 KB Output is correct
92 Correct 118 ms 4272 KB Output is correct
93 Correct 120 ms 4364 KB Output is correct
94 Correct 117 ms 4360 KB Output is correct
95 Correct 131 ms 4360 KB Output is correct
96 Correct 118 ms 4404 KB Output is correct
97 Correct 110 ms 4528 KB Output is correct
98 Correct 112 ms 4520 KB Output is correct
99 Correct 137 ms 4516 KB Output is correct
100 Correct 128 ms 4528 KB Output is correct
101 Correct 105 ms 4400 KB Output is correct
102 Correct 109 ms 4540 KB Output is correct
103 Correct 109 ms 4520 KB Output is correct
104 Correct 114 ms 4428 KB Output is correct
105 Correct 110 ms 4536 KB Output is correct
106 Correct 105 ms 4532 KB Output is correct
107 Correct 101 ms 4560 KB Output is correct
108 Correct 108 ms 4640 KB Output is correct
109 Correct 120 ms 4520 KB Output is correct
110 Correct 119 ms 4556 KB Output is correct
111 Correct 104 ms 4516 KB Output is correct
112 Correct 103 ms 4528 KB Output is correct
113 Correct 107 ms 4516 KB Output is correct
114 Correct 118 ms 4560 KB Output is correct
115 Correct 114 ms 4524 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1452 KB Output is correct
4 Correct 1 ms 1448 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 3 ms 1492 KB Output is correct
14 Correct 22 ms 2044 KB Output is correct
15 Correct 43 ms 2628 KB Output is correct
16 Correct 67 ms 3252 KB Output is correct
17 Correct 76 ms 3244 KB Output is correct
18 Correct 68 ms 3236 KB Output is correct
19 Correct 67 ms 3368 KB Output is correct
20 Correct 65 ms 3272 KB Output is correct
21 Correct 68 ms 3244 KB Output is correct
22 Correct 70 ms 3248 KB Output is correct
23 Correct 76 ms 3264 KB Output is correct
24 Correct 67 ms 3272 KB Output is correct
25 Correct 70 ms 3240 KB Output is correct
26 Correct 1 ms 1364 KB Output is correct
27 Correct 1 ms 1364 KB Output is correct
28 Correct 4 ms 1492 KB Output is correct
29 Correct 26 ms 2120 KB Output is correct
30 Correct 57 ms 2764 KB Output is correct
31 Correct 107 ms 3460 KB Output is correct
32 Correct 79 ms 3396 KB Output is correct
33 Correct 79 ms 3376 KB Output is correct
34 Correct 77 ms 3424 KB Output is correct
35 Correct 79 ms 3504 KB Output is correct
36 Correct 89 ms 3404 KB Output is correct
37 Correct 87 ms 3424 KB Output is correct
38 Correct 74 ms 3368 KB Output is correct
39 Correct 78 ms 3380 KB Output is correct
40 Correct 84 ms 3444 KB Output is correct
41 Correct 2 ms 1492 KB Output is correct
42 Correct 2 ms 1492 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct
44 Correct 5 ms 1464 KB Output is correct
45 Correct 7 ms 1520 KB Output is correct
46 Correct 5 ms 1492 KB Output is correct
47 Correct 23 ms 1840 KB Output is correct
48 Correct 24 ms 1768 KB Output is correct
49 Correct 49 ms 2244 KB Output is correct
50 Correct 96 ms 2976 KB Output is correct
51 Correct 150 ms 3808 KB Output is correct
52 Correct 149 ms 3804 KB Output is correct
53 Correct 157 ms 3748 KB Output is correct
54 Correct 141 ms 3804 KB Output is correct
55 Correct 153 ms 3756 KB Output is correct
56 Correct 152 ms 3764 KB Output is correct
57 Correct 155 ms 3748 KB Output is correct
58 Correct 145 ms 3748 KB Output is correct
59 Correct 143 ms 3796 KB Output is correct
60 Correct 187 ms 3768 KB Output is correct
61 Correct 153 ms 3828 KB Output is correct
62 Correct 160 ms 3788 KB Output is correct
63 Correct 147 ms 3796 KB Output is correct
64 Correct 183 ms 3884 KB Output is correct
65 Correct 156 ms 3752 KB Output is correct
66 Correct 150 ms 3876 KB Output is correct
67 Correct 159 ms 3780 KB Output is correct
68 Correct 156 ms 3764 KB Output is correct
69 Correct 145 ms 3788 KB Output is correct
70 Correct 146 ms 3796 KB Output is correct
71 Correct 23 ms 1880 KB Output is correct
72 Correct 23 ms 1876 KB Output is correct
73 Correct 29 ms 1892 KB Output is correct
74 Correct 24 ms 1872 KB Output is correct
75 Correct 25 ms 1880 KB Output is correct
76 Correct 47 ms 2312 KB Output is correct
77 Correct 46 ms 2328 KB Output is correct
78 Correct 49 ms 2332 KB Output is correct
79 Correct 44 ms 2324 KB Output is correct
80 Correct 48 ms 2304 KB Output is correct
81 Correct 101 ms 3112 KB Output is correct
82 Correct 92 ms 3112 KB Output is correct
83 Correct 92 ms 3124 KB Output is correct
84 Correct 93 ms 3312 KB Output is correct
85 Correct 92 ms 3148 KB Output is correct
86 Correct 93 ms 3292 KB Output is correct
87 Correct 99 ms 3248 KB Output is correct
88 Correct 87 ms 3244 KB Output is correct
89 Correct 91 ms 3276 KB Output is correct
90 Correct 89 ms 3240 KB Output is correct
91 Correct 112 ms 4300 KB Output is correct
92 Correct 118 ms 4272 KB Output is correct
93 Correct 120 ms 4364 KB Output is correct
94 Correct 117 ms 4360 KB Output is correct
95 Correct 131 ms 4360 KB Output is correct
96 Correct 118 ms 4404 KB Output is correct
97 Correct 110 ms 4528 KB Output is correct
98 Correct 112 ms 4520 KB Output is correct
99 Correct 137 ms 4516 KB Output is correct
100 Correct 128 ms 4528 KB Output is correct
101 Correct 105 ms 4400 KB Output is correct
102 Correct 109 ms 4540 KB Output is correct
103 Correct 109 ms 4520 KB Output is correct
104 Correct 114 ms 4428 KB Output is correct
105 Correct 110 ms 4536 KB Output is correct
106 Correct 105 ms 4532 KB Output is correct
107 Correct 101 ms 4560 KB Output is correct
108 Correct 108 ms 4640 KB Output is correct
109 Correct 120 ms 4520 KB Output is correct
110 Correct 119 ms 4556 KB Output is correct
111 Correct 104 ms 4516 KB Output is correct
112 Correct 103 ms 4528 KB Output is correct
113 Correct 107 ms 4516 KB Output is correct
114 Correct 118 ms 4560 KB Output is correct
115 Correct 114 ms 4524 KB Output is correct
116 Correct 1309 ms 3376 KB Output is correct
117 Correct 1672 ms 3380 KB Output is correct
118 Correct 2713 ms 3868 KB Output is correct
119 Correct 3654 ms 3924 KB Output is correct
120 Correct 3402 ms 3920 KB Output is correct
121 Execution timed out 7003 ms 3820 KB Time limit exceeded
122 Halted 0 ms 0 KB -