백준 1890번 점프 C++

출처 : https://www.acmicpc.net/problem/1890

 

Dfs+DP

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

#include <bitset>

using namespace std;
using int64 = long long;

int n;

vector<vector<int64>> board;
vector<vector<int64>> cache;

int64 Jump(int row, int col) {

    int64& val = cache[row][col];
    if (val != -1) return val;
    if (row == n - 1 && col == n - 1) return val = 1;

    val = 0;

    if (board[row][col] == 0) return val;

    int nextRow = row + board[row][col];
    int nextCol = col + board[row][col];

    if (nextRow < n)
        val += Jump(nextRow, col);
    if (nextCol < n)
        val += Jump(row, nextCol);

    return val;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	cout.tie(NULL);

    cin >> n;
    board = vector<vector<int64>>(n, vector<int64>(n));
    cache = vector<vector<int64>>(n, vector<int64>(n, -1));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> board[i][j];
        }
    }

    cout << Jump(0, 0);

}