搜索算法NYOJ-Oh, my goddess bfs+优先队列

淩亂°似流年 2022-06-01 13:57 172阅读 0赞

## Oh, my goddess ##

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 3

描述

Shining Knight is the embodiment of justice and he has a very sharp sword can even cleavewall. Many bad guys are dead on his sword.

One day, two evil sorcerer cgangee and Jackchess decided to give him some colorto see. So they kidnapped Shining Knight's beloved girl--Miss Ice! They built a M x Nmaze with magic and shut her up in it.

Shining Knight arrives at the maze entrance immediately. He can reach any adjacent emptysquare of four directions -- up, down, left, and right in 1 second. Or cleave one adjacent wall in 3

seconds, namely,turn it into empty square. It's the time to save his goddess! Notice: ShiningKnight won't leave the maze before he find Miss Ice.

输入

The input consists of blocks of lines. There is a blank line between two blocks.  
  
The first line of each block contains two positive integers M <= 50 and N <= 50separated by one space. In each of the next M lines there is a string of length N contentsO and \#.  
  
O represents empty squares. \# means a wall.  
  
At last, the location of Miss Ice, ( x, y ). 1 <= x <= M, 1 <= y <= N.  
  
(Shining Knight always starts at coordinate ( 1, 1 ). Both Shining and Ice's locationguarantee not to be a wall.)

输出

The least amount of time Shining Knight takes to save hisgoddess in one line.

样例输入

3 5
    O####
    #####
    #O#O#
    3 4

样例输出

来源

[郑大第六届校赛][Link 1]

水题，只是给出了起始坐标，bfs+优先队列很简单

代码：

#include<stack>
    #include<queue>
    #include<math.h>
    #include<stdio.h>
    #include<stdlib.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    char map[100][100];
    int mark[101][101];
    struct node
    {
        int x,y,step;
        friend bool operator<(node a,node b)
        {
            return a.step>b.step;
        }
    } a,next;
    int m,n,end_x,end_y,ans=0;
    int move[4][2]= {
          {0,1},{0,-1},{1,0},{-1,0}};
    int bfs(int c,int d)
    {
        priority_queue<node>Q;
        a.x=c;
        a.y=d;
        a.step=0;
        Q.push(a);
        mark[a.x][a.y]=1;
        while(!Q.empty())
        {
            a=Q.top();
            Q.pop();
            if(a.x==end_x&&a.y==end_y)
                return a.step;
            for(int i=0; i<4; i++)
            {
                next.x=a.x+move[i][0];
                next.y=a.y+move[i][1];
                if(next.x>=1&&next.y>=1&&next.x<=m&&next.y<=n&&!mark[next.x][next.y])
                {
                    if(map[next.x][next.y]=='#')
                        next.step=a.step+4;
                    if(map[next.x][next.y]=='O')
                        next.step=a.step+1;
                    Q.push(next);
                    mark[next.x][next.y]=1;
                }
    
            }
        }
        return 0;
    }
    int main()
    {
        while(scanf("%d%d",&m,&n)!=EOF)
        {
            int i,j;
            memset(mark,0,sizeof(mark));
            for(i=1; i<=m; i++)
            {
                getchar();
                for(j=1; j<=n; j++)
                {
                    scanf("%c",&map[i][j]);
                }
            }
            scanf("%d%d",&end_x,&end_y);
            printf("%d\n",bfs(1,1));
        }
        return 0;
    }

[Link 1]: http://acm.nyist.edu.cn/JudgeOnline/search_result.php?source=%E9%83%91%E5%A4%A7%E7%AC%AC%E5%85%AD%E5%B1%8A%E6%A0%A1%E8%B5%9B