Submission

Score: 20

User: navysrimuang

Problemset: ทางเชื่อม

Language: cpp

Time: 0.346 second

Submitted On: 2026-03-17 01:14:45

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;

void solve(){
	int n;
	cin >> n;
	vector<vector<ll>> dp(2,vector<ll>(n+2,0));
	vector<vector<bool>> blk(2,vector<bool>(n+2,0));
	for(int i = 0;i<2;i++){
		for(int j = 1;j<=n;j++){
			char c; 
			cin >> c;
			if(c == '#') blk[i][j] = 1;
		}
	}

	for(int i = 1;i<=n;i++){
		if(blk[0][i] && blk[1][i]){
			cout << "0\n";
			return;
		}
	}
	dp[0][0] = dp[1][0] = 1;			
	
	for(int i = 1;i<=n;i++){
		if(!blk[0][i] && !blk[1][i]){
			dp[0][i] = (dp[0][i-1]+dp[1][i-1])%MOD;
			dp[1][i] = dp[0][i];
		}else if(!blk[0][i] && blk[1][i]){
			dp[0][i] = dp[0][i-1];
			dp[1][i] = 0;
		}else if(blk[0][i] && !blk[1][i]){
			dp[0][i] = 0;
			dp[1][i] = dp[1][i-1];
		}
	}

//		for(int i = 0;i<2;i++){
//			for(int j = 1;j<=n;j++){
//				cout << dp[i][j] << " ";
//			}
//			cout << "\n";
//		}
	cout << (dp[0][n] + dp[1][n]) % MOD << "\n";

}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	while(t--){
		solve();
	}
	return 0;
}