hdu 1372 Knight Moves(最基本的BFS)
来源:互联网 发布:mac开机问号文件夹 编辑:程序博客网 时间:2024/04/28 13:00
1、http://acm.hdu.edu.cn/showproblem.php?pid=1372
2、题目大意:给定一个棋盘,列用a--h表示,行用1-8表示,题目给定一个起始位置一个结束位置,求出从起始位置到结束位置用多少步;
3、最基本的BFS代码,留作模板用。。。、
题目:
Knight Moves
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4969 Accepted Submission(s): 3032
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.
4、ac代码:
#include<stdio.h>#include<string.h>char s[5];char e[5];int sx,sy,ex,ey;int visit[9][9];int dir[8][2]= {1,2,2,1,2,-1,1,-2,-1,-2,-2,-1,-2,1,-1,2};struct node{ int x; int y; int step;} knight[70];int bfs(int n){ memset(visit,0,sizeof(visit)); node cur,change; knight[0].x=sx; knight[0].y=sy; knight[0].step=0; int start=0,end=1; while(start<end) { cur=knight[start++]; if(cur.x==ex &&cur.y==ey) { return cur.step; } else { for(int i=0; i<8; i++) { int tx=cur.x+dir[i][0]; int ty=cur.y+dir[i][1]; if(tx>=1 && tx<=8 && ty>=1 && ty<=8 && visit[tx][ty]==0) { visit[tx][ty]=1; change.x=tx; change.y=ty; change.step=cur.step+1; knight[end++]=change; } } }}}int main(){ while(scanf("%s%s",s,e)!=EOF) { sx=s[1]-'0'; sy=s[0]-'a'+1; ex=e[1]-'0'; ey=e[0]-'a'+1; //printf("%d %d %d %d\n",sx,sy,ex,ey); printf("To get from %s to %s takes %d knight moves.\n",s,e,bfs(8)); } return 0;}
- hdu 1372 Knight Moves(最基本的BFS)
- HDU 1372 Knight Moves BFS求马走的最短路径
- HDU 1372Knight 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)
- Knight Moves hdu BFS
- hdu Knight Moves(bfs)
- hdu 1372 Knight Moves 骑士的移动 bfs--马走日
- 怎么快速去掉代码行前的数字
- 没有对“C:\WINDOWS\Microsoft.NET\Framework\v2.0.50727\Temporary ASP.NET Files”的写访问权限
- PostgreSQL的中文全文检索
- URAL - 1108 Heritage(大数)
- 子窗口使用父窗口的控件
- hdu 1372 Knight Moves(最基本的BFS)
- Android selector item 属性大全
- Hibernate映射自定义数据类型
- SecureCRT的sz/rz工具包
- Java Web 高性能开发,第 1 部分: 前端的高性能
- Codeforces Round #194 (Div. 2) A. Candy Bags
- sed的替换操作
- Ubuntu解压命令方法
- OpenStack云计算快速入门之三:OpenStack镜像管理