結果
問題 | No.1011 Infinite Stairs |
ユーザー | hiromi_ayase |
提出日時 | 2020-03-21 09:45:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,282 ms / 2,000 ms |
コード長 | 2,887 bytes |
コンパイル時間 | 2,835 ms |
コンパイル使用メモリ | 83,372 KB |
実行使用メモリ | 329,548 KB |
最終ジャッジ日時 | 2023-09-24 11:05:53 |
合計ジャッジ時間 | 10,776 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
50,824 KB |
testcase_01 | AC | 72 ms
51,068 KB |
testcase_02 | AC | 97 ms
54,340 KB |
testcase_03 | AC | 879 ms
212,472 KB |
testcase_04 | AC | 214 ms
75,772 KB |
testcase_05 | AC | 1,282 ms
329,548 KB |
testcase_06 | AC | 71 ms
50,912 KB |
testcase_07 | AC | 92 ms
54,508 KB |
testcase_08 | AC | 71 ms
51,100 KB |
testcase_09 | AC | 70 ms
50,904 KB |
testcase_10 | AC | 87 ms
52,452 KB |
testcase_11 | AC | 247 ms
83,912 KB |
testcase_12 | AC | 80 ms
51,016 KB |
testcase_13 | AC | 183 ms
75,684 KB |
testcase_14 | AC | 72 ms
50,864 KB |
testcase_15 | AC | 209 ms
75,576 KB |
testcase_16 | AC | 630 ms
178,116 KB |
testcase_17 | AC | 124 ms
61,596 KB |
testcase_18 | AC | 406 ms
123,272 KB |
testcase_19 | AC | 85 ms
52,128 KB |
testcase_20 | AC | 74 ms
50,792 KB |
testcase_21 | AC | 206 ms
75,208 KB |
testcase_22 | AC | 344 ms
111,240 KB |
testcase_23 | AC | 239 ms
83,480 KB |
testcase_24 | AC | 252 ms
83,368 KB |
testcase_25 | AC | 354 ms
108,832 KB |
testcase_26 | AC | 135 ms
61,188 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int d = ni(); int k = ni(); long[][] dp = new long[n + 1][k + d + 1]; dp[0][0] = 1; int mod = (int) 1e9 + 7; for (int i = 0; i < n; i++) { long sum = dp[i][0]; for (int j = 1; j <= k; j++) { dp[i + 1][j] = sum; dp[i + 1][j] %= mod; sum += dp[i][j]; sum %= mod; if (j >= d) { sum += mod - dp[i][j - d]; sum %= mod; } } } System.out.println(dp[n][k]); } 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)); } }