hdu 1372 Knight Moves(广搜)
来源:互联网 发布:淘宝卖家怎么取消店铺 编辑:程序博客网 时间:2024/06/01 09:53
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3001 Accepted Submission(s): 1868
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
Recommend
Eddy
典型的广搜题目,复习时写点,感觉有点生疏了,不过还行,一次过了。
代码:
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int tx[]={1,-1,2,-2,1,-1,2,-2};const int ty[]={2,2,1,1,-2,-2,-1,-1};class A{ public: int x,y,step;};A map[100000];bool vis[15][15];int x_start,y_start,x_end,y_end;int ans;int bfs(){ if(x_start==x_end&&y_start==y_end) return 0; ans=0; int front=0,rear=1; int dx,dy; dx=x_start; dy=y_start; map[0].x=x_start; map[0].y=y_start; map[0].step=1; vis[dx][dy]=1; while(front<rear) { for(int i=0;i<8;i++) { dx=map[front].x+tx[i]; dy=map[front].y+ty[i]; if(dx>8||dx<1||dy>8||dy<1||vis[dx][dy]) continue; if(dx==x_end&&dy==y_end) return map[front].step; map[rear].x=dx;map[rear].y=dy; map[rear].step=map[front].step+1; rear++; } front++; } return 0;}int main(){ //freopen("4.txt","r",stdin); char start,end; while(scanf("%c%d %c%d",&start,&y_start,&end,&y_end)!=EOF) { getchar(); x_start=start-'a'+1; x_end=end-'a'+1; memset(vis,0,sizeof(vis)); int z=bfs(); printf("To get from %c%d to %c%d takes %d knight moves.\n",start,y_start,end,y_end,z); }}
- hdu 1372 Knight Moves(广搜)
- hdu 1372 Knight Moves(广搜)
- HDU 1372---- Knight Moves (广搜)
- HDU 1372 Knight Moves【广搜】
- HDU 1372 Knight Moves(广搜BFS)
- HDOJ 1372 Knight Moves(BFS 广搜)
- 1915 Knight Moves 广搜
- 简单广搜:Knight Moves
- HDU 1372 knight moves
- HDU 1372 Knight Moves
- HDU-1372-Knight Moves
- hdu 1372 Knight Moves
- HDU 1372 Knight Moves
- hdu 1372 Knight Moves
- Hdu 1372 Knight Moves
- HDU 1372 Knight Moves
- HDU 1372 Knight Moves
- HDU-1372Knight Moves
- android面试题
- UserFeedbackSettings1
- CFileDialog
- yum
- MainActivity
- hdu 1372 Knight Moves(广搜)
- UserFeedbackSettings2
- UserFeedbackSettings3
- user.xml
- Linux线程检测
- 基于Java容器类的线程安全编程
- 黑马程序员—— 装饰设计模式
- 不弹出虚拟键盘挡住界面
- Jquery UI widget使用技巧一点