洛谷P1002 Codevs1011 过河卒 --2002年NOIP全国联赛普及组 dp递推

洛谷 P1002 过河卒
双倍经验
三倍经验

整张图向右下移动了 3 个，以防判断马不能走的点时不越界。
本来不想暴力更改马不能走的点的，发现定义数组for 更麻烦……

dp的初始化：最上面一行 和 最左边一行 显然是 1。

代码：

#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;

const int MAXN = 30;
const int dx[] = {0,1,0};
const int dy[] = {0,0,1};
int n, m, x, y, ans = 0; // n -> r ; m -> c
bool vis[MAXN][MAXN];
LL dp[MAXN][MAXN];

void init()
{
    vis[x][y] = vis[x+2][y+1] = vis[x+1][y+2] = 0;
    vis[x-2][y-1] = 0;
    vis[x-2][y+1] = 0;
    vis[x-1][y-2] = 0;
    vis[x-1][y+2] = 0;
    vis[x+2][y-1] = 0;
    vis[x+1][y-2] = 0;
}

int main()
{
    cin >> n >> m >> x >> y;
    x += 3; y += 3; n += 3; m += 3;
    for(int i = 3; i <= n; i ++)
        for(int j = 3; j <= m; j ++)
            vis[i][j] = 1;
    init();
    dp[3][3] = 1;
    for(int i = 3; i <= n; i ++)
        for(int j = 3; j <= m; j ++)
            if(vis[i][j] && (i != 3 || j != 3))
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
    cout << dp[n][m] << endl;
    return 0;
}
// 6 6 3 2 

---

另一个AC版本

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;

#define MAXN (20+2)
int dp[MAXN][MAXN];
bool vis[MAXN][MAXN];

int main()
{
    int n, m, x, y;
    cin >> n >> m >> x >> y;

    ++ n; ++ m; ++ x; ++ y;
    vis[x][y] = 1;
    int zuo1 = y-1, you1 = y+1, shang1 = x-1, xia1 = x+1;
    int zuo2 = y-2, you2 = y+2, shang2 = x-2 , xia2 = x+2;
    if(you1 <= m && xia2 <= n) vis[xia2][you1] = 1;
    if(you2 <= m && xia1 <= n) vis[xia1][you2] = 1;
    if(you2 <= m && shang1 >= 1) vis[shang1][you2] = 1;
    if(you1 <= m && shang2 >= 1) vis[shang2][you1] = 1;
    if(zuo1 >= 1 && shang2 >= 1) vis[shang2][zuo1] = 1;
    if(zuo2 >= 1 && shang1 >= 1) vis[shang1][zuo2] = 1;
    if(zuo2 >= 1 && xia1 <= n) vis[xia1][zuo2] = 1;
    if(zuo1 >= 1 && xia2 <= n) vis[xia2][zuo1] = 1;

    dp[1][1] = 1;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
            if(!vis[i][j] && (i != 1 || j != 1))
                dp[i][j] = dp[i-1][j] + dp[i][j-1];

    cout << dp[n][m];
    return 0;
}
//

---

另另一个AC版本

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;

#define MAXN (20+2)
int dp[MAXN][MAXN];

#define EF (-1)

int main()
{
    int n, m, x, y;
    cin >> n >> m >> x >> y;

    dp[x][y] = EF;
    int zuo1 = y-1, you1 = y+1, shang1 = x-1, xia1 = x+1;
    int zuo2 = y-2, you2 = y+2, shang2 = x-2 , xia2 = x+2;
    if(you1 <= m && xia2 <= n) dp[xia2][you1] = EF;
    if(you2 <= m && xia1 <= n) dp[xia1][you2] = EF;
    if(you2 <= m && shang1 >= 0) dp[shang1][you2] = EF;
    if(you1 <= m && shang2 >= 0) dp[shang2][you1] = EF;
    if(zuo1 >= 0 && shang2 >= 0) dp[shang2][zuo1] = EF;
    if(zuo2 >= 0 && shang1 >= 0) dp[shang1][zuo2] = EF;
    if(zuo2 >= 0 && xia1 <= n) dp[xia1][zuo2] = EF;
    if(zuo1 >= 0 && xia2 <= n) dp[xia2][zuo1] = EF;

    for(int i = 1; i <= n; i ++)
    {
        if(!dp[i][0]) dp[i][0] = 1;
        else {
            while(i <= n)
            {
                dp[i][0] = EF;
                ++ i;
            }
        }
    }
    for(int i = 1; i <= m; i ++)
    {
        if(!dp[0][i]) dp[0][i] = 1;
        else {
            while(i <= n)
            {
                dp[0][i] = EF;
                ++ i;
            }
        }
    }

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

---

暴力dfs 代码（存而已……）：

#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAXN = 30;
const int dx[] = {0,1,0};
const int dy[] = {0,0,1};
int n, m, x, y, ans = 0; // n -> r ; m -> c
bool vis[MAXN][MAXN];


void dfs(int x, int y)
{
    if(x == n && y == m)
    {
        ans ++;
        return;
    }
    for(int i = 1; i <= 2; i ++)
    {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if(vis[nx][ny] && nx >= 0 && nx <= n && ny >= 0 && ny <= m)
        {
            vis[nx][ny] = 0;
            dfs(nx,ny);
            vis[nx][ny] = 1;
        }
    }
}

void init()
{
    vis[x][y] = vis[x+2][y+1] = vis[x+1][y+2] = 0;
    if(x-2 >= 0 && y-1 >= 0)
        vis[x-2][y-1] = 0;
    if(x-2 >= 0 && y+1 >= 0)
        vis[x-2][y+1] = 0;
    if(x-1 >= 0 && y-2 >= 0)
        vis[x-1][y-2] = 0;
    if(x-1 >= 0 && y+2 >= 0)
        vis[x-1][y+2] = 0;
    if(x+2 >= 0 && y-1 >= 0)
        vis[x+2][y-1] = 0;
    if(x+2 >= 0 && y-2 >= 0)
        vis[x+1][y-2] = 0;
}

int main()
{
    cin >> n >> m >> x >> y;
    for(int i = 0; i <= n; i ++)
        for(int j = 0; j <= m; j ++)
            vis[i][j] = 1;
    init();
    dfs(0,0);
    cout << ans << endl;
    return 0;
}