hdu 1372 Knight Moves
来源:互联网 发布:一直在启动windows 编辑:程序博客网 时间:2024/05/16 11:50
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.
e2 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 f6
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<queue>#include<stack>#include<math.h>#include<stdio.h>#include<numeric>//STL数值算法头文件#include<stdlib.h>#include<string.h>#include<iostream>#include<algorithm>#include<functional>//模板类头文件using namespace std;int startx,starty,endx,endy;char a[3],c[3];int b[100][100];int dir[8][2]= {1,2,2,1,2,-1,1,-2,-1,-2,-2,-1,-2,1,-1,2};//往八个方向搜struct node{ int x,y,step;};void bfs(int x,int y){ node st,ed; memset(b,0,sizeof(b)); queue<node>q; st.x=x; st.y=y; st.step=0; b[st.x][st.y]=1; q.push(st); while(!q.empty()) { st=q.front(); q.pop(); if(st.x==endx&&st.y==endy) { printf("To get from %s to %s takes %d knight moves.\n",a,c,st.step); return; } for(int k=0; k<8; k++) { ed.x=st.x+dir[k][0]; ed.y=st.y+dir[k][1]; if(ed.x>=1&&ed.x<=8&&ed.y>=1&&ed.y<=8&&!b[ed.x][ed.y]) { b[ed.x][ed.y]=1; ed.step=st.step+1; q.push(ed); } } }}int main(){ while(~scanf("%s%s",a,c)) { startx=a[0]-'a'+1;//把字母转化为数字模拟地图 starty=a[1]-'0'; endx=c[0]-'a'+1; endy=c[1]-'0'; bfs(startx,starty); } return 0;}
0 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
- 龟兔赛跑预测
- Base64编码
- Fedora-Workstation-Live-x86_64-25-1.3环境下安装Linux64位版本的DrClient
- Google EventBus 使用详解
- Parasoft C++test使用教程:测试用例生成(上)
- hdu 1372 Knight Moves
- CSS3布局 —— Columns
- CXF系列(五):soap与rest的比较
- H3 BPM Sheet表单 NTKO功能使用说明
- ubuntu12.04安装opencv3.2.0
- 误删除VMware虚拟机vmdk文件的恢复方法
- MULE 连接sap rfc接口开发二:调用rfc接口
- 使用Java原生代理实现数据注入
- java log4j配置详解