Submission #420958

---

Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ATC
{
    class Program
    {
        static void Main(string[] args)
        {

            //int H, W;
            bool GF = false;

            search s = new search();

            string[] str = Console.ReadLine().Split(' ');
            s.H = int.Parse(str[0]);  
            s.W = int.Parse(str[1]);

            int startx = 0;
            int starty = 0;

            int[,] c = new int[s.H, s.W];

            for (int i = 0;i<s.H;i++)
            {
                str = Console.ReadLine().Split(' ');
                for(int j = 0;j<s.W;j++)
                {
                    c[i,j] = int.Parse(str[j]);
                    if(c[i,j] == 's')
                    {
                        startx = i;
                        starty = j;
                    }
                }
            }

            s.searcher(startx, starty);

            for (int i = 0; i < s.H; i++)
            {       
                for (int j = 0; j < s.W; j++)
                {
                    if (s.F[i, j] == true)
                    {
                        if(c[i,j] == 'g')
                        {
                            GF = true;
                            break;
                        }
                    }
                }
            }
            if (GF)
            {
                Console.WriteLine("Yes");
            }
            else
            {
                Console.WriteLine("No");
            }
        }



        public class search
        {
            public int H, W;
            public bool[,] F = new bool[500, 500];

            public void searcher(int x, int y)
            {
                if (x < 0 || y < 0 || x > H || y > W)
                {
                    return;
                }
                if (F[x,y])
                {
                    return;
                }

                searcher(x - 1, y);
                searcher(x, y - 1);
                searcher(x + 1, y);
                searcher(x, y + 1);

                F[x, y] = true;

            }
        }

    }
}

Submission Info

Judge Result