3777. 砖块

3777. 砖块

题目链接

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int M = 100010;
int t;
int main() {
    cin >> t;
    while (t--) {
        int n;
        scanf("%d", &n);
        string s, s2;
        cin >> s;
        s2 = s;
        vector<int> v1, v2;
        v1.clear(), v2.clear();
        int ans1 = 0;
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] == 'B' && i != (s.size() - 1)) {
                ans1++;
                if (s[i + 1] == 'W')
                    s[i + 1] = 'B';
                else
                    s[i + 1] = 'W';
                v1.push_back(i + 1);
            }
            if (i == (s.size() - 1)) {
                if (s[i] == 'B')
                    ans1 = -1;
            }
        }
        int ans2 = 0;
        for (int i = 0; i < s2.size(); ++i) {
            if (s2[i] == 'W' && i != (s2.size() - 1)) {
                ans2++;
                if (s2[i + 1] == 'B')
                    s2[i + 1] = 'W';
                else
                    s2[i + 1] = 'B';
                v2.push_back(i + 1);
            }
            if (i == (s2.size() - 1)) {
                if (s2[i] == 'W')
                    ans2 = -1;
            }
        }

        if (ans1 == -1 && ans2 == -1) {
            cout << "-1" << endl;
            continue;
        }
        if (ans1 > ans2) {
            cout << v1.size() << endl;
            for (int i = 0; i < v1.size(); ++i)
                cout << v1[i] << ' ';
            if (v1.size())
                cout << endl;
            continue;
        } else {
            cout << v2.size() << endl;
            for (int i = 0; i < v2.size(); ++i)
                cout << v2[i] << ' ';
            if (v2.size())
                cout << endl;
            continue;
        }
    }
    return 0;
}

题解：只要有‘B’或者‘W’的的个数为偶数就一定能够通过修改这个偶数个的字符串来得到统一的字符串。