結果
問題 | No.1398 調和の魔法陣 (構築) |
ユーザー | hiromi_ayase |
提出日時 | 2021-02-20 14:06:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 226 ms / 3,153 ms |
コード長 | 3,732 bytes |
コンパイル時間 | 2,563 ms |
コンパイル使用メモリ | 81,872 KB |
実行使用メモリ | 59,264 KB |
最終ジャッジ日時 | 2023-10-17 18:01:56 |
合計ジャッジ時間 | 33,261 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
54,296 KB |
testcase_01 | AC | 77 ms
54,304 KB |
testcase_02 | AC | 77 ms
54,300 KB |
testcase_03 | AC | 78 ms
54,296 KB |
testcase_04 | AC | 78 ms
54,460 KB |
testcase_05 | AC | 78 ms
54,464 KB |
testcase_06 | AC | 221 ms
59,236 KB |
testcase_07 | AC | 77 ms
54,316 KB |
testcase_08 | AC | 226 ms
58,876 KB |
testcase_09 | AC | 223 ms
58,920 KB |
testcase_10 | AC | 77 ms
54,456 KB |
testcase_11 | AC | 220 ms
59,000 KB |
testcase_12 | AC | 76 ms
54,312 KB |
testcase_13 | AC | 225 ms
56,796 KB |
testcase_14 | AC | 211 ms
59,180 KB |
testcase_15 | AC | 79 ms
54,304 KB |
testcase_16 | AC | 223 ms
59,264 KB |
testcase_17 | AC | 221 ms
59,248 KB |
testcase_18 | AC | 220 ms
58,896 KB |
testcase_19 | AC | 214 ms
58,852 KB |
testcase_20 | AC | 77 ms
54,300 KB |
testcase_21 | AC | 218 ms
59,164 KB |
testcase_22 | AC | 218 ms
59,132 KB |
testcase_23 | AC | 76 ms
54,300 KB |
testcase_24 | AC | 220 ms
58,908 KB |
testcase_25 | AC | 76 ms
54,300 KB |
testcase_26 | AC | 221 ms
59,096 KB |
testcase_27 | AC | 222 ms
58,840 KB |
testcase_28 | AC | 80 ms
54,296 KB |
testcase_29 | AC | 224 ms
59,100 KB |
testcase_30 | AC | 76 ms
54,296 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int w = ni(); int h = ni(); int x = ni(); if (x > 36) { System.out.println(-1); return; } int[] a = new int[4]; boolean[] b = new boolean[4]; if (w % 3 == 0 && h % 3 == 0) { b[3] = true; } else if (w % 3 == 0 && h % 3 == 1) { b[1] = true; } else if (w % 3 == 0 && h % 3 == 2) { b[1] = true; b[3] = true; } else if (w % 3 == 1 && h % 3 == 0) { b[2] = true; } else if (w % 3 == 1 && h % 3 == 1) { b[0] = true; } else if (w % 3 == 1 && h % 3 == 2) { b[0] = true; b[2] = true; } else if (w % 3 == 2 && h % 3 == 0) { b[2] = true; b[3] = true; } else if (w % 3 == 2 && h % 3 == 1) { b[0] = true; b[1] = true; } else { b[0] = b[1] = b[2] = b[3] = true; } for (int i = 0; i < 4; i++) { if (b[i]) { int v = Math.min(9, x); a[i] = v; x -= v; } } if (x > 0) { System.out.println(-1); return; } for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { int ci = i % 3; int cj = j % 3; if (ci == 2 || cj == 2) { out.print(0); } else { out.print(a[(ci << 1) + cj]); } } out.println(); } } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }