Submission #11309750

---

Source Code Expand

import java.util.Scanner;

public class Main {
    static int n,m;

    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        n=scanner.nextInt();
        m=scanner.nextInt();
        Location Start =new Location();
        Location End=new Location();
        boolean[][] a=new boolean[n+2][m+2];
        String[] s=new String[n];
        for (int i = 0; i < n; i++) {
            s[i]=scanner.next();
        }
        for (int i = 1; i < n+1; i++) {
            for (int j = 1; j < m+1; j++) {
                if(s[i-1].charAt(j-1)=='s'){
                    Start.x=i;
                    Start.y=j;
                    a[i][j]=true;
                }
                else if(s[i-1].charAt(j-1)=='g'){
                    End.x=i;
                    End.y=j;
                    a[i][j]=true;
                }
                else if(s[i-1].charAt(j-1)=='.') a[i][j]=true;

            }
        }
        Queue_Location Q=new Queue_Location(Start);
        boolean flag=false;
        while (!Q.IsEmpty()){
            Location L1=Q.L[Q.front];
            if(L1.x==End.x&&L1.y==End.y){
                System.out.println("Yes");
                flag=true;
                break;
            }
            Q.Delete();
            a[L1.x][L1.y]=false;
            if(a[L1.x+1][L1.y]){
                Location A=new Location();
                A.x=L1.x+1;
                A.y=L1.y;
                Q.Add(A);
            }
            if(a[L1.x-1][L1.y]){
                Location A=new Location();
                A.x=L1.x-1;
                A.y=L1.y;
                Q.Add(A);
            }
            if(a[L1.x][L1.y+1]){
                Location A=new Location();
                A.x=L1.x;
                A.y=L1.y+1;
                Q.Add(A);
            }
            if(a[L1.x][L1.y-1]){
                Location A=new Location();
                A.x=L1.x;
                A.y=L1.y-1;
                Q.Add(A);
            }


        }
        if(!flag) System.out.println("No");



    }




}
class Location{
    int x,y;
}
class Queue_Location{
    int front=0,rear=0,Max=100000;
    Location[] L=new Location[Max];
    Queue_Location(Location Start){
        rear=1;
        L[0]=Start;
    }
    void Add(Location A){
        L[rear]=A;
        rear++;
        if(rear>Max) System.out.println("full");
    }
    void Delete(){
        front++;
    }
    boolean IsEmpty(){
        if(L[front]!=null){
            return false;
        }
        return true;
    }
}

Submission Info

Judge Result