Grid Paths II

#include <bits/stdc++.h>

using namespace std;

int dx[4] {1, 0, -1, 0};
int dy[4] {0, 1, 0, -1};
set<pair<int, int>> traps; 
vector<vector<int>> dp {};
int M = 1e9+7;
int main () {
    int n, m;
    cin >> n >> m;
    if (!n) {
        cout << 0;
        return 0;
    }
    
    dp = vector<vector<int>> (n+1, vector<int>(n+1));
    for (int i=0; i<m; i++) {
        int a, b;
        cin >> a >> b;
        traps.insert(make_pair(a, b));
    }

    dp[1][0] = 1;
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            if (traps.find({i,j}) != traps.end()) {
                dp[i][j] = 0;
            } else {
                dp[i][j] = (dp[i-1][j]%M + dp[i][j-1]%M)%M;
            }
        }
    }
    
    cout << dp[n][n];
    // cout << "\n";
    // for (auto i:dp) {
    //     for (auto j:i) {
    //         cout << j << " ";
    //     }
    //     cout << endl;
    // }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR