hdu 1372 Knight Moves bfs搜索 解题报告
来源:互联网 发布:云物流软件 编辑:程序博客网 时间:2024/05/22 00:11
Knight Moves
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9472 Accepted Submission(s): 5565
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.
Source
University of Ulm Local Contest 1996
代码:
#include <cstdio>#include <iostream>#include <queue>#include <algorithm>#include <cstring>#include <stack>#include <cmath>using namespace std;int fx[8][2]={1,2,1,-2,-1,2,-1,-2,2,1,2,-1,-2,1,-2,-1};int vis[50][50];int sx,sy,ex,ey;struct zc{ int x,y,step;};int check(zc t){ if(t.x<1||t.x>8||t.y<1||t.y>8)return 0; return 1;}int bfs(){ zc t,p; t.x=sx; t.y=sy; t.step=0; queue<zc>Q; Q.push(t); while(!Q.empty()) { t=Q.front(); Q.pop(); if(t.x==ex&&t.y==ey)return t.step; for(int i=0;i<8;i++) { p.x=t.x+fx[i][0]; p.y=t.y+fx[i][1]; p.step=t.step+1; if(check(p)&&!vis[p.x][p.y]) { Q.push(p); vis[p.x][p.y]=1; } } } return -1;}int main(){ char a[20],b[20]; while(scanf("%s %s",a,b)!=EOF) { memset(vis,0,sizeof(vis)); sx=a[0]-'a'+1; sy=a[1]-'0'; ex=b[0]-'a'+1; ey=b[1]-'0'; printf("To get from %s to %s takes %d knight moves.\n",a,b,bfs()); } return 0;}
0 0
- hdu 1372 Knight Moves bfs搜索 解题报告
- hdu 1372 bfs Knight Moves
- HDU-1372 Knight Moves (BFS)
- HDU-1372 Knight Moves (BFS)
- HDU 1372 Knight Moves【BFS】
- HDU 1372 Knight Moves(BFS)
- HDU 1372--Knight Moves【BFS】
- hdu 1372 Knight Moves(bfs)
- hdu 1372 Knight Moves(BFS)
- #HDU 1372 Knight Moves 【BFS】
- Knight Moves(HDU 1372)(BFS)
- HDU-1372Knight Moves(BFS)
- hdu-1372-Knight Moves(BFS)
- HDU 1372 广度优先搜索(BFS) Knight Moves
- HDU 1372 Knight Moves 广度优先搜索 bfs
- Knight Moves 解题报告
- Knight Moves hdu BFS
- hdu Knight Moves(bfs)
- Oracle中decode函数用法
- 通过包名,直接精确启动一个三方Activity
- 微信支付插件使用
- 深度学习Deep Learning: dropout策略防止过拟合
- 详说Angular之指令(directive)
- hdu 1372 Knight Moves bfs搜索 解题报告
- 解决imagettftext()因为–enable-gd-jis-conv导致乱码的另一种方法
- 使用matlab时出现Out of memory问题的解决
- 超级简单的接口回调
- Cocos 2.2.3 ScrollView浅谈
- Linux C高级编程——网络编程之API(5)
- 中间文字两边横线
- web开发相关技术小结
- JAVA的ReentrantLock与synchronized 的区别