codeforces-1512C. A-B Palindrome（回文串暴力模拟）

链接:https://codeforces.com/problemset/problem/1512/C

A-B Palindrome

You are given a string s consisting of the characters ‘0’, ‘1’, and ‘?’. You need to replace all the characters with ‘?’ in the string s by ‘0’ or ‘1’ so that the string becomes a palindrome and has exactly a characters ‘0’ and exactly b characters ‘1’. Note that each of the characters ‘?’ is replaced independently from the others.

A string t of length n is called a palindrome if the equality t[i]=t[n−i+1] is true for all i (1≤i≤n).

For example, if s=“01???0”, a=4 and b=4, then you can replace the characters ‘?’ in the following ways:

• “01011010”;
• “01100110”.
  For the given string s and the numbers a and b, replace all the characters with ‘?’ in the string s by ‘0’ or ‘1’ so that the string becomes a palindrome and has exactly a characters ‘0’ and exactly b characters ‘1’.

Input
The first line contains a single integer t (1≤t≤1e4.). Then t test cases follow.
The first line of each test case contains two integers a and b (0≤a,b≤2e5, a+b≥1).
The second line of each test case contains the string s of length a+b, consisting of the characters ‘0’, ‘1’, and ‘?’.
It is guaranteed that the sum of the string lengths of s over all test cases does not exceed 2e5.

Output
For each test case, output:

“-1”, if you can’t replace all the characters ‘?’ in the string s by ‘0’ or ‘1’ so that the string becomes a palindrome and that it contains exactly a characters ‘0’ and exactly b characters ‘1’;
the string that is obtained as a result of the replacement, otherwise.
If there are several suitable ways to replace characters, you can output any.

题目大意：

给定a个0和b个1，将一串具有字符‘0’、‘1’、‘？’的”字符串变成含有a个0和b个1的回文字符串，如果不能完成则输出“-1”。

分析：

双指针模拟做，先把字符串中有的“0”和“1”从a，b中减去，然后模拟，将“？”变成“0”或“1”，变成功了就把对应的“a”或“b”减一，要注意的点是一定要先把字符串中已有的“0”或“1”对应的“？”变成“0”或“1”，再去变两个“？”对应的，因为如果不这样操作的话可能会出现在碰到“0”–“？”的时候"0"不够（1也一样），比如说a=9,b=6,101???0???101,先变成了101000 0?? 000101 ，接下来因为“0”不够就可能会出错。

AC代码

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	while (t--)
	{
		int a, b;
		cin >> a >> b;
		string s;
		cin >> s;
		if (s.size() == 1)
		{
			if ((s[0] == '0' || s[0] == '?') && a == 1) cout << "0" << "\n";
			else if ((s[0] == '1' || s[0] == '?') && b == 1) cout << "1" << "\n";
			else
				cout << "-1" << "\n";
			continue;
		}
		for (int i = 0; i < s.size(); i++)
		{
			if (s[i] == '1') b--;
			else if (s[i] == '0') a--;
		}
		if (a < 0 || b < 0)
		{
			cout << "-1" << "\n";
			continue;
		}
		int l = 0, r = s.size() - 1;
		bool flag = true;
		while (l < r)  //第一次循环不需要讨论中间的所以l<r
		{
			if ((s[l]=='0'&& s[r]=='1')||(s[r] == '0' && s[l] == '1'))
			{
				flag = false;
				break;
			}
			else if (s[l] == '0' && s[r] == '?')
			{
				if (a <= 0)
				{
					flag = false;
					break;
				}
				else
				{
					a--;
					s[r] = '0';
					l++, r--;
				}
			}
			else if (s[l] == '1' && s[r] == '?')
			{
				if (b <= 0)
				{
					flag = false;
					break;
				}
				else
				{
					b--;
					s[r] = '1';
					l++, r--;
				}
			}
			else if (s[l] == '?' && s[r] == '0')
			{
				if (a <= 0)
				{
					flag = false;
					break;
				}
				else
				{
					a--;
					s[l] = '0';
					l++, r--;
				}
			}
			else if (s[l] == '?' && s[r] == '1')
			{
				if (b <= 0)
				{
					flag = false;
					break;
				}
				else
				{
					b--;
					s[l] = '1';
					l++, r--;
				}
			}
			else
			l++, r--;
		}
		l = 0, r = s.size()-1; //注意是s.size()-1
		while (l <= r)  //第二次循环需要讨论中间也是“？”的情况，所以l<=r
		{
			if (s[l] == '?' && s[r] == '?' && l != r)
			{
				if (a >= 2)
				{
					s[l] = '0';
					s[r] = '0';
					a -= 2;
					l++, r--;
				}
				else if (b >= 2)
				{
					s[l] = '1';
					s[r] = '1';
					b -= 2;
					l++, r--;
				}
				else
				{
					flag = false;
					break;
				}
			}
			else if (s[l] == '?' && s[r] == '?' && l == r)
			{
				if (a > 0)
					s[l] = '0';
				else if (b > 0)
					s[l] = '1';
				else
				{
					flag = false;
					break;
				}
			}
			else
				l++, r--;
		}
		if (flag)
			cout << s << "\n";
		else
			cout << "-1" << "\n";
	}
	return 0;
}