結果
問題 | No.1399 すごろくで世界旅行 (構築) |
ユーザー | shojin_pro |
提出日時 | 2021-02-19 22:20:15 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,783 bytes |
コンパイル時間 | 2,430 ms |
コンパイル使用メモリ | 75,052 KB |
実行使用メモリ | 53,156 KB |
最終ジャッジ日時 | 2023-10-15 02:32:38 |
合計ジャッジ時間 | 23,253 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
49,516 KB |
testcase_01 | AC | 39 ms
49,560 KB |
testcase_02 | AC | 42 ms
49,652 KB |
testcase_03 | AC | 42 ms
49,936 KB |
testcase_04 | AC | 41 ms
50,092 KB |
testcase_05 | WA | - |
testcase_06 | AC | 42 ms
49,588 KB |
testcase_07 | AC | 41 ms
49,820 KB |
testcase_08 | AC | 42 ms
49,364 KB |
testcase_09 | WA | - |
testcase_10 | AC | 42 ms
49,588 KB |
testcase_11 | AC | 41 ms
49,436 KB |
testcase_12 | AC | 42 ms
50,036 KB |
testcase_13 | WA | - |
testcase_14 | AC | 42 ms
49,540 KB |
testcase_15 | AC | 43 ms
49,660 KB |
testcase_16 | AC | 40 ms
49,416 KB |
testcase_17 | AC | 108 ms
52,556 KB |
testcase_18 | AC | 107 ms
52,452 KB |
testcase_19 | AC | 142 ms
53,052 KB |
testcase_20 | AC | 141 ms
53,156 KB |
testcase_21 | AC | 105 ms
52,492 KB |
testcase_22 | WA | - |
ソースコード
import java.util.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); static PrintWriter pw = new PrintWriter(System.out); static StringBuilder sb = new StringBuilder(); public static void main(String[] args) throws Exception { int n = sc.nextInt(); int d = sc.nextInt(); if(n % 2 != 0 && d >= n-1){ for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ if((i+n-1) % n == j || (i+1)%n == j){ sb.append(1); }else{ sb.append(0); } } pw.println(sb.toString()); sb.setLength(0); } }else{ for(int i = 0; i < n; i++) sb.append(1); pw.println(sb.toString()); sb.setLength(0); for(int i = 0; i < n; i++) sb.append(i == 0 ? 1 : 0); for(int i = 1; i < n; i++){ pw.println(sb.toString()); } } pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } public static void save_sort(long[] array) { shuffle(array); Arrays.sort(array); } public static long[] shuffle(long[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); long randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }