Submission

PP--------

Score: 20

User: Nagornz

Problemset: ทางเชื่อม

Language: cpp

Time: 0.645 second

Submitted On: 2025-03-30 22:01:20

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

#include <bits/stdc++.h>
#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 <char>> a(2, vector <char> (5005));
        vector <vector <int>> dp(2, vector <int> (5005));
        for (int i = 0; i < 2; i++) {
            for (int j = 1; j <= n; j++) {
                cin >> a[i][j];
            }
        }
        dp[0][0] = dp[1][0] = 1;
        for (int j = 1; j <= n; j++) {
            for (int i = 0; i < 2; i++) {
                int chk;
                if (i == 0) chk = 1;
                else chk = 0;
                if (a[i][j] == '#') continue;
                dp[i][j] += dp[i][j - 1] % mod;
                dp[i][j] %= mod;
                if (a[chk][j] == '#') continue;
                dp[i][j] += dp[chk][j - 1] % mod;
                dp[i][j] %= mod;
            }
        }
        // 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";
    }
}