hdu-1372-Knight Moves
来源:互联网 发布:python安装包怎么下载 编辑:程序博客网 时间:2024/05/17 09:28
题目大意:在行是(1-8)列是(a-h)的棋盘里,马要几步从第一的输入数据跳到第二个输入数据。简单广搜
Knight Moves
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5028 Accepted Submission(s): 3075
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.
#include <iostream>#include <cstring>#include <queue>#include <cstdio>using namespace std;struct nobe{ int x,y,temp;};int go[8][2]={2,1,2,-1,-2,1,-2,-1,1,2,-1,2,1,-2,-1,-2};int n,m,n1,m1,map[10][10],visit[10][10],d[1000];void BFS(){ int i; queue<nobe>q; nobe que,ue; que.x=n; que.y=m; que.temp=0; q.push(que); while(!q.empty()) { que=q.front(); q.pop(); if(que.x==n1&&que.y==m1) { return ; } for(i=0;i<8;i++) { ue=que; ue.x+=go[i][0]; ue.y+=go[i][1]; if(ue.x>0&&ue.x<=8&&ue.y>0&&ue.y<=8&&!visit[ue.x][ue.y]) { visit[ue.x][ue.y]=1; ue.temp=que.temp+1; d[ue.x*8+ue.y]=ue.temp; q.push(ue); } } }}int main(){ char qa,qb; while(~scanf("%c%d %c%d",&qa,&m,&qb,&m1)) { n=qa-'a'+1; n1=qb-'a'+1; memset(visit,0,sizeof(visit)); memset(d,0,sizeof(d)); visit[n][m]=1; BFS(); printf("To get from %c%d to %c%d takes %d knight moves.\n",qa,m,qb,m1,d[n1*8+m1]); getchar(); }}
- 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
- git study
- linux下使用iconv转换编码:UTF8转GBK
- 图片的轮换效果,自己留个备份,需要的看一下
- 学习ios MVC设计模式的小结
- 验证码函数
- hdu-1372-Knight Moves
- timus 1513. Lemon Tale URAL 解题报告
- a service bind method
- Linux操作系统下终端乱码解决方案
- MySQL主从复制(Master-Slave)与读写分离(MySQL-Proxy)实践
- 矛与盾:黑客攻防命令大曝光
- Android有用代码片段(一)(二)....
- iis设置开启GZIP网页压缩功能
- java递归算法实现