oj.uz

Submission #817123

# Submission time Handle Problem Language Result Execution time Memory
817123 2023-08-09T09:41:05 Z gun_gan Ekoeko (COCI21_ekoeko) C++17
110 / 110
 13 ms 4140 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 2e5 + 5;
int N;
string S;
int curCnt[26], totCnt[26], pos[26][MX];
vector<int> a;

struct fw {
      int t[MX];
      void upd(int x, int val) {
            for(int i = x; i <= N; i += i & -i) t[i] += val;
      } 
      int que(int x) {
            int res = 0;
            for(int i = x; i > 0; i -= i & -i) res += t[i];
            return res;
      }
      int que(int l, int r) {
            return que(r) - que(l - 1);
      }

      void reset() {
            for(int i = 0; i < MX; i++) t[i] = 0;
      }
} ft;

int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);

      cin >> N >> S;
      for(auto x : S) a.push_back(x - 'a');

      for(auto x : a)
            totCnt[x]++;

      int i = 0, r = 0;
      vector<pair<int,int>> v;

      ll ans = 0;
      for(auto x : a) {
            if(curCnt[x] < totCnt[x] / 2) {
                  pos[x][curCnt[x]] = i;
                  ans += r;
            } else {
                  pos[x][curCnt[x]] = i;
                  v.push_back({pos[x][curCnt[x] - totCnt[x] / 2], r});
                  r++;
            }
            curCnt[x]++;
            i++;
      }

      sort(v.begin(), v.end());

      ft.reset();

      for(auto [l, r] : v) {
            ans += ft.que(r + 1, N);
            ft.upd(r + 1, 1);
      }      

      cout << ans << '\n';

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 4 ms 2256 KB Output is correct
3 Correct 6 ms 3156 KB Output is correct
4 Correct 7 ms 3928 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 4 ms 2256 KB Output is correct
3 Correct 6 ms 3156 KB Output is correct
4 Correct 7 ms 3928 KB Output is correct
5 Correct 1 ms 1104 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 4 ms 2256 KB Output is correct
3 Correct 6 ms 3156 KB Output is correct
4 Correct 7 ms 3928 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 11 ms 4140 KB Output is correct
7 Correct 12 ms 4112 KB Output is correct
8 Correct 12 ms 4060 KB Output is correct
9 Correct 12 ms 4064 KB Output is correct
10 Correct 12 ms 3940 KB Output is correct
11 Correct 11 ms 3936 KB Output is correct
12 Correct 12 ms 3860 KB Output is correct
13 Correct 11 ms 3852 KB Output is correct
14 Correct 11 ms 3808 KB Output is correct
15 Correct 13 ms 3884 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1232 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1232 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 4 ms 2256 KB Output is correct
3 Correct 6 ms 3156 KB Output is correct
4 Correct 7 ms 3928 KB Output is correct
5 Correct 1 ms 1104 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 11 ms 4140 KB Output is correct
11 Correct 12 ms 4112 KB Output is correct
12 Correct 12 ms 4060 KB Output is correct
13 Correct 12 ms 4064 KB Output is correct
14 Correct 12 ms 3940 KB Output is correct
15 Correct 11 ms 3936 KB Output is correct
16 Correct 12 ms 3860 KB Output is correct
17 Correct 11 ms 3852 KB Output is correct
18 Correct 11 ms 3808 KB Output is correct
19 Correct 13 ms 3884 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 1 ms 1236 KB Output is correct
25 Correct 1 ms 1236 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 1 ms 1236 KB Output is correct
28 Correct 1 ms 1232 KB Output is correct
29 Correct 1 ms 1228 KB Output is correct
30 Correct 1 ms 1232 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 12 ms 4048 KB Output is correct
33 Correct 12 ms 4056 KB Output is correct
34 Correct 12 ms 4044 KB Output is correct
35 Correct 12 ms 4040 KB Output is correct
36 Correct 12 ms 3932 KB Output is correct
37 Correct 11 ms 4016 KB Output is correct
38 Correct 11 ms 3932 KB Output is correct
39 Correct 11 ms 3940 KB Output is correct
40 Correct 12 ms 3800 KB Output is correct
41 Correct 11 ms 3800 KB Output is correct