Submission #420212


Source Code Expand

using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

class Program
{
    static readonly int[] DR = { 0, 1, 0, -1 };
    static readonly int[] DC = { 1, 0, -1, 0 };
    int H, W;
    string[] Grid;
    bool[,] seen;

    public void Solve()
    {
        H = Reader.Int();
        W = Reader.Int();
        Grid = Reader.StringArray(H);
        seen = new bool[H, W];
        for (int r = 0; r < H; r++)
            for (int c = 0; c < W; c++)
                if (Grid[r][c] == 's' && DFS(r, c))
                {
                    Console.WriteLine("Yes");
                    return;
                }
        Console.WriteLine("No");
    }

    private bool DFS(int r, int c)
    {
        seen[r, c] = true;
        for (int d = 0; d < DR.Length; d++)
        {
            int nr = r + DR[d], nc = c + DC[d];
            if (IsInside(nr, nc))
            {
                if (Grid[nr][nc] == 'g' || !seen[nr, nc] && Grid[nr][nc] == '.' && DFS(nr, nc)) return true;
            }
        }
        return false;
    }

    bool IsInside(int r, int c) { return r >= 0 && r < H && c >= 0 && c < W; }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    private static TextReader reader = Console.In;
    private static readonly char[] separator = { ' ' };
    private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    private static string[] A = new string[0];
    private static int i;
    private static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public static string Line() { return reader.ReadLine().Trim(); }
    private static string[] Split(string s) { return s.Split(separator, op); }
    private static string Next() { CheckNext(); return A[i++]; }
    private static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}

Submission Info

Submission Time
Task A - 深さ優先探索
User eitaho
Language C# (Mono 3.2.1.0)
Score 100
Code Size 3057 Byte
Status AC
Exec Time 173 ms
Memory 23240 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 83
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt
Case Name Status Exec Time Memory
00_min_01.txt AC 123 ms 9732 KB
00_min_02.txt AC 124 ms 9628 KB
00_min_03.txt AC 123 ms 9628 KB
00_min_04.txt AC 127 ms 9756 KB
00_min_05.txt AC 121 ms 9624 KB
00_min_06.txt AC 123 ms 9740 KB
00_min_07.txt AC 125 ms 9632 KB
00_min_08.txt AC 128 ms 9728 KB
00_sample_01.txt AC 127 ms 9628 KB
00_sample_02.txt AC 173 ms 9728 KB
00_sample_03.txt AC 125 ms 9744 KB
00_sample_04.txt AC 123 ms 9628 KB
00_sample_05.txt AC 122 ms 9752 KB
01_rnd_00.txt AC 132 ms 10152 KB
01_rnd_01.txt AC 140 ms 13164 KB
01_rnd_02.txt AC 140 ms 12824 KB
01_rnd_03.txt AC 150 ms 18052 KB
01_rnd_04.txt AC 159 ms 20616 KB
01_rnd_05.txt AC 136 ms 10152 KB
01_rnd_06.txt AC 158 ms 13300 KB
01_rnd_07.txt AC 139 ms 11288 KB
01_rnd_08.txt AC 137 ms 10220 KB
01_rnd_09.txt AC 135 ms 10204 KB
01_rnd_10.txt AC 150 ms 10776 KB
01_rnd_11.txt AC 132 ms 10264 KB
01_rnd_12.txt AC 143 ms 12460 KB
01_rnd_13.txt AC 152 ms 16540 KB
01_rnd_14.txt AC 131 ms 10264 KB
01_rnd_15.txt AC 149 ms 12028 KB
01_rnd_16.txt AC 134 ms 10176 KB
01_rnd_17.txt AC 151 ms 11540 KB
01_rnd_18.txt AC 132 ms 10156 KB
01_rnd_19.txt AC 165 ms 23240 KB
02_rndhard_00.txt AC 132 ms 10260 KB
02_rndhard_01.txt AC 135 ms 10152 KB
02_rndhard_02.txt AC 140 ms 10268 KB
02_rndhard_03.txt AC 137 ms 10260 KB
02_rndhard_04.txt AC 137 ms 10156 KB
02_rndhard_05.txt AC 132 ms 10192 KB
02_rndhard_06.txt AC 133 ms 10172 KB
02_rndhard_07.txt AC 132 ms 10264 KB
02_rndhard_08.txt AC 130 ms 10268 KB
02_rndhard_09.txt AC 132 ms 10264 KB
02_rndhard_10.txt AC 132 ms 10268 KB
02_rndhard_11.txt AC 133 ms 10264 KB
02_rndhard_12.txt AC 129 ms 10264 KB
02_rndhard_13.txt AC 136 ms 10268 KB
02_rndhard_14.txt AC 131 ms 10232 KB
02_rndhard_15.txt AC 130 ms 10268 KB
02_rndhard_16.txt AC 132 ms 10240 KB
02_rndhard_17.txt AC 131 ms 10152 KB
02_rndhard_18.txt AC 129 ms 10208 KB
02_rndhard_19.txt AC 128 ms 10264 KB
02_rndhard_20.txt AC 131 ms 10264 KB
02_rndhard_21.txt AC 132 ms 10268 KB
02_rndhard_22.txt AC 131 ms 10264 KB
02_rndhard_23.txt AC 132 ms 10264 KB
02_rndhard_24.txt AC 135 ms 10156 KB
02_rndhard_25.txt AC 133 ms 10232 KB
02_rndhard_26.txt AC 132 ms 10264 KB
02_rndhard_27.txt AC 132 ms 10260 KB
02_rndhard_28.txt AC 132 ms 10244 KB
02_rndhard_29.txt AC 134 ms 10152 KB
02_rndhard_30.txt AC 131 ms 10264 KB
02_rndhard_31.txt AC 131 ms 10152 KB
02_rndhard_32.txt AC 132 ms 10264 KB
02_rndhard_33.txt AC 132 ms 10264 KB
02_rndhard_34.txt AC 132 ms 10156 KB
02_rndhard_35.txt AC 132 ms 10152 KB
02_rndhard_36.txt AC 131 ms 10280 KB
02_rndhard_37.txt AC 129 ms 10148 KB
02_rndhard_38.txt AC 134 ms 10216 KB
02_rndhard_39.txt AC 134 ms 10248 KB
03_rndhardsmall_00.txt AC 124 ms 9736 KB
03_rndhardsmall_01.txt AC 125 ms 9624 KB
03_rndhardsmall_02.txt AC 122 ms 9648 KB
03_rndhardsmall_03.txt AC 123 ms 9668 KB
03_rndhardsmall_04.txt AC 122 ms 9764 KB
03_rndhardsmall_05.txt AC 121 ms 9628 KB
03_rndhardsmall_06.txt AC 123 ms 9632 KB
03_rndhardsmall_07.txt AC 122 ms 9632 KB
03_rndhardsmall_08.txt AC 122 ms 9712 KB
03_rndhardsmall_09.txt AC 122 ms 9680 KB