結果
問題 | No.223 1マス指定の魔方陣 |
ユーザー | uwi |
提出日時 | 2015-06-05 23:00:00 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 322 ms / 5,000 ms |
コード長 | 5,338 bytes |
コンパイル時間 | 4,100 ms |
コンパイル使用メモリ | 77,976 KB |
実行使用メモリ | 53,400 KB |
最終ジャッジ日時 | 2023-09-20 19:24:27 |
合計ジャッジ時間 | 13,691 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
52,620 KB |
testcase_01 | AC | 202 ms
53,040 KB |
testcase_02 | AC | 143 ms
52,936 KB |
testcase_03 | AC | 145 ms
53,028 KB |
testcase_04 | AC | 83 ms
52,484 KB |
testcase_05 | AC | 76 ms
51,648 KB |
testcase_06 | AC | 132 ms
52,772 KB |
testcase_07 | AC | 134 ms
53,036 KB |
testcase_08 | AC | 134 ms
53,120 KB |
testcase_09 | AC | 104 ms
52,652 KB |
testcase_10 | AC | 232 ms
53,092 KB |
testcase_11 | AC | 242 ms
52,964 KB |
testcase_12 | AC | 184 ms
53,080 KB |
testcase_13 | AC | 142 ms
53,116 KB |
testcase_14 | AC | 120 ms
52,676 KB |
testcase_15 | AC | 147 ms
52,984 KB |
testcase_16 | AC | 143 ms
53,108 KB |
testcase_17 | AC | 197 ms
53,036 KB |
testcase_18 | AC | 137 ms
53,144 KB |
testcase_19 | AC | 239 ms
53,040 KB |
testcase_20 | AC | 147 ms
53,036 KB |
testcase_21 | AC | 103 ms
52,604 KB |
testcase_22 | AC | 102 ms
52,540 KB |
testcase_23 | AC | 149 ms
53,060 KB |
testcase_24 | AC | 139 ms
53,004 KB |
testcase_25 | AC | 168 ms
53,400 KB |
testcase_26 | AC | 97 ms
52,632 KB |
testcase_27 | AC | 179 ms
53,032 KB |
testcase_28 | AC | 155 ms
51,068 KB |
testcase_29 | AC | 178 ms
52,804 KB |
testcase_30 | AC | 178 ms
53,132 KB |
testcase_31 | AC | 109 ms
52,968 KB |
testcase_32 | AC | 206 ms
53,152 KB |
testcase_33 | AC | 108 ms
52,532 KB |
testcase_34 | AC | 147 ms
53,088 KB |
testcase_35 | AC | 94 ms
52,556 KB |
testcase_36 | AC | 78 ms
51,808 KB |
testcase_37 | AC | 322 ms
53,056 KB |
testcase_38 | AC | 127 ms
52,864 KB |
testcase_39 | AC | 106 ms
52,632 KB |
testcase_40 | AC | 155 ms
53,004 KB |
testcase_41 | AC | 143 ms
52,896 KB |
testcase_42 | AC | 196 ms
52,908 KB |
testcase_43 | AC | 137 ms
52,972 KB |
testcase_44 | AC | 79 ms
51,968 KB |
testcase_45 | AC | 106 ms
52,684 KB |
testcase_46 | AC | 182 ms
52,972 KB |
ソースコード
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)); } }