ChatGPD答案都没有通过(゜ ▽゜)

ChatGPD的答案都没有通过

#include <iostream>
#include <vector>

using namespace std;

const int MOD = 1e9 + 7;

int main() {
    int N, K;
    cin >> N >> K;

    vector<vector<int>> horizontal(N, vector<int>(K - 1));
    vector<vector<int>> vertical(K, vector<int>(N - 1));

    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < K - 1; ++j) {
            cin >> horizontal[i][j];
        }
    }

    for (int i = 0; i < K; ++i) {
        for (int j = 0; j < N - 1; ++j) {
            cin >> vertical[i][j];
        }
    }

    vector<vector<int>> dp(N, vector<int>(K, 0));
    dp[0][0] = 1;

    for (int i = 1; i < N; ++i) {
        if (horizontal[i][0] == 0) {
            dp[i][0] = 0;
        } else {
            dp[i][0] = dp[i-1][0];
        }
    }

    for (int j = 1; j < K; ++j) {
        if (vertical[0][j-1] == 0) {
            dp[0][j] = 0;
        } else {
            dp[0][j] = dp[0][j-1];
        }
    }

    for (int i = 1; i < N; ++i) {
        for (int j = 1; j < K; ++j) {
            if (horizontal[i][j-1] == 0 && vertical[j][i-1] == 0) {
                dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % MOD;
            } else {
                dp[i][j] = 0;
            }
        }
    }

    int result = dp[N-1][K-1];
    cout << result << endl;

    return 0;
}