結果
問題 | No.839 Keep Distance and Nobody Explodes |
ユーザー | hiromi_ayase |
提出日時 | 2019-07-25 05:16:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 213 ms / 2,000 ms |
コード長 | 2,932 bytes |
コンパイル時間 | 2,583 ms |
コンパイル使用メモリ | 77,984 KB |
実行使用メモリ | 58,272 KB |
最終ジャッジ日時 | 2023-09-14 23:43:18 |
合計ジャッジ時間 | 8,863 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 85 ms
52,800 KB |
testcase_01 | AC | 84 ms
52,804 KB |
testcase_02 | AC | 85 ms
52,928 KB |
testcase_03 | AC | 86 ms
52,760 KB |
testcase_04 | AC | 88 ms
52,568 KB |
testcase_05 | AC | 206 ms
57,780 KB |
testcase_06 | AC | 210 ms
58,188 KB |
testcase_07 | AC | 212 ms
58,272 KB |
testcase_08 | AC | 208 ms
57,808 KB |
testcase_09 | AC | 213 ms
57,016 KB |
testcase_10 | AC | 212 ms
57,780 KB |
testcase_11 | AC | 157 ms
55,196 KB |
testcase_12 | AC | 167 ms
57,500 KB |
testcase_13 | AC | 139 ms
55,052 KB |
testcase_14 | AC | 136 ms
54,808 KB |
testcase_15 | AC | 103 ms
54,192 KB |
testcase_16 | AC | 101 ms
53,108 KB |
testcase_17 | AC | 198 ms
57,356 KB |
testcase_18 | AC | 101 ms
52,968 KB |
testcase_19 | AC | 138 ms
55,216 KB |
testcase_20 | AC | 189 ms
56,616 KB |
testcase_21 | AC | 111 ms
54,348 KB |
testcase_22 | AC | 200 ms
57,392 KB |
testcase_23 | AC | 100 ms
53,248 KB |
testcase_24 | AC | 186 ms
57,532 KB |
testcase_25 | AC | 138 ms
54,960 KB |
testcase_26 | AC | 159 ms
54,868 KB |
testcase_27 | AC | 163 ms
54,944 KB |
testcase_28 | AC | 161 ms
54,796 KB |
testcase_29 | AC | 169 ms
57,324 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int[][] a = new int[n][n]; int ptr = 0; for (int i = 0; i < n / 2; i++) { for (int j = 0; j < n / 2; j++) { a[i][j] = ptr++; a[i + n / 2][j + n / 2] = ptr++; } } for (int i = 0; i < n / 2; i++) { for (int j = n / 2 - 1; j >= 0; j--) { a[i][j + n / 2] = ptr++; a[i + n / 2][j] = ptr++; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { out.print(a[i][j] + 1 + " "); } 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)); } }