Submission

Score: 20

User: mocngaijakraila

Problemset: ทางเชื่อม

Language: cpp

Time: 0.378 second

Submitted On: 2026-09-25 15:03:17

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

long long dp[5001][2];

void f() {
    int n; cin >> n;
    char arr[n + 1][2];
    for(int i = 0; i < 2; i++) {
        for(int j = 1; j <= n; j++) {
            cin >> arr[j][i];
        }
    }

    dp[0][1] = dp[0][0] = 1;
    

    for(int i = 1; i <= n; i++) {
        if(arr[i][0] == '.' && arr[i][1] == '.') {
            dp[i][1] = dp[i][0] = (dp[i-1][0]+dp[i-1][1])%MOD; 
        }
        else if(arr[i][0] == '#' && arr[i][1] == '.') {
            dp[i][0] = 0;
            dp[i][1] = dp[i-1][1]%MOD;
        }
        else if(arr[i][0] == '.' && arr[i][1] == '#') {
            dp[i][0] = dp[i-1][0]%MOD;
            dp[i][1] = 0;
        }
        else {
            dp[i][1] = dp[i][0] = 0;
        }
    }

    cout << (dp[n][0]+dp[n][1])%MOD << '\n';
}

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