[3] 등굣길

#include <string>
#include <vector>

#define SIZE 101

using namespace std;

int solution(int m, int n, vector<vector<int>> puddles) 
{
    int check[SIZE][SIZE]{0}, vis[SIZE][SIZE]{0};
    
    for(int i=0;i<puddles.size();i++)
        check[puddles[i][1]][puddles[i][0]]=-1;
    
    vis[1][0]=true;
    
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            vis[i][j]=(check[i][j] == -1) ? 0 : (vis[i-1][j]+vis[i][j-1])%1000000007;
    }
    return vis[n][m];
}