結果

問題 No.223 1マス指定の魔方陣
コンテスト
ユーザー uwi
提出日時 2015-06-05 23:00:00
言語 Java
(openjdk 23)
結果
AC  
実行時間 277 ms / 5,000 ms
コード長 5,338 bytes
コンパイル時間 3,291 ms
コンパイル使用メモリ 81,044 KB
実行使用メモリ 50,584 KB
最終ジャッジ日時 2024-07-06 14:21:04
合計ジャッジ時間 10,852 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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 Q558 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int[][] a;
	int rr, cc, xx;
	
	boolean dfs(int r, int c, int x, int rem)
	{
		if(r >= 4){
			for(int j = 0;j < 4;j++){
				int s = 0;
				for(int i = 0;i < 4;i++){
					s += a[i][j];
				}
				if(s != 34)return false;
			}
			if(a[0][0]+a[1][1]+a[2][2]+a[3][3] != 34)return false;
			if(a[0][3]+a[1][2]+a[2][1]+a[3][0] != 34)return false;
			return true;
		}
		if(c >= 4){
			int s = 0;
			for(int i = 0;i < 4;i++){
				s += a[r][i];
			}
			if(s != 34)return false;
			return dfs(r+1, 0, x, rem);
		}
		if(r == 3 && c == 1 && a[0][3]+a[1][2]+a[2][1]+a[3][0] != 34)return false;
		if(r == 3 && c == 1 && a[0][0]+a[1][0]+a[2][0]+a[3][0] != 34)return false;
		
		for(int i = 1;i <= 16;i++){
			if(rem<<~i<0){
				a[r][c] = i;
				if(r == rr && c == cc){
					if(a[r][c] != xx)continue;
				}else{
					if(a[r][c] == xx)continue;
				}
				if(dfs(r, c+1, x, rem^1<<i))return true;
			}
		}
		return false;
	}
	
	int[][][] ps = {
			{{0, 3, 1, 2},{3, 0, 2, 1}},
			{{3, 0, 1, 2},{0, 3, 2, 1}},
			{{0, 3, 2, 1},{3, 0, 1, 2}},
			{{3, 0, 2, 1},{0, 3, 1, 2}},
			{{1, 2, 0, 3},{2, 1, 3, 0}},
			{{1, 2, 3, 0},{2, 1, 0, 3}},
			{{2, 1, 0, 3},{1, 2, 3, 0}},
			{{2, 1, 3, 0},{1, 2, 0, 3}}
	};
	
	void solve()
	{
		int n = ni();
		int c = ni()-1, r = ni()-1, x = ni();
		
		rr = r%4; cc = c%4; xx = x%16;
		if(xx == 0)xx += 16;
		
		boolean revr = false, revc = false;
		if(rr >= 2){
			rr = 3-rr; revr = true;
		}
		if(cc >= 2){
			cc = 3-cc; revc = true;
		}
		a = new int[4][4];
		dfs(0, 0, xx, (1<<17)-2);
		if(revc){
			for(int i = 0;i < 4;i++){
				for(int j = 0, k = 3;j < k;j++,k--){
					int d = a[i][j]; a[i][j] = a[i][k]; a[i][k] = d;
				}
			}
		}
		if(revr){
			for(int i = 0;i < 4;i++){
				for(int j = 0, k = 3;j < k;j++,k--){
					int d = a[j][i]; a[j][i] = a[k][i]; a[k][i] = d;
				}
			}
		}
		
		int[][] magic = a;
		int[][] nex;
		
		if(n >= 8){
			for(int[][] p : ps){
				nex = new int[8][8];
				for(int i = 0;i < 8;i++){
					for(int j = 0;j < 8;j++){
						nex[i][j] = magic[i%4][j%4] + p[i/4][j/2]*16;
					}
				}
				xx = x % 64;
				if(xx == 0)xx += 64;
				if(nex[r%8][c%8] == xx){
					magic = nex;
					break;
				}
			}
		}
		
		if(n >= 16){
			for(int[][] p : ps){
				nex = new int[16][16];
				for(int i = 0;i < 16;i++){
					for(int j = 0;j < 16;j++){
						nex[i][j] = magic[i%8][j%8] + p[i/8][j/4]*64;
					}
				}
				xx = x;
				if(nex[r][c] == xx){
					magic = nex;
					break;
				}
			}
		}
			
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				if(j > 0)out.print(" ");
				out.print(magic[i][j]);
			}
			out.println();
		}
	}
	
	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 Q558().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