Submission #8314255

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;


int main() {
    ios::sync_with_stdio(false);
    int n, a[4004] = {}, x = 1, y = 1, z = 0;
    bool b[4004] = {};
    char c[4004] = {};
    cin >> n;
    for (int i = 1; i <= n + n; i++) cin >> c[i] >> a[i];
    for (int i = 1; i <= n + n; i++) {
        for (int j = 1; j <= n + n; j++) {
            if (!b[j]) {
                if (c[j] == 'B' && a[j] == x) {
                    x++;
                    b[j] = 1;
                    break;
                }
                if (c[j] == 'W' && a[j] == y) {
                    y++;
                    b[j] = 1;
                    break;
                }
                z++;
            }
        }
    }
    cout << z;
}

Submission Info

Judge Result