0pts样例过了求条玄关

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
string s1,s2,t1,t2;
int n,id1[N],id2[N],n1,n2;
struct node {
	int c0,c1;
} a[N],b[N];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;
	cin>>T;
	while(T--) {
		cin>>n;
		cin>>s1>>s2>>t1>>t2;
		n1=n2=0;
		for(int i=0; i<n; i++) {
			if(t1[i]=='0'||!i||t1[i-1]=='0') {
				a[++n1]= {0,0};
				if(s1[i]=='0') a[n1].c0++;
				else a[n1].c1++;
			} else {
				if(s1[i]=='0') a[n1].c0++;
				else a[n1].c1++;
			}
			id1[i]=n1;
		}
		for(int i=0; i<n; i++) {
			if(t2[i]=='0'||!i||t2[i-1]=='0') {
				b[++n2]= {0,0};
				if(s2[i]=='0') b[n2].c0++;
				else b[n2].c1++;
			} else {
				if(s2[i]=='0') b[n2].c0++;
				else b[n2].c1++;
			}
			id2[i]=n2;
		}
		int cnt=0;
		for(int i=0;i<n;i++){
			if(a[id1[i]].c1&&b[id2[i]].c1){
				a[id1[i]].c1--;
				b[id2[i]].c1--;
				cnt++;
			}
			else if(a[id1[i]].c0&&b[id2[i]].c0){
				a[id1[i]].c0--;
				b[id2[i]].c0--;
				cnt++;
			}
			else{
				if(s1[i]=='0') a[id1[i]].c0--;
				else a[id1[i]].c1--;
				if(s2[i]=='0') b[id2[i]].c0--;
				else b[id2[i]].c1--;
			}
		}
		cout<<cnt<<"\n";
	}
	return 0;
}