Gregor and the Pawn Game

题目:

题目链接:

题解:

从左向右看,如果前面有 $1$ 便先向左上角找,然后向右上角找

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		string a,b;
		cin>>a>>b;
		int ans=0;
		for(int i=0;i<n;i++)
		{
			if(b[i]=='1') 
			{
				if(a[i]=='0') ans++;
				else if(i!=0&&a[i-1]=='1') ans++,a[i-1]='0';
				else if(i!=n-1&&a[i+1]=='1') ans++,a[i+1]='0';
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}