Submission

Score: 20

User: kormuyang

Problemset: ทางเชื่อม

Language: cpp

Time: 1.036 second

Submitted On: 2025-12-16 01:36:27

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define MOD (int)(1e9 + 7)

void solve() {
    int n;
    cin >> n;
    vector<vector<char>> s(2, vector<char>(n + 2));
    for (int i = 0; i <= 1; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> s[i][j];
        }
    }
    for (int i = 1; i <= n; i++) {
        if (s[0][i] == '#' && s[1][i] == '#') {
            cout << "0\n";
            return;
        }
    }
    vector<vector<int>> dp(2, vector<int>(n + 1, 0));
    dp[0][0] = dp[1][0] = 1;
    for (int i = 1; i <= n; i++) {
        if (s[0][i] == '.' && s[1][i] == '.') {
            dp[0][i] = (dp[0][i - 1] + dp[1][i - 1]) % MOD;
            dp[1][i] = dp[0][i];
        } else if (s[0][i] == '.') {
            dp[0][i] = dp[0][i - 1];
        } else if (s[1][i] == '.') {
            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';
}

int32_t main() {
    int q;
    cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}