結果
問題 | No.1399 すごろくで世界旅行 (構築) |
ユーザー | hiromi_ayase |
提出日時 | 2021-02-20 15:43:02 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,916 bytes |
コンパイル時間 | 2,478 ms |
コンパイル使用メモリ | 89,632 KB |
実行使用メモリ | 55,180 KB |
最終ジャッジ日時 | 2024-09-17 20:04:45 |
合計ジャッジ時間 | 23,930 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
51,468 KB |
testcase_01 | WA | - |
testcase_02 | AC | 72 ms
51,024 KB |
testcase_03 | AC | 68 ms
51,196 KB |
testcase_04 | AC | 75 ms
51,440 KB |
testcase_05 | WA | - |
testcase_06 | AC | 70 ms
51,140 KB |
testcase_07 | AC | 70 ms
51,308 KB |
testcase_08 | AC | 71 ms
51,452 KB |
testcase_09 | WA | - |
testcase_10 | AC | 73 ms
50,944 KB |
testcase_11 | AC | 68 ms
51,476 KB |
testcase_12 | AC | 71 ms
51,244 KB |
testcase_13 | WA | - |
testcase_14 | AC | 77 ms
51,292 KB |
testcase_15 | AC | 72 ms
51,240 KB |
testcase_16 | AC | 72 ms
51,120 KB |
testcase_17 | AC | 143 ms
54,984 KB |
testcase_18 | AC | 139 ms
55,180 KB |
testcase_19 | AC | 144 ms
54,812 KB |
testcase_20 | AC | 139 ms
55,180 KB |
testcase_21 | AC | 141 ms
55,068 KB |
testcase_22 | WA | - |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int v = ni(); int d = ni(); StringBuilder sb = new StringBuilder(); if (d == 1) { for (int i = 0; i < v; i++) { for (int j = 0; j < v; j++) { sb.append(i == j ? "0" : "1"); } sb.append("\n"); } } else { for (int i = 0; i < v; i++) { for (int j = 0; j < v; j++) { sb.append(i == 0 || j == 0 ? "1" : "0"); } sb.append("\n"); } } System.out.print(sb); } 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)); } }