首页 > 其他分享 >Knight Moves POJ-1915 <bfs>

Knight Moves POJ-1915 <bfs>

时间:2023-01-30 11:13:22浏览次数:67  
标签:point int Knight Selected queue succ Moves 1915 clas

Knight Moves

Time Limit: 1000MS   Memory Limit: 30000K
Total Submissions: 37011   Accepted: 17105

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

TUD Programming Contest 2001, Darmstadt, Germany      
#include<iostream>
#include <queue>
#include<cstring>
using namespace std;


typedef struct Node{
    int x,y;
    int clas;
}node;




int delt_x[8]={-2,-2,-1,-1,1,1,2,2};
int delt_y[8]={1,-1,2,-2,2,-2,1,-1};

bool map[305][305];

//queue <node> Selected;  这个queue不能在这定义,因为对于每次bfs应该都是一个全新的空的queue,我说怎么跑不起来

int bfs(int x,int y,int tarx,int tary,int L){



    if(x==tarx&&y==tary){ return 0;}

    queue <node> Selected;
    memset(map,false,sizeof(map));
    node start,temp,succ;
    start.x=x;
    start.y=y;
    start.clas=0;
    Selected.push(start);


    while(!Selected.empty()){  //&&Selected.front().x<L&&Selected.front().y<L
        temp=Selected.front();
        Selected.pop();

        //if(temp.x==tarx&&temp.y==tary){ return temp.clas; }

        for(int i=0;i<8;i++){
                x=temp.x+delt_x[i];
                y=temp.y+delt_y[i];

                if(x<L&&y<L&&x>=0&&y>=0){//点在棋谱内,合法!才能进入queue  之前怎样都跑不通原因在于没有限制x,y>=0这一条例,导致时间太长


                if(map[x][y]==false){

                 if(x==tarx&&y==tary){ return temp.clas+1;}
                 else{
                    map[x][y]=true;
                    succ.x=x;
                    succ.y=y;
                    succ.clas=temp.clas+1;
                    Selected.push(succ);
                 }

                }


                }






        }




    }

    return 0;

}




int main(){

    int N;
    cin>>N;
    int L;
    int x,y,tarx,tary;
    while(N--){

        cin>>L;
        cin>>x>>y;
        cin>>tarx>>tary;

        cout<<bfs(x,y,tarx,tary,L)<<endl;



    }

    return 0;

}
   

标签:point,int,Knight,Selected,queue,succ,Moves,1915,clas
From: https://www.cnblogs.com/walter-mitty/p/17074852.html

相关文章

  • [LeetCode] 2202. Maximize the Topmost Element After K Moves
    Youaregivena 0-indexed integerarray nums representingthecontentsofa pile,where nums[0] isthetopmostelementofthepile.Inonemove,youcan......
  • poj2243 Knight Moves--A*
    原题链接:​​http://poj.org/problem?id=2243​​题意:给定一个起始点和目标点,求按照“日”字走法,最少的步骤。#define_CRT_SECURE_NO_DEPRECATE#include<iostream>#includ......
  • 骑士的移动(Knight Moves)
    ​​KnightMoves​​TimeLimit:3000MS MemoryLimit:Unknown 64bitIOFormat:%lld&%llu​​Submit ​​​​Status​​Description​​​​Afriendofyou......
  • Knights of the Round Table
    #Description给定若干骑士和他们之间的仇恨关系,规定召开圆桌会议时,两个有仇恨的骑士不能坐在相邻位置,且召开一次圆桌会议的骑士人数必须为奇数,求有多少骑士永远不可能参加......
  • Apply Patch 22191577 latest GI PSU to RAC and DB homes using Opatch auto or manu
    Patch22191577:GRIDINFRASTRUCTUREPATCHSETUPDATE11.2.0.4.160119(JAN2016)Unzipthepatch22191577UnziplatestOpatchVersioninoraclehomeandcrshom......
  • UVA1364 Knights of the Round Table | 点双连通分量
    主要就是一个性质:如果一个点双连通分量中有奇环,那么这个点双连通分量中的每个点都在至少一个奇环中。#include<bits/stdc++.h>usingnamespacestd;constintN=100......
  • ABC 243 D - Moves on Binary Tree(树+字符串)
    https://atcoder.jp/contests/abc243/tasks/abc243_d题目大意:给定一颗完全二叉树,他总共可以有(2^10^100)-1个节点,节点下标为1,2,...,(2^10^100)-1。给我们一个长度为n......