oj.uz

Submission #827664

# Submission time Handle Problem Language Result Execution time Memory
827664 2023-08-16T16:06:55 Z NeroZein Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 7012 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;
 
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int B = 350;
const int N = 3e5 + 5;
 
int a[N]; 
int freq[N];
int tot_freq[N];
int cnt_freq[B + 1];
long long prop_ps[N];
vector<int> large_vals;
 
inline int64_t hilbertOrder(int x, int y, int pow, int rotate) {
  if (pow == 0) {
    return 0;
  }
  int hpow = 1 << (pow - 1);
  int seg = (x < hpow) ? ((y < hpow) ? 0 : 3) : ((y < hpow) ? 1 : 2);
  seg = (seg + rotate) & 3;
  const int rotateDelta[4] = {3, 0, 0, 1};
  int nx = x & (x ^ hpow), ny = y & (y ^ hpow);
  int nrot = (rotate + rotateDelta[seg]) & 3;
  int64_t subSquareSize = int64_t(1) << (2 * pow - 2);
  int64_t ans = seg * subSquareSize;
  int64_t add = hilbertOrder(nx, ny, pow - 1, nrot);
  ans += (seg == 1 || seg == 2) ? add : (subSquareSize - add - 1);
  return ans;
}
 
struct Query{
  int l, r, id; 
  int64_t ord;
  inline void calcOrder() {
    ord = hilbertOrder(l, r, 18, 0);
  }
};
 
inline bool operator<(const Query &x, const Query &y){
  return x.ord < y.ord;
}
 
void modify(int i, int v) {
  if (freq[a[i]] && tot_freq[a[i]] <= B) {
    cnt_freq[freq[a[i]]]--;
  }
  freq[a[i]] += v;
  if (freq[a[i]] && tot_freq[a[i]] <= B) {
    cnt_freq[freq[a[i]]]++;
  } 
}
 
vector<pair<int, int>> construct() {
  vector<pair<int, int>> left;
  vector<pair<int, int>> right;
  bool go_left = true;
  vector<pair<int, int>> xz;
  for (int i = 1; i <= B; ++i) {
    if (cnt_freq[i]) {
      xz.push_back({i, cnt_freq[i]}); 
    }
  }
  for (int i : large_vals) {
    if (freq[i]) {
      xz.push_back({freq[i], 1}); 
    }
  }
  sort(xz.begin(), xz.end());
  for (auto [i, z] : xz) {
    int x = z / 2;
    int y = z - x;
    if ((x + y) % 2 == 0) {
      left.push_back({i, x});
      right.push_back({i, x});
    } else {
      if (go_left) {
        left.push_back({i, y});
        if (x) {
          right.push_back({i, x});    
        }
      } else {
        if (x) {
          left.push_back({i, x});     
        }
        right.push_back({i, y}); 
      }
      go_left ^= 1;
    }
  }
  vector<pair<int, int>> ret = left; 
  reverse(right.begin(), right.end()); 
  for (auto [x, y] : right) {
    if (ret.back().first == x) {
      ret.back().second += y;
    } else {
      ret.push_back({x, y});      
    }
  }
  return ret;
}
 
long long prop(int x) {
  return (long long) x * (x + 1) / 2; 
}
 
long long get(vector<pair<int, int>> v) {
  long long last = 0;
  long long ret = 0; 
  long long without = 0; 
  long long normal_sum = 0;
  long long times_freq_sum = 0; 
  for (int i = (int) v.size() - 1; i >= 0; --i) {
    long long tmp = 0; 
    auto [element_freq, rep] = v[i];
    long long z = rep - 1; 
    tmp += element_freq * z * (z + 1) * (z + 2) / 6 * element_freq;
    tmp += last * element_freq * rep; 
    tmp += normal_sum * element_freq * rep * (rep + 1) / 2;
    last = (rep - 1) * rep / 2 * element_freq + last + normal_sum * rep;
    ret += tmp; 
    times_freq_sum += without * rep + prop(rep) * element_freq; 
    without += prop(rep) * element_freq;
    normal_sum += v[i].first * v[i].second; 
  }
  ret += prop(normal_sum); 
  return ret;
}
 
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    tot_freq[a[i]]++; 
  }
  for (int i = 1; i < N; ++i) {
    if (tot_freq[i] > B) {
      large_vals.push_back(i); 
    }
  }
  vector<Query> qs(q); 
  for (int i = 0; i < q; ++i) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    qs[i].l = l, qs[i].r = r;
    qs[i].id = i;
    qs[i].calcOrder(); 
  }
  vector<long long> ans(q); 
  int l = 0, r = -1; 
  for (auto &pq : qs) {
    int ql = pq.l, qr = pq.r, id = pq.id;
    while (l > ql) modify(--l, 1);
    while (r < qr) modify(++r, 1);
    while (l < ql) modify(l++, -1);
    while (r > qr) modify(r--, -1); 
    vector<pair<int, int>> v = construct(); 
    ans[id] = get(v);
  }
  for (int i = 0; i < q; ++i) {
    cout << ans[i] << '\n';
  }
  return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 264 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 13 ms 2680 KB Output is correct
