結果

問題 No.86 TVザッピング(2)
コンテスト
ユーザー EmKjp
提出日時 2015-04-29 05:35:45
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 601 ms / 5,000 ms
コード長 4,865 bytes
コンパイル時間 940 ms
コンパイル使用メモリ 117,172 KB
実行使用メモリ 49,900 KB
最終ジャッジ日時 2025-06-20 13:58:58
合計ジャッジ時間 4,200 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;

partial class Solver {
    bool Try(char[,] map) {
        int[] dx = new int[] { 0, -1, 0, 1 };
        int[] dy = new int[] { 1, 0, -1, 0 };
        int buttonCount = map.Cast<char>().Count(c => c == '.');
        int height = map.GetLength(0);
        int width = map.GetLength(1);
        for (int i = 0; i < map.GetLength(0); i++) {
            for (int j = 0; j < map.GetLength(1); j++) {
                if (map[i, j] == '#') continue;
                int step = 0;
                int row = i, col = j;
                var visited = new bool[height, width];
                for (int k = 0; k < 8; k++) {
                    bool moved = false;
                    while (true) {
                        int nRow = row + dy[k % 4];
                        int nCol = col + dx[k % 4];
                        if (0 <= nRow && nRow < height && 0 <= nCol && nCol < width && map[nRow, nCol] == '.' && !visited[nRow, nCol]) {
                            row = nRow;
                            col = nCol;
                            visited[row, col] = true;
                            step++;
                            moved = true;
                        } else {
                            break;
                        }
                    }
                    if (!moved) break;
                }

                if (step == buttonCount && row == i && col == j) {
                    return true;
                }
            }
        }
        return false;
    }

    T[,] Rotate<T>(T[,] array) {
        int height = array.GetLength(0);
        int width = array.GetLength(1);
        var result = new T[width, height];
        for (int i = 0; i < height; i++) {
            for (int j = 0; j < width; j++) {
                result[j, height - i - 1] = array[i, j];
            }
        }
        return result;
    }

    public void Run() {
        int N = ni();
        int M = ni();
        var A = NextArray(N);

        var map = new char[N, M];
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                map[i, j] = A[i][j];
            }
        }

        bool ans = false;
        for (int i = 0; i < 4; i++) {
            if (Try(map)) {
                ans = true;
                break;
            }
            map = Rotate(map);
        }
        cout.WriteLine(ans ? "YES" : "NO");
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() {
        return NextInt();
    }
    public long nl() {
        return NextLong();
    }
    public string ns() {
        return Next();
    }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0