Submission #68904729

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
#define endl '\n'
using db = double;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<int> a;
    for (int i = 0; i < n * 2; ++i)
    {
        if (s[i] == 'A')
            a.push_back(i);
    }

    LL res1 = 0, res2 = 0;
    for (int i = 0; i < n; ++i)
    {
        int j = i * 2;
        res1 += abs(a[i] - j);
    }
    for (int i = 0; i < n; ++i)
    {
        int j = i * 2 + 1;
        res2 += abs(a[i] - j);
    }
    cout << min(res1, res2);

    return 0;
}

Submission Info

Judge Result