P1002 [NOIP2002 普及组] 过河卒【C++】

风吹落，满地华

已于 2022-12-11 10:33:39 修改

阅读量299

点赞数

文章标签：算法动态规划

于 2022-11-27 10:42:14 首次发布

本文链接：https://blog.csdn.net/weixin_49932603/article/details/128061454

版权

原题链接：https://www.luogu.com.cn/problem/P1002
算法标签：动态规划
代码：

#include <iostream>
using namespace std;
int n,m,x,y;
bool book[29][29];
long long dp[29][29];
bool check(int tx, int ty){
    if( tx>=0 && tx<=n && ty>=0 && ty<=m ){
        return true;
    }else{
        return false;
    }
}
int main(){
    cin >> n >> m >> x >> y;
    if( check(x,   y  ) ) book[x  ][y  ] = true;
    if( check(x-1, y-2) ) book[x-1][y-2] = true;
    if( check(x-2, y-1) ) book[x-2][y-1] = true;
    if( check(x-2, y+1) ) book[x-2][y+1] = true;
    if( check(x-1, y+2) ) book[x-1][y+2] = true;
    if( check(x+1, y+2) ) book[x+1][y+2] = true;
    if( check(x+2, y+1) ) book[x+2][y+1] = true;
    if( check(x+2, y-1) ) book[x+2][y-1] = true;
    if( check(x+1, y-2) ) book[x+1][y-2] = true;

    if( book[0][0] ){
        dp[0][0] = 0;
    }else{
        dp[0][0] = 1;
    }
    for( int j=1; j<=m; j++ ){
        if( book[0][j] ){
            dp[0][j] = 0;
        }else{
            dp[0][j] = dp[0][j-1];
        }
    }
    for( int i=1; i<=n; i++ ){
        if( book[i][0] ){
            dp[i][0] = 0;
        }else{
            dp[i][0] = dp[i-1][0];
        }
    }
    for( int i=1; i<=n; i++ ){
        for( int j=1; j<=m; j++ ){
            if( book[i][j] ){
                dp[i][j] = 0;
            }else{
                dp[i][j] = dp[i][j-1] + dp[i-1][j];
            }
        }
    }
    cout << dp[n][m];
    return 0;
}