Codeforces 1890C- Qingshan Loves Strings 2(906 div2-构造)

题目链接： https://codeforces.com/contest/1890/problem/C

题目大意： 给定一个01字符串 s (长度最大为100) 。定义字符串为好串，如果它满足 a_i ≠ a_k-i+1 ( 1 ≤ i ≤ k ) 。可以选择s的任意位置插入字符串01，最多插入300次，问能否将 s 变为好串。

题目思路： 首先明确奇数串必定不满足。然后可以想到如果首尾字符相同，往中间插是没有贡献的，所以对于枚举的当前位置，要么就是开头插，要么就是末尾插。

#pragma GCC optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define endy {cout<<"YES\n";}//return ;}❤
#define endn {cout<<"NO\n";}//return ;}❤
#define endl '\n'
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair<ll,ll> pii;
const int mod = 1e9+7;
const int N = 1e3+10;
const ll INF_ = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
ll n, m, k, x, y, res = 0, sum = 0, ans = 0, ma = 0, mi = INF;
void solve()
{
    cin >> n;
    int ans[N];
    string s;
    cin >> s;
    int cnt = 0;
    int idx = 0;
    if( n & 1) { cout << -1 << endl; return; }
    for (int i = 0; i < s.size(); i++) {
        if (s[i] == s[s.size() - i - 1] && s[i] == '1') {
            cnt++;
            ans[idx++] = i;
            s.insert(i, "01");
        } else if (s[i] == s[s.size() - i - 1] && s[i] == '0') {
            cnt++;
            ans[idx++] = s.size() - i;
            s.insert(s.size() - i, "01");
        }
        if (cnt > 300)
            break;
    }
    if (!cnt)
        cout << 0 << endl
             << endl;
    else if (cnt > 300)
        cout << -1 << endl;
    else {
        cout << cnt << endl;
        for (int i = 0; i < idx; i++) {
            cout << ans[i] << " \n"[i == idx - 1];
        }
    }
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);
	// cout.tie(0);
	ll _;cin>>_;
	while(_--)
		solve();
	return 0;
}