fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b) {
  14.     int x = 1;
  15.     a %= M;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % M; 
  18.         a = (a * a) % M;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31.  
  32. int consistency(int n, int k){
  33.  
  34.     int l = (k-1)/2;
  35.     int r = k/2;
  36.  
  37.     int ans = 0;
  38.  
  39.     int rows = n/k;
  40.  
  41.     while(l>=0 && r<k){
  42.         vector<int> leftCol(26, 0);
  43.         for(int i=l; i<n; i+=k){
  44.             leftCol[a[i]-'a']++;
  45.         }
  46.         vector<int> rightCol(26, 0);
  47.         for(int j=r; j<n; j+=k){
  48.             rightCol[a[j]-'a']++;
  49.         }
  50.  
  51.         int maxiF = 0;
  52.         for(int i=0; i<26; i++){
  53.             int targetF = leftCol[i] + rightCol[i];
  54.             maxiF = max(maxiF, targetF);
  55.         }
  56.  
  57.         int cost = (2*rows - maxiF);
  58.         if(l==r) ans += cost/2;
  59.         else ans += cost;
  60.  
  61.  
  62.         l--;
  63.         r++;
  64.     }
  65.  
  66.     return ans;
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83. int practice(int n, int k){
  84.  
  85.  
  86.     return 0;
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93. void solve() {
  94.  
  95.     int n, k;
  96.     cin>> n >> k;
  97.     cin >> a;
  98.  
  99.  
  100.     cout << consistency(n, k) << endl;
  101.  
  102.  
  103. }
  104.  
  105.  
  106.  
  107.  
  108.  
  109. int32_t main() {
  110.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  111.  
  112.     int t = 1;
  113.     cin >> t;
  114.     while (t--) {
  115.         solve();
  116.     }
  117.  
  118.     return 0;
  119. }
Success #stdin #stdout 0s 5304KB
comments (?)
stdin
copy 
4
6 2
abaaba
6 3
abaaba
36 9
hippopotomonstrosesquippedaliophobia
21 7
wudixiaoxingxingheclp
stdout
copy 
2
0
23
16
https://ideone.com/cucJ6j
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!