*待改 [Acwing] 输出最小步数 马走日

问题:

输出最小步数

思路

同样的 我们可以通过转移

每次转移我们只需要对前面的一次操作加一即可

我的代码有误 不清楚 不习惯用Piar

CODE

#include <bits/stdc++.h>
using namespace std;
const int N = 150;
char g[N][N];
int n,m,st[N][N];
int ex ,ey;
int dx[8] = {-2, -1, 1, 2, 2, 1, -1, -2};
int dy[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int dist[N][N];
struct node
{
    int x,y,cnt;
};
void bfs(int x,int y)
{
    queue<node> q;
    st[x][y] = 1;
    q.push({x,y,0});


    while(!q.empty())
    {
        node t = q.front();
        q.pop();
        for(int i =0 ; i<8; i++)
        {
            int fx = dx[i]+t.x;
            int fy = dy[i]+t.y;

            if(g[fx][fy]!='*')
            if(!st[fx][fy])
            if(fx>0&&fx<n)
            if(fy>0&&fy<m)
            {
                st[fx][fy] = 1;
                dist[fx][fy] = dist[t.x][t.y]+1;
                q.push({fx,fy,t.cnt+1});
                if(fx ==  ex &&fy ==ey)
                {
                    cout<<dist[t.x][t.y];
                    //cout<<t.cnt+1;
                    return;
                }
            }
        }
    }

}
void solve()
{
    cin>>n>>m;
    int x,y;


    for(int i = 0; i<n; i++)
    {
        for(int j = 0; j<m; j++)
        {
            scanf("%c",&g[i][j]);
            //cin>>g[i][j];
            if(g[i][j] == 'K')
                x=i,y=j;
            if(g[i][j] == 'H')
                ex = i,ey=j;
        }
    }
    //cin>>g[i];

    bfs(x,y);

}
int main()
{
    solve();
    return 0;
}

Y总CODE:

#include <cstring>
#include <iostream>
#include <algorithm>

#define x first
#define y second

using namespace std;

typedef pair<int, int> PII;

const int N = 155, M = N * N;

int n, m;
char g[N][N];
PII q[M];
int dist[N][N];

int bfs()
{
    int dx[] = {-2, -1, 1, 2, 2, 1, -1, -2};
    int dy[] = {1, 2, 2, 1, -1, -2, -2, -1};

    int sx, sy;
    for (int i = 0; i < n; i ++ )
        for (int j = 0; j < m; j ++ )
            if (g[i][j] == 'K')
                sx = i, sy = j;

    int hh = 0, tt = 0;
    q[0] = {sx, sy};

    memset(dist, -1, sizeof dist);
    dist[sx][sy] = 0;

    while (hh <= tt)
    {
        auto t = q[hh ++ ];

        for (int i = 0; i < 8; i ++ )
        {
            int a = t.x + dx[i], b = t.y + dy[i];
            if (a < 0 || a >= n || b < 0 || b >= m) continue;
            if (g[a][b] == '*') continue;
            if (dist[a][b] != -1) continue;
            if (g[a][b] == 'H') return dist[t.x][t.y] + 1;

            dist[a][b] = dist[t.x][t.y] + 1;
            q[ ++ tt] = {a, b};
        }
    }

    return -1;
}

int main()
{
    cin >> m >> n;

    for (int i = 0; i < n; i ++ ) cin >> g[i];

    cout << bfs() << endl;

    return 0;
}