1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <string>

using namespace std;

int pal(string Word);

int main()
{
    string Word;
    cin >> Word;

    cout << pal(Word);

    return 0;
}

int pal(string Word)
{
    int WordS = int(Word.size());

    // Can word be palindrome
    int AQ = 0;
    int BQ = 0;
    for (char Char : Word)
    {
        if (Char == 'a')
            AQ++;
        else
            BQ++;
    }
    if (AQ % 2 && BQ % 2)
        return -1;

    char B;
    if (!(BQ % 2))
        B = 'b';
    else
    {
        B = 'a';
        swap(AQ, BQ);
    }

    auto* BIndexes = new int[BQ];

    int b = 0;
    for (int c = 0; c < WordS; c++)
        if (Word[c] == B)
        {
            BIndexes[b] = c;
            b++;
        }

    int Return = 0;
    for (int i = 0; i < BQ / 2; i++)
        Return += abs(BIndexes[i] - (WordS - BIndexes[BQ - i - 1] - 1));

    return Return;
}