結果

問題 No.228 ゆきこちゃんの 15 パズル
コンテスト
ユーザー uwi
提出日時 2015-06-19 23:26:26
言語 Java
(openjdk 23)
結果
AC  
実行時間 56 ms / 5,000 ms
コード長 3,552 bytes
コンパイル時間 3,401 ms
コンパイル使用メモリ 88,048 KB
実行使用メモリ 52,456 KB
最終ジャッジ日時 2024-07-07 04:18:55
合計ジャッジ時間 5,093 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q247 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = 16;
		int[] a = na(n);
		int[] w = new int[16];
		for(int i = 0;i < 15;i++){
			w[i] = i+1;
		}
		out.println(dfs(w, a, 0) ? "Yes" : "No");
	}
	
	boolean dfs(int[] w, int[] tar, int fl)
	{
		if(Arrays.equals(w, tar))return true;
		for(int i = 0;i < 4;i++){
			for(int j = 0;j < 4;j++){
				int x = i*4+j;
				int[] dr = { 1, 0, -1, 0 };
				int[] dc = { 0, 1, 0, -1 };
				if(w[x] == 0){
					for(int k = 0;k < 4;k++){
						int nr = i + dr[k], nc = j + dc[k];
						if(nr >= 0 && nr < 4 && nc >= 0 && nc < 4 && fl<<~(w[nr*4+nc])>=0){
							int nfl = fl | 1<<w[nr*4+nc];
							int[] nw = Arrays.copyOf(w, 16);
							nw[x] = w[nr*4+nc];
							nw[nr*4+nc] = 0;
							if(dfs(nw, tar, nfl))return true;
						}
					}
					break;
				}
			}
		}
		return false;
	}
	
	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 Q247().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))){ // when nextLine, (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)); }
}
0