hdu 1372 Knight Moves bfs搜索 解题报告
2016-04-01 17:38
218 查看
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.
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 e4 a1 b2 b2 c3 a1 h8 a1 h7 h8 a1 b1 c3 f6 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
分析:bfs果题,走日形,8个方向都可以走,无限制。
代码:
#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; }
相关文章推荐
- [svc][op]Ubuntu初始化安装-py用机器优化
- 微信支付插件使用
- Acitivity切换黑屏
- Android ActionBar应用实战,高仿微信主界面的设计
- 通过包名,直接精确启动一个三方Activity
- unexpected '@' in member unxpected '@' in program
- webclient 爬虫bug
- 找回曾经的感觉
- 详说Angular之指令(directive)
- HDU3336-Count the string(KMP)
- 牛人 就是这样锤炼出来的,中兴资深工程师,嵌入式专家韦东山是这样炼成的!
- 嵌入式ARM开发平台-迅为最新iTOP-4418开发板
- 子线程更新UI画面的方法
- 【JAVA开发之IO流1-6】IO流之File类的用法
- Glide之Target
- 12c 应答方式安装数据库的一点补充already exists. Specify another SID
- Java 技术新手入门-Java 初学者的入门指南
- Android 5.0 CardView+ListView 卡片布局应用
- 关于 Unity 中 ModelImporter.optimizeGameObjects
- COM编程入门