#218960 (Java) No.228 ゆきこちゃんの 15 パズル

• 問題: No.228 ゆきこちゃんの 15 パズル
• ユーザー: yuya178
• 提出日時: 2017-11-26 00:02:12
• 言語: Java (openjdk 23)
• 結果: WA
• 実行時間: -
• コード長: 5,355 bytes
• コンパイル時間: 2,312 ms
• コンパイル使用メモリ: 90,392 KB
• 実行使用メモリ: 37,600 KB
• 最終ジャッジ日時: 2024-11-27 10:16:30
• 合計ジャッジ時間: 4,046 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 10 WA * 7

ソースコード

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    void solve()
    {
        int[][] board = new int[4][4];
        int s = 0;
        int t = 0;
        for(int i = 0; i < 4; i++){
            for(int j = 0; j < 4; j++){
                board[i][j] = ni();
                if(board[i][j]==0){
                    s=i;
                    t=j;
                }
            }
        }
        boolean[][] seen  = new boolean[4][4];
        boolean ans = f(board,seen,s,t);
        if(ans) out.println("Yes");
        else out.println("No");
        


    }

    boolean f(int[][] board, boolean[][] seen, int x, int y){
        for(int i = 0; i < 4; i++){
            for(int j = 0; j < 4; j++){
                if(i==3&&j==3){
                    return true;
                }
                if(board[i][j] != i*4+j+1){
                    break;
                }
            }
        }
        // for(int i = 0; i < 4; i++){
        //     for(int j = 0; j < 4; j++){
        //         out.print(board[i][j]+" ");
        //     }
        //     out.println();
        // }
        // out.println();
        int[] dx = {1,0,-1,0};
        int[] dy = {0,1,0,-1};
        boolean res = false;
        for(int i = 0; i < 4; i++){
            int cx = x + dx[i];
            int cy = y + dy[i];
            if(cx<0||cx>3||cy<0||cy>3) continue;
            if(seen[cx][cy]) continue;
            int[][] b = new int[4][4];
            boolean[][] s = new boolean[4][4];
            for(int k = 0; k < 4; k++){
                for(int j = 0; j < 4; j++){
                    b[k][j] = board[k][j];
                    s[k][j] = seen[k][j];
                }
            }
            int tmp = b[x][y];
            b[x][y] = b[cx][cy];
            b[cx][cy] = tmp;
            s[x][y] = true;
            res |= f(b,s,cx,cy);

        }
        return res;
    }

    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}