HDOJ 1372 Knight Moves (BFS)
来源:互联网 发布:淘宝助理二次验证 编辑:程序博客网 时间:2024/04/26 00:03
Knight Moves
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8846 Accepted Submission(s): 5205
Problem Description
A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy.
Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.
Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b.
Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.
Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b.
Input
The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard.
Output
For each test case, print one line saying "To get from xx to yy takes n knight moves.".
Sample Input
e2 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 f6
Sample Output
To get from e2 to e4 takes 2 knight moves.To get from a1 to b2 takes 4 knight moves.To get from b2 to c3 takes 2 knight moves.To get from a1 to h8 takes 6 knight moves.To get from a1 to h7 takes 5 knight moves.To get from h8 to a1 takes 6 knight moves.To get from b1 to c3 takes 1 knight moves.To get from f6 to f6 takes 0 knight moves.
#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <climits>#include <algorithm>using namespace std;struct node{int x, y, step;};const int maxn = 8;bool square[maxn][maxn];int sx, sy, ex, ey;int dir[8][2] = {{-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, {1, -2}, {1, 2}, {2, -1}, {2, 1}};int bfs();int main(){char str1[5], str2[5];while(scanf("%s %s", str1, str2) != EOF){sx = str1[1] - '1'; sy = str1[0] - 'a';ex = str2[1] - '1'; ey = str2[0] - 'a';memset(square, 0, sizeof(square));int ans = bfs();printf("To get from %s to %s takes %d knight moves.\n", str1, str2, ans);}return 0;}int bfs(){queue<node> que;node tmp, t;t.x = sx;t.y = sy;t.step = 0;square[t.x][t.y] = true;que.push(t);while(!que.empty()){tmp = que.front();if(tmp.x == ex && tmp.y == ey)return tmp.step;que.pop();for(int i = 0; i < 8; i++){t.x = tmp.x + dir[i][0];t.y = tmp.y + dir[i][1];t.step = tmp.step + 1;if(t.x >= 0 && t.x < 8 && t.y >= 0 && t.y < 8 && !square[t.x][t.y]){square[t.x][t.y] = true;que.push(t);}}}return -1;}
0 0
- HDOJ 题目1372 Knight Moves(BFS)
- HDOJ 1372 Knight Moves (BFS)
- HDOJ 1372 Knight Moves【BFS】
- (BFS)Knight Moves--HDOJ
- HDOJ 1372 Knight Moves(BFS 广搜)
- hdoj 1372 Knight Moves 【BFS+优先队列】
- HDOJ/HDU 1372 Knight Moves(经典BFS)
- 1372 knight moves BFS
- Knight Moves(bfs)
- Knight Moves(BFS)
- Knight Moves(BFS)
- Knight Moves (BFS)
- hdoj 1372 Knight Moves
- hdoj 1372 Knight Moves
- uva-439 - HDOJ-1372-Knight Moves-翻译详解-BFS
- 【hdu 1372】 Knight Moves (BFS)
- hdu 1372 Knight Moves (水bfs)
- hdu 1372 Knight Moves(BFS)
- solution to 当前计算机未注册"microsoft.ACE.oledb.12.0"
- Objective-C中@property所有的属性详解
- 美剧资源-网盘链接
- kafka入门:简介、使用场景、设计原理、主要配置及集群搭建(转)
- rman全库备份,恢复过程
- HDOJ 1372 Knight Moves (BFS)
- 系统学习机器学习之非参数方法
- 《Android源码设计模式解析与实战》读书笔记(八)
- Android studio - experimental gradle 0.4.0.0 with openCV
- Bootstrap modal 模态框垂直居中
- 初到深圳工作的一些感受
- 系统学习机器学习之决策树
- HDOJ 1253 胜利大逃亡 (BFS)
- 汇编实现一位数加减乘除