hdu-1372 Knight Moves
来源:互联网 发布:稀疏编码算法 详解 编辑:程序博客网 时间:2024/05/17 19:17
Knight Moves
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11459 Accepted Submission(s): 6738
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.
题意:
分析:广度优先搜索题
题意如图所示:一个棋子(骑士)可以有八个方向走,广搜确定最小的走的步数。
#include <iostream>#include <string.h>#include <cstdio>#include <queue>using namespace std;int x1,x2,y1,y2;char st1,st2;int cx[8][2]={1,2,2,1,1,-2,2,-1,-1,-2,-2,-1,-1,2,-2,1};struct node{ int x; int y; int step;}now;void bfs(){ //cout<<now.x<<"~"<<now.y<<"~"<<x2<<"~"<<y2<<endl; queue<node>q; node next; int i,j; q.push(now); while (!q.empty()) { now = q.front(); q.pop(); if (now.x==x2&&now.y==y2) { printf ("To get from %c%d to %c%d takes %d knight moves.\n",st1,y1,st2,y2,now.step); return; } for (i=0;i<8;i++) { next.x = now.x+cx[i][0]; next.y = now.y+cx[i][1]; if (next.x>=1&&next.x<=8&&next.y>=1&&next.y<=8) { next.step = now.step+1; q.push(next); } } } //cout<<"~~~~"<<endl;}int main(){ int ch1,ch2; while (scanf("%c%d %c%d",&st1,&ch1,&st2,&ch2)!=EOF) { //getchar(); //cout<<st2<<endl; x1 = st1-'a'+1; x2 = st2-'a'+1; y1 = ch1; y2 = ch2; //cout<<x2<<endl; now.x = x1; now.y = y1; now.step = 0; //cout<<now.x<<"~"<<now.y<<"~"<<x2<<"~"<<y2<<endl; bfs(); } return 0;}
- 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
- 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
- (2)初识看板
- 装饰者模式
- python构造方法
- 读《SeqSLAM: Visual Route-Based Navigation for Sunny Summer Days and Stormy Winter Nights》
- caioj1092: 并查集(模版 家族)
- hdu-1372 Knight Moves
- 2017山东省赛A题(SDUT3893威佐夫博弈+尼姆博奕)
- nginx日志格式配置
- 仿今日头条的频道管理
- CentOS 上 Jenkins 安装
- GIT 学习笔记
- 程序的编译和链接过程
- Bounding box Regression详解
- 韩信点兵