8 Correct 13 ms 2620 KB Output is correct
9 Correct 21 ms 2620 KB Output is correct
10 Correct 15 ms 2688 KB Output is correct
11 Correct 13 ms 2644 KB Output is correct
12 Correct 14 ms 2648 KB Output is correct
13 Correct 13 ms 2632 KB Output is correct
14 Correct 19 ms 2616 KB Output is correct
15 Correct 14 ms 2644 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 13 ms 2680 KB Output is correct
8 Correct 13 ms 2620 KB Output is correct
9 Correct 21 ms 2620 KB Output is correct
10 Correct 15 ms 2688 KB Output is correct
11 Correct 13 ms 2644 KB Output is correct
12 Correct 14 ms 2648 KB Output is correct
13 Correct 13 ms 2632 KB Output is correct
14 Correct 19 ms 2616 KB Output is correct
15 Correct 14 ms 2644 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 7 ms 1108 KB Output is correct
20 Correct 11 ms 1924 KB Output is correct
21 Correct 14 ms 2704 KB Output is correct
22 Correct 15 ms 2684 KB Output is correct
23 Correct 23 ms 2592 KB Output is correct
24 Correct 23 ms 2692 KB Output is correct
25 Correct 14 ms 2644 KB Output is correct
26 Correct 15 ms 2644 KB Output is correct
27 Correct 14 ms 2612 KB Output is correct
28 Correct 14 ms 2644 KB Output is correct
29 Correct 14 ms 2644 KB Output is correct
30 Correct 14 ms 2696 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 13 ms 2680 KB Output is correct
8 Correct 13 ms 2620 KB Output is correct
9 Correct 21 ms 2620 KB Output is correct
10 Correct 15 ms 2688 KB Output is correct
11 Correct 13 ms 2644 KB Output is correct
12 Correct 14 ms 2648 KB Output is correct
13 Correct 13 ms 2632 KB Output is correct
14 Correct 19 ms 2616 KB Output is correct
15 Correct 14 ms 2644 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 7 ms 1108 KB Output is correct
20 Correct 11 ms 1924 KB Output is correct
21 Correct 14 ms 2704 KB Output is correct
22 Correct 15 ms 2684 KB Output is correct
23 Correct 23 ms 2592 KB Output is correct
24 Correct 23 ms 2692 KB Output is correct
25 Correct 14 ms 2644 KB Output is correct
26 Correct 15 ms 2644 KB Output is correct
27 Correct 14 ms 2612 KB Output is correct
28 Correct 14 ms 2644 KB Output is correct
29 Correct 14 ms 2644 KB Output is correct
30 Correct 14 ms 2696 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 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 3 ms 724 KB Output is correct
38 Correct 3 ms 724 KB Output is correct
39 Correct 6 ms 1108 KB Output is correct
40 Correct 12 ms 1924 KB Output is correct
41 Correct 17 ms 2644 KB Output is correct
42 Correct 17 ms 2704 KB Output is correct
43 Correct 17 ms 2772 KB Output is correct
44 Correct 17 ms 2644 KB Output is correct
45 Correct 17 ms 2772 KB Output is correct
46 Correct 17 ms 2696 KB Output is correct
47 Correct 17 ms 2696 KB Output is correct
48 Correct 17 ms 2644 KB Output is correct
49 Correct 18 ms 2732 KB Output is correct
50 Correct 20 ms 2752 KB Output is correct
51 Correct 21 ms 2732 KB Output is correct
52 Correct 19 ms 2772 KB Output is correct
53 Correct 21 ms 2716 KB Output is correct
54 Correct 20 ms 2656 KB Output is correct
55 Correct 19 ms 2668 KB Output is correct
56 Correct 18 ms 2772 KB Output is correct
57 Correct 17 ms 2644 KB Output is correct
58 Correct 17 ms 2692 KB Output is correct
59 Correct 17 ms 2720 KB Output is correct
60 Correct 22 ms 2732 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 264 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 9 ms 1876 KB Output is correct
16 Correct 14 ms 2652 KB Output is correct
17 Correct 13 ms 2680 KB Output is correct
18 Correct 13 ms 2620 KB Output is correct
19 Correct 21 ms 2620 KB Output is correct
20 Correct 15 ms 2688 KB Output is correct
21 Correct 13 ms 2644 KB Output is correct
22 Correct 14 ms 2648 KB Output is correct
23 Correct 13 ms 2632 KB Output is correct
24 Correct 19 ms 2616 KB Output is correct
25 Correct 14 ms 2644 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 7 ms 1108 KB Output is correct
30 Correct 11 ms 1924 KB Output is correct
31 Correct 14 ms 2704 KB Output is correct
32 Correct 15 ms 2684 KB Output is correct
33 Correct 23 ms 2592 KB Output is correct
34 Correct 23 ms 2692 KB Output is correct
35 Correct 14 ms 2644 KB Output is correct
36 Correct 15 ms 2644 KB Output is correct
37 Correct 14 ms 2612 KB Output is correct
38 Correct 14 ms 2644 KB Output is correct
39 Correct 14 ms 2644 KB Output is correct
40 Correct 14 ms 2696 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 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 6 ms 1108 KB Output is correct
50 Correct 12 ms 1924 KB Output is correct
51 Correct 17 ms 2644 KB Output is correct
52 Correct 17 ms 2704 KB Output is correct
53 Correct 17 ms 2772 KB Output is correct
54 Correct 17 ms 2644 KB Output is correct
55 Correct 17 ms 2772 KB Output is correct
56 Correct 17 ms 2696 KB Output is correct
57 Correct 17 ms 2696 KB Output is correct
58 Correct 17 ms 2644 KB Output is correct
59 Correct 18 ms 2732 KB Output is correct
60 Correct 20 ms 2752 KB Output is correct
61 Correct 21 ms 2732 KB Output is correct
62 Correct 19 ms 2772 KB Output is correct
63 Correct 21 ms 2716 KB Output is correct
64 Correct 20 ms 2656 KB Output is correct
65 Correct 19 ms 2668 KB Output is correct
66 Correct 18 ms 2772 KB Output is correct
67 Correct 17 ms 2644 KB Output is correct
68 Correct 17 ms 2692 KB Output is correct
69 Correct 17 ms 2720 KB Output is correct
70 Correct 22 ms 2732 KB Output is correct
71 Correct 4 ms 724 KB Output is correct
72 Correct 4 ms 724 KB Output is correct
73 Correct 4 ms 724 KB Output is correct
74 Correct 4 ms 724 KB Output is correct
75 Correct 4 ms 724 KB Output is correct
76 Correct 7 ms 1164 KB Output is correct
77 Correct 10 ms 1236 KB Output is correct
78 Correct 6 ms 1168 KB Output is correct
79 Correct 7 ms 1236 KB Output is correct
80 Correct 8 ms 1116 KB Output is correct
81 Correct 13 ms 1996 KB Output is correct
82 Correct 12 ms 2080 KB Output is correct
83 Correct 12 ms 2000 KB Output is correct
84 Correct 13 ms 1976 KB Output is correct
85 Correct 12 ms 2004 KB Output is correct
86 Correct 16 ms 2196 KB Output is correct
87 Correct 16 ms 2180 KB Output is correct
88 Correct 14 ms 2224 KB Output is correct
89 Correct 13 ms 2236 KB Output is correct
90 Correct 16 ms 2168 KB Output is correct
91 Correct 22 ms 4180 KB Output is correct
92 Correct 22 ms 4184 KB Output is correct
93 Correct 27 ms 4156 KB Output is correct
94 Correct 22 ms 4308 KB Output is correct
95 Correct 22 ms 4240 KB Output is correct
96 Correct 43 ms 5712 KB Output is correct
97 Correct 27 ms 5780 KB Output is correct
98 Correct 27 ms 5788 KB Output is correct
99 Correct 27 ms 5820 KB Output is correct
100 Correct 30 ms 5800 KB Output is correct
101 Correct 35 ms 5776 KB Output is correct
102 Correct 29 ms 5716 KB Output is correct
103 Correct 30 ms 6076 KB Output is correct
104 Correct 35 ms 5964 KB Output is correct
105 Correct 29 ms 6044 KB Output is correct
106 Correct 44 ms 6816 KB Output is correct
107 Correct 36 ms 6732 KB Output is correct
108 Correct 33 ms 6892 KB Output is correct
109 Correct 25 ms 6884 KB Output is correct
110 Correct 28 ms 6940 KB Output is correct
111 Correct 25 ms 6900 KB Output is correct
112 Correct 29 ms 6896 KB Output is correct
113 Correct 42 ms 6988 KB Output is correct
114 Correct 39 ms 6860 KB Output is correct
115 Correct 45 ms 7012 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 264 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 9 ms 1876 KB Output is correct
16 Correct 14 ms 2652 KB Output is correct
17 Correct 13 ms 2680 KB Output is correct
18 Correct 13 ms 2620 KB Output is correct
19 Correct 21 ms 2620 KB Output is correct
20 Correct 15 ms 2688 KB Output is correct
21 Correct 13 ms 2644 KB Output is correct
22 Correct 14 ms 2648 KB Output is correct
23 Correct 13 ms 2632 KB Output is correct
24 Correct 19 ms 2616 KB Output is correct
25 Correct 14 ms 2644 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 7 ms 1108 KB Output is correct
30 Correct 11 ms 1924 KB Output is correct
31 Correct 14 ms 2704 KB Output is correct
32 Correct 15 ms 2684 KB Output is correct
33 Correct 23 ms 2592 KB Output is correct
34 Correct 23 ms 2692 KB Output is correct
35 Correct 14 ms 2644 KB Output is correct
36 Correct 15 ms 2644 KB Output is correct
37 Correct 14 ms 2612 KB Output is correct
38 Correct 14 ms 2644 KB Output is correct
39 Correct 14 ms 2644 KB Output is correct
40 Correct 14 ms 2696 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 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 468 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 6 ms 1108 KB Output is correct
50 Correct 12 ms 1924 KB Output is correct
51 Correct 17 ms 2644 KB Output is correct
52 Correct 17 ms 2704 KB Output is correct
53 Correct 17 ms 2772 KB Output is correct
54 Correct 17 ms 2644 KB Output is correct
55 Correct 17 ms 2772 KB Output is correct
56 Correct 17 ms 2696 KB Output is correct
57 Correct 17 ms 2696 KB Output is correct
58 Correct 17 ms 2644 KB Output is correct
59 Correct 18 ms 2732 KB Output is correct
60 Correct 20 ms 2752 KB Output is correct
61 Correct 21 ms 2732 KB Output is correct
62 Correct 19 ms 2772 KB Output is correct
63 Correct 21 ms 2716 KB Output is correct
64 Correct 20 ms 2656 KB Output is correct
65 Correct 19 ms 2668 KB Output is correct
66 Correct 18 ms 2772 KB Output is correct
67 Correct 17 ms 2644 KB Output is correct
68 Correct 17 ms 2692 KB Output is correct
69 Correct 17 ms 2720 KB Output is correct
70 Correct 22 ms 2732 KB Output is correct
71 Correct 4 ms 724 KB Output is correct
72 Correct 4 ms 724 KB Output is correct
73 Correct 4 ms 724 KB Output is correct
74 Correct 4 ms 724 KB Output is correct
75 Correct 4 ms 724 KB Output is correct
76 Correct 7 ms 1164 KB Output is correct
77 Correct 10 ms 1236 KB Output is correct
78 Correct 6 ms 1168 KB Output is correct
79 Correct 7 ms 1236 KB Output is correct
80 Correct 8 ms 1116 KB Output is correct
81 Correct 13 ms 1996 KB Output is correct
82 Correct 12 ms 2080 KB Output is correct
83 Correct 12 ms 2000 KB Output is correct
84 Correct 13 ms 1976 KB Output is correct
85 Correct 12 ms 2004 KB Output is correct
86 Correct 16 ms 2196 KB Output is correct
87 Correct 16 ms 2180 KB Output is correct
88 Correct 14 ms 2224 KB Output is correct
89 Correct 13 ms 2236 KB Output is correct
90 Correct 16 ms 2168 KB Output is correct
91 Correct 22 ms 4180 KB Output is correct
92 Correct 22 ms 4184 KB Output is correct
93 Correct 27 ms 4156 KB Output is correct
94 Correct 22 ms 4308 KB Output is correct
95 Correct 22 ms 4240 KB Output is correct
96 Correct 43 ms 5712 KB Output is correct
97 Correct 27 ms 5780 KB Output is correct
98 Correct 27 ms 5788 KB Output is correct
99 Correct 27 ms 5820 KB Output is correct
100 Correct 30 ms 5800 KB Output is correct
101 Correct 35 ms 5776 KB Output is correct
102 Correct 29 ms 5716 KB Output is correct
103 Correct 30 ms 6076 KB Output is correct
104 Correct 35 ms 5964 KB Output is correct
105 Correct 29 ms 6044 KB Output is correct
106 Correct 44 ms 6816 KB Output is correct
107 Correct 36 ms 6732 KB Output is correct
108 Correct 33 ms 6892 KB Output is correct
109 Correct 25 ms 6884 KB Output is correct
110 Correct 28 ms 6940 KB Output is correct
111 Correct 25 ms 6900 KB Output is correct
112 Correct 29 ms 6896 KB Output is correct
113 Correct 42 ms 6988 KB Output is correct
114 Correct 39 ms 6860 KB Output is correct
115 Correct 45 ms 7012 KB Output is correct
116 Correct 1803 ms 3324 KB Output is correct
117 Correct 1050 ms 3344 KB Output is correct
118 Correct 5402 ms 3772 KB Output is correct
119 Correct 5535 ms 3952 KB Output is correct
120 Correct 3969 ms 4072 KB Output is correct
121 Execution timed out 7049 ms 3952 KB Time limit exceeded
122 Halted 0 ms 0 KB -