Submission

PP-x-xTxx-

Score: 20

User: Nagornz

Problemset: ทางเชื่อม

Language: cpp

Time: 1.028 second

Submitted On: 2025-03-30 22:34:12

/*
TASK: bridge
LANG: C++
AUTHOR: Nagorn Phongphasura
CENTER: SUT
*/

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,fast-math,unsafe-math-optimization")
#define int long long
using namespace std;

const int mod = 1e9 + 7;

int n;

int32_t main(){
    cin.tie(NULL)->sync_with_stdio(false);
    int tc;
    cin >> tc;
    while (tc--) {
        cin >> n;
        vector <vector <int>> dp(n + 1, vector <int> (2));
        string a[2];
        cin >> a[0] >> a[1];
        a[0] = " " + a[0];
        a[1] = " " + a[1];
        dp[0][0] = dp[0][1] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < 2; j++) {
                if (a[j][i] == '.') dp[i][j] += dp[i - 1][j];
                if (a[0][i] == '.' && a[1][i] == '.') dp[i][!j] += dp[i - 1][j];
                dp[i - 1][j] %= mod; dp[i][!j] %= mod;
            }
        }
        // for (int i = 0; i < 2; i++) {
        //     for (int j = 1; j <= n; j++) {
        //         cout << dp[j][i] << " ";
        //     }
        //     cout << "\n";
        // }
        cout << (dp[n][0] + dp[n][1]) % mod << "\n";
    }
}