POJ 1915 BFS题目
来源:互联网 发布:爱奇艺会员领取软件 编辑:程序博客网 时间:2024/05/24 07:09
经典的BFS题目,题目的链接如下:
http://poj.org/problem?id=1915
Knight Moves
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 24561 Accepted: 11592
Description
Background
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.
Input
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.
Output
For 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 Input
3
8
0 0
7 0
100
0 0
30 50
10
1 1
1 1
Sample Output
5
28
0
Source
题目的大意就是,他是马能够走日,问从起点到终点的最短步数是几。
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <string>#include <algorithm>#include <functional>#include <set>#include <map>#include <queue>#include <stack>#include <vector>using namespace std;const int MAXN = 100000 + 10;int n, sx, sy, ex, ey;int vis[305][305];int dirt[8][2] = {-1, -2, -2, -1, -2, 1, -1, 2, 1, -2, 2, -1, 2, 1, 1, 2};struct node{ int x, y, step;};int judge(int x, int y){ if(x < 0 || x >= n || y < 0 || y >= n) return 1 ; return vis[x][y];}void bfs(){ queue<node>q; node a, b, next; a.x = sx; a.y = sy; a.step = 0; q.push(a); vis[sx][sy] = 1; while(!q.empty()){ b = q.front(); q.pop(); if(b.x == ex && b.y == ey){ cout << b.step << endl; return; } for(int i = 0 ; i < 8 ; i++){ next.x = b.x + dirt[i][0]; next.y = b.y + dirt[i][1]; if(judge(next.x, next.y)) continue; next.step = b.step + 1; q.push(next); vis[next.x][next.y] = 1; } }}//input的第一行是样例的个数,//第二行是棋盘的大小,第三行是起点第四行是终点int main(){ int t ; cin >> t; while(t--){ memset(vis , 0 , sizeof(vis));//每用一次都要置零 cin >> n >> sx >> sy >> ex >> ey ; bfs(); } return 0;}
- POJ 1915 BFS题目
- POJ 题目1915 Knight Moves(双向BFS)
- POJ 题目1101 The Game(bfs)
- POJ 题目3984 迷宫问题(BFS)
- POJ 题目Catch That Cow(BFS)
- POJ 题目2312 Battle City(BFS)
- 这个题目也是经典的BFS算法,题目的链接如下: http://poj.org/problem?id=1915
- poj 1915-BFS
- poj~1915(bfs)
- poj 1915 BFS
- POJ 1915 Knight Moves bfs || 双向bfs
- POJ-3278 && HDU-2717 Catch That Cow 线性BFS题目
- poj 3414 Pots(认为是一道很好的bfs题目)
- poj 1915 bfs(骑士移动)
- POJ 1915 Knight Moves bfs
- POJ 1915Knight Moves(BFS)
- poj 1915 Knight Moves(bfs)
- poj 1915 bfs 模板化
- 【NOIP2012】 Vigenère密码
- soft raid5阅读笔记之九--MD中的superblock
- 过滤器的使用:下载计数过滤器
- Android全部源码导入Eclipse
- 微信错误:errcode=45015, errmsg=response out of time limit or subscription is canceled
- POJ 1915 BFS题目
- soft raid5阅读笔记之十--状态标志
- Android之AsyncTask异步加载(三)
- Spring之AOP面向切面编程实现(一)
- LLDB之理解LLDB基本命令语法
- 【VS开发】动态创建ActiveX控件
- eclipse编写java时printf出现错误
- 【VS开发】windows注册ActiveX控件
- soft raid5阅读笔记之十一--RAID6