TOJ 1736.Knight Moves
来源:互联网 发布:咸安淘宝开店培训学校 编辑:程序博客网 时间:2024/05/21 18:45
题目链接:http://acm.tju.edu.cn/toj/showp2132.html
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 1600 Accepted Runs: 823
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?
The Problem
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov.
For people not familiar with chess, the possible knight moves are shown in Figure 1.
The input begins with the number n of scenarios on a single line by itself.
Next follow n scenarios. Each scenario consists of three lines containing integer numbers. The first line specifies the length l of a side of the chess board (4 ≤ l ≤ 300). The entire board has size l * l. The second and third line contain pair of integers {0, ..., l-1}*{0, ..., l-1} specifying the starting and ending position of the knight on the board. The integers are separated by a single blank. You can assume that the positions are valid positions on the chess board of that scenario.
OutputFor each scenario of the input you have to calculate the minimal amount of knight moves which are necessary to move from the starting point to the ending point. If starting point and ending point are equal,distance is zero. The distance must be written on a single line.
Sample Input380 07 01000 030 50101 11 1Sample Output
5280
Source: TUD Programming Contest 2001
#include <stdio.h>#include <queue>#include <string.h>using namespace std;int to[8][2] = {-1,-2,-2,-1,-2,1,-1,2,1,-2,2,-1,2,1,1,2};int vis[400][400],n,sx,sy,ex,ey;struct node{int x,y,step;};int check(int x,int y){if(x<0||x>=n||y<0||y>=n)return 1;return vis[x][y];}void bfs(){memset(vis,0,sizeof(vis));node a,next;queue<node> Q;a.x=sx;a.y=sy;a.step=0;vis[sx][sy]=1;Q.push(a);while(!Q.empty()){a=Q.front();Q.pop();if(a.x==ex&&a.y==ey){printf("%d\n",a.step);return ;}for(int i=0;i<8;i++){next=a;next.x=a.x+to[i][0];next.y=a.y+to[i][1];if(check(next.x,next.y))continue;next.step = a.step+1;vis[next.x][next.y]=1;Q.push(next);}}}int main(){int t;scanf("%d",&t);while(t--){scanf("%d%d%d%d%d",&n,&sx,&sy,&ex,&ey);bfs();}}
- TOJ 1736.Knight Moves
- TOJ 1132 Knight Moves BFS求最短路径
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- Knight Moves
- [Codeforces #369 (Div. 2)E. ZS and The Birthday Paradox]勒让德定理+逆元
- 国内一流互联网面试题
- 数据结构-顺序表(C语言)
- Quartz 2D编程指南之二:图形上下文(Graphics Contexts)
- js记录用户在网站的浏览记录和停留时间
- TOJ 1736.Knight Moves
- Linux下JNI尝试
- 2016.09.01
- 百度地图植入android应用系列教程一植入百度地图
- 百度地图植入android应用系列教程二实现百度地图定位及方向传感器
- 百度地图植入android应用系列教程三实现百度地图上的覆盖物Marker与InfoWindow的使用
- 百度地图植入android应用系列教程四实现引入离线地图功能
- iOS简历中专业技能应该怎么写
- POJ 2425 A Chess Game(博弈)