24分蒟蒻代码求助

#include<bits/stdc++.h>
using namespace std;
int T,n,k;
struct black{
	int x,y,xx1,xx2,xx3,xx4,yy1,yy2,yy3,yy4,shu;
}b[200005];
//string s[2];
char s[2][100005];
bool cmp(black q,black p){
	return q.shu<p.shu;
}
int main(){
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=0;i<n;i++)
			cin>>s[0][i];
		for(int i=0;i<n;i++)
			cin>>s[1][i];
		k=0;
		for(int i=0;i<n;i++){
			if(s[0][i]=='1'){
				b[++k].x=1,b[k].y=i+1;
				if(s[1][i]=='0')
					b[k].xx2=2,b[k].yy2=i+1,b[k].shu++;
				if(i-1>=0&&s[0][i-1]=='0')
					b[k].xx3=1,b[k].yy3=i-1+1,b[k].shu++;
				if(i+1<n&&s[0][i+1]=='0')
					b[k].xx4=1,b[k].yy4=i+1+1,b[k].shu++;
			}
			if(s[1][i]=='1'){
				b[++k].x=2,b[k].y=i+1;
				if(s[0][i]=='0')
					b[k].xx1=1,b[k].yy1=i+1,b[k].shu++;
				if(i-1>=0&&s[1][i-1]=='0')
					b[k].xx3=2,b[k].yy3=i-1+1,b[k].shu++;
				if(i+1<n&&s[1][i+1]=='0')
					b[k].xx4=2,b[k].yy4=i+1+1,b[k].shu++;
			}
		}
		sort(b,b+k,cmp);
		bool flag=0;
		for(int i=1;i<=k;i++){
//			printf("x=%d y=%d xx1=%d yy1=%d xx2=%d yy2=%d xx3=%d yy3=%d xx4=%d yy4=%d\n",b[i].x,b[i].y,b[i].xx1,b[i].yy1,b[i].xx2,b[i].yy2,b[i].xx3,b[i].yy3,b[i].xx4,b[i].yy4);
			if(b[i].xx1>0&&b[i].yy1>0&&s[b[i].xx1-1][b[i].yy1-1]=='0')
				s[b[i].xx1-1][b[i].yy1-1]='1';
			else if(b[i].xx2>0&&b[i].yy2>0&&s[b[i].xx2-1][b[i].yy2-1]=='0')
				s[b[i].xx2-1][b[i].yy2-1]='1';
			else if(b[i].xx3>0&&b[i].yy3>0&&s[b[i].xx3-1][b[i].yy3-1]=='0')
				s[b[i].xx3-1][b[i].yy3-1]='1';
			else if(b[i].xx4>0&&b[i].yy4>0&&s[b[i].xx4-1][b[i].yy4-1]=='0')
				s[b[i].xx4-1][b[i].yy4-1]='1';
			else{
				flag=1;
				break;
			}
			b[i].x=0,b[i].y=0,b[i].xx1=0,b[i].yy1=0,b[i].xx2=0,b[i].yy2=0,b[i].xx3=0,b[i].yy3=0,b[i].xx4=0,b[i].yy4=0;
		}
		if(flag)
			cout<<"++"<<endl;
		else
			cout<<"RP"<<endl;
	}
	return 0;
}