結果

問題 No.228 ゆきこちゃんの 15 パズル
ユーザー EmKjp
提出日時 2015-06-19 22:34:16
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 42 ms / 5,000 ms
コード長 5,248 bytes
コンパイル時間 918 ms
コンパイル使用メモリ 115,760 KB
実行使用メモリ 30,828 KB
最終ジャッジ日時 2024-07-07 04:06:29
合計ジャッジ時間 2,103 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 {
    static public void Swap<T>(ref T a, ref T b) {
        T t = a;
        a = b;
        b = t;
    }
    int[,] copy(int[,] array) {
        var r = new int[4, 4];
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                r[i, j] = array[i, j];
            }
        }
        return r;
    }
    bool match(int[,] a1, int[,] a2) {
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                if (a1[i, j] != a2[i, j])
                    return false;
            }
        }
        return true;
    }
    public void Run() {
        var a = new int[4, 4];
        var start = new int[4, 4];
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                a[i, j] = ni();
                start[i, j] = i * 4 + j + 1;
                if (start[i, j] == 16) start[i, j] = 0;
            }
        }
        bool exist = false;
        var queue = new Queue<int[,]>();
        queue.Enqueue(copy(start));
        HashSet<string> memo = new HashSet<string>();
        while (queue.Count > 0) {
            var board = queue.Dequeue();
            var key = String.Join(",", board.Cast<int>());
            if (memo.Contains(key)) continue;
            memo.Add(key);
            if (match(board, a)) {
                exist = true;
            }
            for (int i = 0; i < 4; i++) {
                for (int j = 0; j < 4; j++) {
                    if (i + 1 < 4) {
                        if (
                            (board[i, j] == 0 && board[i + 1, j] == start[i + 1, j]) ||
                            (board[i, j] == start[i, j] && board[i + 1, j] == 0)
                            ) {
                            var newBoard = copy(board);
                            Swap(ref newBoard[i, j], ref newBoard[i + 1, j]);
                            queue.Enqueue(newBoard);
                        }
                    }
                    if (j + 1 < 4) {
                        if (
                            (board[i, j] == 0 && board[i, j + 1] == start[i, j + 1]) ||
                            (board[i, j] == start[i, j] && board[i, j + 1] == 0)
                            ) {
                            var newBoard = copy(board);
                            Swap(ref newBoard[i, j], ref newBoard[i, j + 1]);
                            queue.Enqueue(newBoard);
                        }
                    }
                }
            }
        }
        cout.WriteLine(exist ? "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 int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}
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;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0