poj 2243 Knight Moves
来源:互联网 发布:怎么添加打印机端口 编辑:程序博客网 时间:2024/06/10 05:37
Knight Moves
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11794 Accepted: 6646
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 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.
题意:国际象棋中,给出骑士的起始位置和目标位数,求骑士最少走几步就能到达目标位置。
解题思路:简单bfs,不明白为什么用c++提交TLE,G++提交AC;
#include <iostream>#include <queue>#include <string.h>#include <stdio.h>using namespace std;struct point{int x,y;int step;};int a[]={-1, 1,-2, 2,-2, 2,-1, 1};int b[]={-2,-2,-1,-1, 1, 1, 2, 2};bool map[10][10];int bfs(point start,point end){queue<point> q;start.step=0;q.push(start);while (q.size()){point p=q.front();if (p.x==end.x && p.y==end.y){return p.step;}for (int i=0;i<8;i++){if (p.x+a[i]<0 || p.x+a[i]>7 || p.y+b[i]<0 || p.y+b[i]>7 || map[p.x+a[i]][p.y+b[i]]==true)continue;point s;s.x=p.x+a[i];s.y=p.y+b[i];s.step=p.step+1;q.push(s);}map[p.x][p.y]=true;q.pop();}return -1;}int main(){char start[3],end[3];while (cin>>start>>end){memset(map,false,sizeof(map));point starts,ends;starts.x=start[0]-'a';starts.y=start[1]-'1';ends.x=end[0]-'a';ends.y=end[1]-'1';cout<<"To get from "<<start<<" to "<<end<<" takes "<<bfs(starts,ends)<<" knight moves."<<endl;}return 0;}
0 0
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- poj 2243 Knight Moves
- poj 2243 Knight Moves
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- POJ-2243-Knight Moves
- poj 2243 Knight Moves
- poj 2243:Knight Moves
- POJ 2243 Knight Moves
- poj-- 2243 Knight Moves
- POJ 2243 Knight Moves
- poj 2243 Knight Moves
- POJ 2243 Knight Moves
- POJ 2243 - Knight Moves
- POJ 2243 Knight Moves
- 题目1554:区间问题
- 用Python开始机器学习(4:KNN分类算法)
- SharePoint 2013 REST 服务使用简介
- 简单文章发布系统(4)
- Linux命令英文全称
- poj 2243 Knight Moves
- UVA - 10801 Lift Hopping (Dijkstra)
- 容器 第二节 重写equals和hashCode方法
- hibernate之13.hql(二)
- GitHub 优秀的 Android 开源项目
- HDU 5011 Game 【Nim博弈】
- codeforces 476c Dreamoon and Sums
- opengl教程
- CodeForces 486C Palindrome Transformation