Submission #3726277

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
using namespace std;

int solve(int n, vector<char> const & c, vector<int> const & a) {
    int cnt = 0;
    vector<bool> used(2 * n);
    int w_next = 1;
    int b_next = 1;
    while (w_next <= n or b_next <= n) {
        int acc = 0;
        REP (i, 2 * n) {
            if (not used[i]) {
                int & next = (c[i] == 'B' ? b_next : w_next);
                if (next == a[i]) {
                    ++ next;
                    used[i] = true;
                    cnt += i - acc;
                    break;
                }
            } else {
                acc += used[i];
            }
        }
    }
    return cnt;
}

int main() {
    int n; cin >> n;
    vector<char> c(2 * n);
    vector<int> a(2 * n);
    REP (i, 2 * n) cin >> c[i] >> a[i];
    cout << solve(n, c, a) << endl;
    return 0;
}

Submission Info

Judge Result