oj.uz

답안 #696868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
696868 2023-02-07T13:30:58 Z cig32 Diversity (CEOI21_diversity) C++14
22 / 100
 7000 ms 6300 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
 
int f[MAXN], ans, n, sum1all, sum2all;
 
int bit1[778];
void add1(int x, int v) {
  sum1all += v;
  for(;x<778;x+=x&-x) bit1[x] += v;
}
int sum1(int x) {
  int s=0;
  for(;x;x-=x&-x) s += bit1[x];
  return s;
}
int bit2[778];
void add2(int x, int v) {
  sum2all += v;
  for(;x<778;x+=x&-x) bit2[x] += v;
}
int sum2(int x) {
  int s=0;
  for(;x;x-=x&-x) s += bit2[x];
  return s;
}
int bit3[MAXN];
void add3(int x, int v) {
  x++;
  for(;x<MAXN;x+=x&-x) bit3[x] += v;
}
int sum3(int x) {
  x++;
  int s=0;
  for(;x;x-=x&-x) s += bit3[x];
  return s;
}
void edit(int i, int x) {
  int cal1 = sum1(i), cal2 = sum2(i);
  ans -= (cal1 - f[i]) * f[i] * i;
  ans += (cal2 - f[i] * (i-1)) * f[i];
  ans -= f[i] * (sum2all - cal2 + sum1all - cal1);
  ans += f[i] * (i-1) * (sum1all - cal1);
  add1(i, x-f[i]);
  add2(i, (x-f[i]) * (i-1));
  ans -= f[i] * (f[i] + 1) / 2;
  f[i] = x;
  ans += f[i] * (f[i] + 1) / 2;
  cal1 += x-f[i];
  cal2 += (x-f[i]) * (i-1);
  ans += (cal1 - f[i]) * f[i] * i;
  ans -= (cal2 - f[i] * (i-1)) * f[i];
  ans += f[i] * (sum2all - cal2 + sum1all - cal1);
  ans -= f[i] * (i-1) * (sum1all - cal1);
}
int block;
bool modui(pair<pair<int,int>,int> a, pair<pair<int,int>,int> b) {
  if(a.first.first / block != b.first.first / block) return a.first.first / block < b.first.first / block;
  return a.first.second < b.first.second;
}
void solve(int tc) {
  int q;
  cin >> n >> q;
  int c = 300000;
  block = ceil(sqrt(c));
  int arr[n+1];
  for(int i=1; i<=n; i++) cin >> arr[i];
  pair<pair<int,int>,int> qry[q+1];
  for(int i=1; i<=q; i++) {
    cin >> qry[i].first.first >> qry[i].first.second;
    qry[i].second = i;
  }
  sort(qry+1, qry+q+1, modui);
  int res[q+1];
  int l = qry[1].first.first, r = qry[1].first.first - 1;
  int freq[c+1];
  for(int i=1; i<=c; i++) freq[i] = 0;
  add3(0, n);
  for(int i=1; i<=q; i++) {
    while(l > qry[i].first.first) {
      l--;
      add3(freq[arr[l]], -1);
      freq[arr[l]]++;
      add3(freq[arr[l]], 1);
      int rank = sum3(freq[arr[l]] - 1) + 1;
      int invrank = n - rank + 1;
      rank = 776 - invrank;
      int pos = (rank & 1 ? (rank + 1) / 2 : 776 - rank / 2);
      edit(pos, freq[arr[l]]);
    }
    while(r > qry[i].first.second) {
      add3(freq[arr[r]], -1);
      freq[arr[r]]--;
      add3(freq[arr[r]], 1);
      int rank = sum3(freq[arr[r]]);
      int invrank = n - rank + 1;
      rank = 776 - invrank;
      int pos = (rank & 1 ? (rank + 1) / 2 : 776 - rank / 2);
      edit(pos, freq[arr[r]]);
      r--;
    }
    while(r < qry[i].first.second) {
      r++;
      add3(freq[arr[r]], -1);
      freq[arr[r]]++;
      add3(freq[arr[r]], 1);
      int rank = sum3(freq[arr[r]] - 1) + 1;
      int invrank = n - rank + 1;
      rank = 776 - invrank;
      int pos = (rank & 1 ? (rank + 1) / 2 : 776 - rank / 2);
      edit(pos, freq[arr[r]]);
    }
    while(l < qry[i].first.first) {
      add3(freq[arr[l]], -1);
      freq[arr[l]]--;
      add3(freq[arr[l]], 1);
      int rank = sum3(freq[arr[l]]);
      int invrank = n - rank + 1;
      rank = 776 - invrank;
      int pos = (rank & 1 ? (rank + 1) / 2 : 776 - rank / 2);
      edit(pos, freq[arr[l]]);
      l++;
    }
    res[qry[i].second] = ans;
  }
  for(int i=1; i<=q; i++) cout << res[i] << "\n";
 
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2740 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 17 ms 3668 KB Output is correct
5 Correct 32 ms 4748 KB Output is correct
6 Correct 46 ms 5496 KB Output is correct
7 Correct 44 ms 6300 KB Output is correct
8 Correct 46 ms 5420 KB Output is correct
9 Correct 43 ms 5360 KB Output is correct
10 Correct 53 ms 5764 KB Output is correct
11 Correct 44 ms 5528 KB Output is correct
12 Correct 47 ms 5492 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 42 ms 5608 KB Output is correct
15 Correct 42 ms 5488 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 17 ms 3668 KB Output is correct
5 Correct 32 ms 4748 KB Output is correct
6 Correct 46 ms 5496 KB Output is correct
7 Correct 44 ms 6300 KB Output is correct
8 Correct 46 ms 5420 KB Output is correct
9 Correct 43 ms 5360 KB Output is correct
10 Correct 53 ms 5764 KB Output is correct
11 Correct 44 ms 5528 KB Output is correct
12 Correct 47 ms 5492 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 42 ms 5608 KB Output is correct
15 Correct 42 ms 5488 KB Output is correct
16 Correct 1 ms 2632 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 17 ms 3668 KB Output is correct
20 Correct 31 ms 4468 KB Output is correct
21 Correct 47 ms 5452 KB Output is correct
22 Correct 48 ms 5324 KB Output is correct
23 Correct 45 ms 5432 KB Output is correct
24 Correct 51 ms 5292 KB Output is correct
25 Correct 45 ms 5344 KB Output is correct
26 Correct 45 ms 5256 KB Output is correct
27 Correct 44 ms 5332 KB Output is correct
28 Correct 44 ms 5580 KB Output is correct
29 Correct 47 ms 5344 KB Output is correct
30 Correct 47 ms 5388 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 17 ms 3668 KB Output is correct
5 Correct 32 ms 4748 KB Output is correct
6 Correct 46 ms 5496 KB Output is correct
7 Correct 44 ms 6300 KB Output is correct
8 Correct 46 ms 5420 KB Output is correct
9 Correct 43 ms 5360 KB Output is correct
10 Correct 53 ms 5764 KB Output is correct
11 Correct 44 ms 5528 KB Output is correct
12 Correct 47 ms 5492 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 42 ms 5608 KB Output is correct
15 Correct 42 ms 5488 KB Output is correct
16 Correct 1 ms 2632 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 17 ms 3668 KB Output is correct
20 Correct 31 ms 4468 KB Output is correct
21 Correct 47 ms 5452 KB Output is correct
22 Correct 48 ms 5324 KB Output is correct
23 Correct 45 ms 5432 KB Output is correct
24 Correct 51 ms 5292 KB Output is correct
25 Correct 45 ms 5344 KB Output is correct
26 Correct 45 ms 5256 KB Output is correct
27 Correct 44 ms 5332 KB Output is correct
28 Correct 44 ms 5580 KB Output is correct
29 Correct 47 ms 5344 KB Output is correct
30 Correct 47 ms 5388 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 3 ms 2772 KB Output is correct
35 Correct 4 ms 2772 KB Output is correct
36 Execution timed out 7064 ms 2772 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2740 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 17 ms 3668 KB Output is correct
15 Correct 32 ms 4748 KB Output is correct
16 Correct 46 ms 5496 KB Output is correct
17 Correct 44 ms 6300 KB Output is correct
18 Correct 46 ms 5420 KB Output is correct
19 Correct 43 ms 5360 KB Output is correct
20 Correct 53 ms 5764 KB Output is correct
21 Correct 44 ms 5528 KB Output is correct
22 Correct 47 ms 5492 KB Output is correct
23 Correct 48 ms 5464 KB Output is correct
24 Correct 42 ms 5608 KB Output is correct
25 Correct 42 ms 5488 KB Output is correct
26 Correct 1 ms 2632 KB Output is correct
27 Correct 1 ms 2644 KB Output is correct
28 Correct 3 ms 2772 KB Output is correct
29 Correct 17 ms 3668 KB Output is correct
30 Correct 31 ms 4468 KB Output is correct
31 Correct 47 ms 5452 KB Output is correct
32 Correct 48 ms 5324 KB Output is correct
33 Correct 45 ms 5432 KB Output is correct
34 Correct 51 ms 5292 KB Output is correct
35 Correct 45 ms 5344 KB Output is correct
36 Correct 45 ms 5256 KB Output is correct
37 Correct 44 ms 5332 KB Output is correct
38 Correct 44 ms 5580 KB Output is correct
39 Correct 47 ms 5344 KB Output is correct
40 Correct 47 ms 5388 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 3 ms 2772 KB Output is correct
45 Correct 4 ms 2772 KB Output is correct
46 Execution timed out 7064 ms 2772 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2740 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 17 ms 3668 KB Output is correct
15 Correct 32 ms 4748 KB Output is correct
16 Correct 46 ms 5496 KB Output is correct
17 Correct 44 ms 6300 KB Output is correct
18 Correct 46 ms 5420 KB Output is correct
19 Correct 43 ms 5360 KB Output is correct
20 Correct 53 ms 5764 KB Output is correct
21 Correct 44 ms 5528 KB Output is correct
22 Correct 47 ms 5492 KB Output is correct
23 Correct 48 ms 5464 KB Output is correct
24 Correct 42 ms 5608 KB Output is correct
25 Correct 42 ms 5488 KB Output is correct
26 Correct 1 ms 2632 KB Output is correct
27 Correct 1 ms 2644 KB Output is correct
28 Correct 3 ms 2772 KB Output is correct
29 Correct 17 ms 3668 KB Output is correct
30 Correct 31 ms 4468 KB Output is correct
31 Correct 47 ms 5452 KB Output is correct
32 Correct 48 ms 5324 KB Output is correct
33 Correct 45 ms 5432 KB Output is correct
34 Correct 51 ms 5292 KB Output is correct
35 Correct 45 ms 5344 KB Output is correct
36 Correct 45 ms 5256 KB Output is correct
37 Correct 44 ms 5332 KB Output is correct
38 Correct 44 ms 5580 KB Output is correct
39 Correct 47 ms 5344 KB Output is correct
40 Correct 47 ms 5388 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 3 ms 2772 KB Output is correct
45 Correct 4 ms 2772 KB Output is correct
46 Execution timed out 7064 ms 2772 KB Time limit exceeded
47 Halted 0 ms 0 KB -