最少步数
时间限制:
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,10表示道路,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
-
#include<cstdio> #include<iostream> #include<cstring> #include<queue> using namespace std; int ans[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}, }; struct node{ int x; int y; int step; }; int vis[9][9]; int dx[4] = {1,0,-1,0}; int dy[4] = {0,1,0,-1}; int sx,sy,ex,ey; int bfs() { node now,next; queue<node > q; now.x = sx; now.y = sy; now.step = 0; q.push(now); while(!q.empty()) { next = q.front(); q.pop(); if(next.x == ex && next.y == ey) break; for(int i = 0; i < 4 ; i++) { now.x = next.x + dx[i]; now.y = next.y + dy[i]; if(!ans[now.x][now.y] && !vis[now.x][now.y] && now.x >= 0 && now.x < 9 && next.y >= 0 && next.y < 9) { vis[now.x][now.y] = 1; now.step = next.step + 1; q.push(now); } } } return next.step; } int main() { int t; cin >> t; while(t--) { memset(vis,0,sizeof(vis)); cin >> sx >> sy >> ex >> ey; int sum = bfs(); cout << sum << endl; } return 0; }
-
第一行输入一个整数n(0<n<=100),表示有n组测试数据;