NYOJ 最少步数

最少步数

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 4

描述

这有一个迷宫，有0~8行和0~8列：

 1,1,1,1,1,1,1,1,1
 1,0,0,1,0,0,1,0,1
 1,0,0,1,1,0,0,0,1
 1,0,1,0,1,1,0,1,1
 1,0,0,0,0,1,0,0,1
 1,1,0,1,0,1,0,0,1
 1,1,0,1,0,1,0,0,1
 1,1,0,1,0,0,0,0,1
 1,1,1,1,1,1,1,1,1

0表示道路，1表示墙。

现在输入一个道路的坐标作为起点，再如输入一个道路的坐标作为终点，问最少走几步才能从起点到达终点？

（注：一步是指从一坐标点走到其上下左右相邻坐标点，如：从（3，1）到（4,1）。）

输入

第一行输入一个整数n（0<n<=100），表示有n组测试数据;
随后n行,每行有四个整数a,b,c,d（0<=a,b,c,d<=8）分别表示起点的行、列，终点的行、列。

输出

输出最少走几步。

样例输入

2
3 1  5 7
3 1  6 7

样例输出

12
11

题目就是一般的bfs问题，用了优先队列，已步数最小优先

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#include<limits.h>
#define MOD 1000000007
#define fir first
#define sec second
#define fin freopen("/home/ostreambaba/文档/input.txt", "r", stdin)
#define fout freopen("/home/ostreambaba/文档/output.txt", "w", stdout)
#define mes(x, m) memset(x, m, sizeof(x))
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 1e9+7
#define Pi 4.0*atan(1.0)
#define lowbit(x) (x&-x)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-7;
const int MAX = 101;
using namespace std;
#define time
struct node{
    int x, y;  
    int cnt;  
    friend bool operator < (node a, node b){   //优先队列以步数最少排列
        return a.cnt > b.cnt;
    }
};
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int si, sj, di, dj, nx, ny;
int mp[9][9] = {   
    1,1,1,1,1,1,1,1,1,
    1,0,0,1,0,0,1,0,1,
    1,0,0,1,1,0,0,0,1,
    1,0,1,0,1,1,0,1,1,
    1,0,0,0,0,1,0,0,1,
    1,1,0,1,0,1,0,0,1,
    1,1,0,1,0,1,0,0,1,
    1,1,0,1,0,0,0,0,1,
    1,1,1,1,1,1,1,1,1
};
bool vis[9][9];
int bfs(int si, int sj)  //bfs写法咯用优先队列写简单点
{
    priority_queue<node> que;
    node now, next;
    now.x = si;
    now.y = sj;
    now.cnt = 0;
    que.push(now);
    vis[si][sj] = true;
    while(!que.empty()){
        now = que.top();
        que.pop();
        if(now.x == di && now.y == dj){
            return now.cnt;
        }
        for(int i = 0; i < 4; ++i){
            nx = now.x + dx[i];
            ny = now.y + dy[i];
            if(mp[nx][ny] == 0 && !vis[nx][ny]){
                vis[nx][ny] = true;
                next.x = nx;
                next.y = ny;
                next.cnt = now.cnt + 1;
                que.push(next);
            }
        }
    }
    return -1;
}
int main()
{
    int Case;
    cin >> Case;
    while(Case--)
    {
        cin >> si >> sj;
        cin >> di >> dj;
        mes(vis, false);
        cout << bfs(si, sj) << endl;
    }
    return 0;
}