1872E - Data Structures Fan - CodeForces Solution

#include<bits/stdc++.h>
#define ll long long int

using namespace std;


int main(){
    ll t;
    cin>>t;
    while(t--){
    	ll n;
    	cin>>n;
    	ll a[n];
    	for(int i=0;i<n;i++){
    		cin>>a[i];
    	}
    	string s;
    	cin>>s;
    	ll a1[n+1];
    	ll a0[n+1];
    	for(int i=0;i<=n;i++){
    		a1[i]=0;
    		a0[i]=0;
    	}
    	if(s[0]=='0') a0[1]=a[0];
    	if(s[0]=='1') a1[1]=a[0];
    	for(int i=2;i<=n;i++){
    		if(s[i-1]=='0'){
    			a0[i]=a0[i-1]^a[i-1];
    			a1[i]=a1[i-1];
    		}
    		else{
    			a0[i]=a0[i-1];
    			a1[i]=a1[i-1]^a[i-1];
    		}

    	}
    	ll q;
    	cin>>q;
    	ll f=a0[n];
    	ll ff=a1[n];
    	while(q--){
    		ll x;
    		cin>>x;
    		if(x==2){
    			
    			ll y;
    			cin>>y;
    			if(y==0) cout<<f<<" ";
    			else cout<<ff<<" ";
    		 
    		}
    		else{
    			ll y ,z;
    			cin>>y>>z;
    			f=f^a0[y-1]^a0[z]^a1[y-1]^a1[z];
    			ff=ff^a1[y-1]^a1[z]^a0[y-1]^a0[z];
    		}

    	}
    	cout<<endl;

    

    }
     
    }