oj.uz

Submission #576842

# Submission time Handle Problem Language Result Execution time Memory
576842 2022-06-13T16:10:08 Z talant117408 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 3328 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 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1468 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 4 ms 1492 KB Output is correct
4 Correct 13 ms 2004 KB Output is correct
5 Correct 32 ms 2404 KB Output is correct
6 Correct 41 ms 2732 KB Output is correct
7 Correct 37 ms 2732 KB Output is correct
8 Correct 43 ms 2780 KB Output is correct
9 Correct 43 ms 2768 KB Output is correct
10 Correct 42 ms 2760 KB Output is correct
11 Correct 42 ms 2772 KB Output is correct
12 Correct 41 ms 2784 KB Output is correct
13 Correct 43 ms 2768 KB Output is correct
14 Correct 49 ms 2784 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 4 ms 1492 KB Output is correct
4 Correct 13 ms 2004 KB Output is correct
5 Correct 32 ms 2404 KB Output is correct
6 Correct 41 ms 2732 KB Output is correct
7 Correct 37 ms 2732 KB Output is correct
8 Correct 43 ms 2780 KB Output is correct
9 Correct 43 ms 2768 KB Output is correct
10 Correct 42 ms 2760 KB Output is correct
11 Correct 42 ms 2772 KB Output is correct
12 Correct 41 ms 2784 KB Output is correct
13 Correct 43 ms 2768 KB Output is correct
14 Correct 49 ms 2784 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 1 ms 1472 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 3 ms 1492 KB Output is correct
19 Correct 17 ms 1980 KB Output is correct
20 Correct 34 ms 2400 KB Output is correct
21 Correct 48 ms 2788 KB Output is correct
22 Correct 54 ms 2776 KB Output is correct
23 Correct 62 ms 2764 KB Output is correct
24 Correct 51 ms 2788 KB Output is correct
25 Correct 50 ms 2784 KB Output is correct
26 Correct 50 ms 2784 KB Output is correct
27 Correct 47 ms 2788 KB Output is correct
28 Correct 58 ms 2788 KB Output is correct
29 Correct 58 ms 2684 KB Output is correct
30 Correct 51 ms 2748 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 4 ms 1492 KB Output is correct
4 Correct 13 ms 2004 KB Output is correct
5 Correct 32 ms 2404 KB Output is correct
6 Correct 41 ms 2732 KB Output is correct
7 Correct 37 ms 2732 KB Output is correct
8 Correct 43 ms 2780 KB Output is correct
9 Correct 43 ms 2768 KB Output is correct
10 Correct 42 ms 2760 KB Output is correct
11 Correct 42 ms 2772 KB Output is correct
12 Correct 41 ms 2784 KB Output is correct
13 Correct 43 ms 2768 KB Output is correct
14 Correct 49 ms 2784 KB Output is correct
15 Correct 43 ms 2764 KB Output is correct
16 Correct 1 ms 1472 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 3 ms 1492 KB Output is correct
19 Correct 17 ms 1980 KB Output is correct
20 Correct 34 ms 2400 KB Output is correct
21 Correct 48 ms 2788 KB Output is correct
22 Correct 54 ms 2776 KB Output is correct
23 Correct 62 ms 2764 KB Output is correct
24 Correct 51 ms 2788 KB Output is correct
25 Correct 50 ms 2784 KB Output is correct
26 Correct 50 ms 2784 KB Output is correct
27 Correct 47 ms 2788 KB Output is correct
28 Correct 58 ms 2788 KB Output is correct
29 Correct 58 ms 2684 KB Output is correct
30 Correct 51 ms 2748 KB Output is correct
31 Correct 1 ms 1468 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 1 ms 1492 KB Output is correct
34 Correct 4 ms 1484 KB Output is correct
35 Correct 4 ms 1492 KB Output is correct
36 Correct 4 ms 1492 KB Output is correct
37 Correct 20 ms 1840 KB Output is correct
38 Correct 17 ms 1748 KB Output is correct
39 Correct 37 ms 1960 KB Output is correct
40 Correct 70 ms 2456 KB Output is correct
41 Correct 104 ms 2816 KB Output is correct
42 Correct 110 ms 2812 KB Output is correct
43 Correct 132 ms 2804 KB Output is correct
44 Correct 109 ms 2800 KB Output is correct
45 Correct 112 ms 2764 KB Output is correct
46 Correct 102 ms 2812 KB Output is correct
47 Correct 111 ms 2808 KB Output is correct
48 Correct 119 ms 2768 KB Output is correct
49 Correct 104 ms 2792 KB Output is correct
50 Correct 103 ms 2808 KB Output is correct
51 Correct 123 ms 2808 KB Output is correct
52 Correct 109 ms 2816 KB Output is correct
53 Correct 103 ms 2816 KB Output is correct
54 Correct 103 ms 2808 KB Output is correct
55 Correct 109 ms 2928 KB Output is correct
56 Correct 115 ms 2876 KB Output is correct
57 Correct 127 ms 2812 KB Output is correct
58 Correct 107 ms 2764 KB Output is correct
59 Correct 103 ms 2804 KB Output is correct
60 Correct 113 ms 2792 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1468 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 4 ms 1492 KB Output is correct
14 Correct 13 ms 2004 KB Output is correct
15 Correct 32 ms 2404 KB Output is correct
16 Correct 41 ms 2732 KB Output is correct
17 Correct 37 ms 2732 KB Output is correct
18 Correct 43 ms 2780 KB Output is correct
19 Correct 43 ms 2768 KB Output is correct
20 Correct 42 ms 2760 KB Output is correct
21 Correct 42 ms 2772 KB Output is correct
22 Correct 41 ms 2784 KB Output is correct
23 Correct 43 ms 2768 KB Output is correct
24 Correct 49 ms 2784 KB Output is correct
25 Correct 43 ms 2764 KB Output is correct
26 Correct 1 ms 1472 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 3 ms 1492 KB Output is correct
29 Correct 17 ms 1980 KB Output is correct
30 Correct 34 ms 2400 KB Output is correct
31 Correct 48 ms 2788 KB Output is correct
32 Correct 54 ms 2776 KB Output is correct
33 Correct 62 ms 2764 KB Output is correct
34 Correct 51 ms 2788 KB Output is correct
35 Correct 50 ms 2784 KB Output is correct
36 Correct 50 ms 2784 KB Output is correct
37 Correct 47 ms 2788 KB Output is correct
38 Correct 58 ms 2788 KB Output is correct
39 Correct 58 ms 2684 KB Output is correct
40 Correct 51 ms 2748 KB Output is correct
41 Correct 1 ms 1468 KB Output is correct
42 Correct 2 ms 1492 KB Output is correct
43 Correct 1 ms 1492 KB Output is correct
44 Correct 4 ms 1484 KB Output is correct
45 Correct 4 ms 1492 KB Output is correct
46 Correct 4 ms 1492 KB Output is correct
47 Correct 20 ms 1840 KB Output is correct
48 Correct 17 ms 1748 KB Output is correct
49 Correct 37 ms 1960 KB Output is correct
50 Correct 70 ms 2456 KB Output is correct
51 Correct 104 ms 2816 KB Output is correct
52 Correct 110 ms 2812 KB Output is correct
53 Correct 132 ms 2804 KB Output is correct
54 Correct 109 ms 2800 KB Output is correct
55 Correct 112 ms 2764 KB Output is correct
56 Correct 102 ms 2812 KB Output is correct
57 Correct 111 ms 2808 KB Output is correct
58 Correct 119 ms 2768 KB Output is correct
59 Correct 104 ms 2792 KB Output is correct
60 Correct 103 ms 2808 KB Output is correct
61 Correct 123 ms 2808 KB Output is correct
62 Correct 109 ms 2816 KB Output is correct
63 Correct 103 ms 2816 KB Output is correct
64 Correct 103 ms 2808 KB Output is correct
65 Correct 109 ms 2928 KB Output is correct
66 Correct 115 ms 2876 KB Output is correct
67 Correct 127 ms 2812 KB Output is correct
68 Correct 107 ms 2764 KB Output is correct
69 Correct 103 ms 2804 KB Output is correct
70 Correct 113 ms 2792 KB Output is correct
71 Correct 22 ms 1820 KB Output is correct
72 Correct 17 ms 1748 KB Output is correct
73 Correct 16 ms 1836 KB Output is correct
74 Correct 16 ms 1768 KB Output is correct
75 Correct 16 ms 1804 KB Output is correct
76 Correct 30 ms 1972 KB Output is correct
77 Correct 30 ms 2020 KB Output is correct
78 Correct 29 ms 2012 KB Output is correct
79 Correct 29 ms 2012 KB Output is correct
80 Correct 31 ms 1968 KB Output is correct
81 Correct 61 ms 2356 KB Output is correct
82 Correct 62 ms 2380 KB Output is correct
83 Correct 72 ms 2284 KB Output is correct
84 Correct 59 ms 2400 KB Output is correct
85 Correct 62 ms 2468 KB Output is correct
86 Correct 58 ms 2512 KB Output is correct
87 Correct 54 ms 2396 KB Output is correct
88 Correct 53 ms 2404 KB Output is correct
89 Correct 55 ms 2408 KB Output is correct
90 Correct 58 ms 2404 KB Output is correct
91 Correct 65 ms 2764 KB Output is correct
92 Correct 59 ms 2792 KB Output is correct
93 Correct 58 ms 2696 KB Output is correct
94 Correct 61 ms 2804 KB Output is correct
95 Correct 61 ms 2724 KB Output is correct
96 Correct 53 ms 2764 KB Output is correct
97 Correct 51 ms 2704 KB Output is correct
98 Correct 54 ms 2748 KB Output is correct
99 Correct 49 ms 2740 KB Output is correct
100 Correct 49 ms 2720 KB Output is correct
101 Correct 49 ms 2744 KB Output is correct
102 Correct 59 ms 2788 KB Output is correct
103 Correct 62 ms 2792 KB Output is correct
104 Correct 49 ms 2792 KB Output is correct
105 Correct 49 ms 2684 KB Output is correct
106 Correct 45 ms 2752 KB Output is correct
107 Correct 47 ms 2680 KB Output is correct
108 Correct 42 ms 2684 KB Output is correct
109 Correct 43 ms 2768 KB Output is correct
110 Correct 57 ms 2784 KB Output is correct
111 Correct 44 ms 2764 KB Output is correct
112 Correct 43 ms 2732 KB Output is correct
113 Correct 43 ms 2764 KB Output is correct
114 Correct 45 ms 2748 KB Output is correct
115 Correct 48 ms 2720 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1468 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 4 ms 1492 KB Output is correct
14 Correct 13 ms 2004 KB Output is correct
15 Correct 32 ms 2404 KB Output is correct
16 Correct 41 ms 2732 KB Output is correct
17 Correct 37 ms 2732 KB Output is correct
18 Correct 43 ms 2780 KB Output is correct
19 Correct 43 ms 2768 KB Output is correct
20 Correct 42 ms 2760 KB Output is correct
21 Correct 42 ms 2772 KB Output is correct
22 Correct 41 ms 2784 KB Output is correct
23 Correct 43 ms 2768 KB Output is correct
24 Correct 49 ms 2784 KB Output is correct
25 Correct 43 ms 2764 KB Output is correct
26 Correct 1 ms 1472 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 3 ms 1492 KB Output is correct
29 Correct 17 ms 1980 KB Output is correct
30 Correct 34 ms 2400 KB Output is correct
31 Correct 48 ms 2788 KB Output is correct
32 Correct 54 ms 2776 KB Output is correct
33 Correct 62 ms 2764 KB Output is correct
34 Correct 51 ms 2788 KB Output is correct
35 Correct 50 ms 2784 KB Output is correct
36 Correct 50 ms 2784 KB Output is correct
37 Correct 47 ms 2788 KB Output is correct
38 Correct 58 ms 2788 KB Output is correct
39 Correct 58 ms 2684 KB Output is correct
40 Correct 51 ms 2748 KB Output is correct
41 Correct 1 ms 1468 KB Output is correct
42 Correct 2 ms 1492 KB Output is correct
43 Correct 1 ms 1492 KB Output is correct
44 Correct 4 ms 1484 KB Output is correct
45 Correct 4 ms 1492 KB Output is correct
46 Correct 4 ms 1492 KB Output is correct
47 Correct 20 ms 1840 KB Output is correct
48 Correct 17 ms 1748 KB Output is correct
49 Correct 37 ms 1960 KB Output is correct
50 Correct 70 ms 2456 KB Output is correct
51 Correct 104 ms 2816 KB Output is correct
52 Correct 110 ms 2812 KB Output is correct
53 Correct 132 ms 2804 KB Output is correct
54 Correct 109 ms 2800 KB Output is correct
55 Correct 112 ms 2764 KB Output is correct
56 Correct 102 ms 2812 KB Output is correct
57 Correct 111 ms 2808 KB Output is correct
58 Correct 119 ms 2768 KB Output is correct
59 Correct 104 ms 2792 KB Output is correct
60 Correct 103 ms 2808 KB Output is correct
61 Correct 123 ms 2808 KB Output is correct
62 Correct 109 ms 2816 KB Output is correct
63 Correct 103 ms 2816 KB Output is correct
64 Correct 103 ms 2808 KB Output is correct
65 Correct 109 ms 2928 KB Output is correct
66 Correct 115 ms 2876 KB Output is correct
67 Correct 127 ms 2812 KB Output is correct
68 Correct 107 ms 2764 KB Output is correct
69 Correct 103 ms 2804 KB Output is correct
70 Correct 113 ms 2792 KB Output is correct
71 Correct 22 ms 1820 KB Output is correct
72 Correct 17 ms 1748 KB Output is correct
73 Correct 16 ms 1836 KB Output is correct
74 Correct 16 ms 1768 KB Output is correct
75 Correct 16 ms 1804 KB Output is correct
76 Correct 30 ms 1972 KB Output is correct
77 Correct 30 ms 2020 KB Output is correct
78 Correct 29 ms 2012 KB Output is correct
79 Correct 29 ms 2012 KB Output is correct
80 Correct 31 ms 1968 KB Output is correct
81 Correct 61 ms 2356 KB Output is correct
82 Correct 62 ms 2380 KB Output is correct
83 Correct 72 ms 2284 KB Output is correct
84 Correct 59 ms 2400 KB Output is correct
85 Correct 62 ms 2468 KB Output is correct
86 Correct 58 ms 2512 KB Output is correct
87 Correct 54 ms 2396 KB Output is correct
88 Correct 53 ms 2404 KB Output is correct
89 Correct 55 ms 2408 KB Output is correct
90 Correct 58 ms 2404 KB Output is correct
91 Correct 65 ms 2764 KB Output is correct
92 Correct 59 ms 2792 KB Output is correct
93 Correct 58 ms 2696 KB Output is correct
94 Correct 61 ms 2804 KB Output is correct
95 Correct 61 ms 2724 KB Output is correct
96 Correct 53 ms 2764 KB Output is correct
97 Correct 51 ms 2704 KB Output is correct
98 Correct 54 ms 2748 KB Output is correct
99 Correct 49 ms 2740 KB Output is correct
100 Correct 49 ms 2720 KB Output is correct
101 Correct 49 ms 2744 KB Output is correct
102 Correct 59 ms 2788 KB Output is correct
103 Correct 62 ms 2792 KB Output is correct
104 Correct 49 ms 2792 KB Output is correct
105 Correct 49 ms 2684 KB Output is correct
106 Correct 45 ms 2752 KB Output is correct
107 Correct 47 ms 2680 KB Output is correct
108 Correct 42 ms 2684 KB Output is correct
109 Correct 43 ms 2768 KB Output is correct
110 Correct 57 ms 2784 KB Output is correct
111 Correct 44 ms 2764 KB Output is correct
112 Correct 43 ms 2732 KB Output is correct
113 Correct 43 ms 2764 KB Output is correct
114 Correct 45 ms 2748 KB Output is correct
115 Correct 48 ms 2720 KB Output is correct
116 Correct 1275 ms 3020 KB Output is correct
117 Correct 1618 ms 3020 KB Output is correct
118 Correct 2642 ms 3312 KB Output is correct
119 Correct 3498 ms 3328 KB Output is correct
120 Correct 3172 ms 3268 KB Output is correct
121 Execution timed out 7033 ms 3008 KB Time limit exceeded
122 Halted 0 ms 0 KB -