結果
問題 | No.690 E869120 and Constructing Array 4 |
ユーザー | hiromi_ayase |
提出日時 | 2018-05-19 21:25:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 133 ms / 1,000 ms |
コード長 | 2,987 bytes |
コンパイル時間 | 3,200 ms |
コンパイル使用メモリ | 79,828 KB |
実行使用メモリ | 53,400 KB |
最終ジャッジ日時 | 2023-09-10 23:49:28 |
合計ジャッジ時間 | 7,258 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 115 ms
53,024 KB |
testcase_01 | AC | 103 ms
52,804 KB |
testcase_02 | AC | 105 ms
52,912 KB |
testcase_03 | AC | 103 ms
52,860 KB |
testcase_04 | AC | 102 ms
52,728 KB |
testcase_05 | AC | 99 ms
52,820 KB |
testcase_06 | AC | 128 ms
52,956 KB |
testcase_07 | AC | 124 ms
53,180 KB |
testcase_08 | AC | 122 ms
52,876 KB |
testcase_09 | AC | 124 ms
53,132 KB |
testcase_10 | AC | 133 ms
53,072 KB |
testcase_11 | AC | 125 ms
53,072 KB |
testcase_12 | AC | 124 ms
53,400 KB |
testcase_13 | AC | 101 ms
52,924 KB |
testcase_14 | AC | 104 ms
52,796 KB |
testcase_15 | AC | 102 ms
53,072 KB |
testcase_16 | AC | 122 ms
53,152 KB |
testcase_17 | AC | 99 ms
52,892 KB |
testcase_18 | AC | 97 ms
52,880 KB |
testcase_19 | AC | 99 ms
52,824 KB |
testcase_20 | AC | 100 ms
52,988 KB |
testcase_21 | AC | 98 ms
52,720 KB |
ソースコード
import java.util.ArrayList; import java.util.List; public class Main { private static void solve() { int k = ni(); int[] dp = new int[33]; dp[1] = 1; List<int[]> edges = new ArrayList<>(); int n = 1; outer: for (; n <= 32; n ++) { for (int j = n - 1; j >= 1; j --) { if (k >= dp[n] + dp[j]) { dp[n] += dp[j]; edges.add(new int[] {j, n}); if (dp[n] == k) { break outer; } } } } int m = edges.size(); System.out.println(n + " " + m); for (int[] e : edges) { System.out.println(e[0] + " " + e[1]); } } 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)); } }