結果
問題 | No.1186 長方形の敷き詰め |
ユーザー | hiromi_ayase |
提出日時 | 2020-08-22 13:48:33 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 308 ms / 2,000 ms |
コード長 | 2,819 bytes |
コンパイル時間 | 3,442 ms |
コンパイル使用メモリ | 93,148 KB |
実行使用メモリ | 99,044 KB |
最終ジャッジ日時 | 2024-04-23 08:13:27 |
合計ジャッジ時間 | 8,383 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
51,296 KB |
testcase_01 | AC | 77 ms
50,912 KB |
testcase_02 | AC | 210 ms
72,328 KB |
testcase_03 | AC | 78 ms
51,068 KB |
testcase_04 | AC | 79 ms
50,904 KB |
testcase_05 | AC | 78 ms
50,904 KB |
testcase_06 | AC | 78 ms
51,416 KB |
testcase_07 | AC | 77 ms
51,172 KB |
testcase_08 | AC | 77 ms
51,444 KB |
testcase_09 | AC | 79 ms
51,400 KB |
testcase_10 | AC | 77 ms
50,852 KB |
testcase_11 | AC | 82 ms
51,520 KB |
testcase_12 | AC | 93 ms
51,800 KB |
testcase_13 | AC | 83 ms
51,436 KB |
testcase_14 | AC | 90 ms
51,728 KB |
testcase_15 | AC | 82 ms
51,356 KB |
testcase_16 | AC | 81 ms
51,324 KB |
testcase_17 | AC | 175 ms
57,216 KB |
testcase_18 | AC | 195 ms
62,312 KB |
testcase_19 | AC | 201 ms
63,948 KB |
testcase_20 | AC | 208 ms
70,016 KB |
testcase_21 | AC | 187 ms
61,756 KB |
testcase_22 | AC | 308 ms
99,044 KB |
testcase_23 | AC | 267 ms
78,600 KB |
testcase_24 | AC | 277 ms
70,748 KB |
testcase_25 | AC | 227 ms
61,680 KB |
testcase_26 | AC | 186 ms
61,700 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int m = ni(); int mod = 998244353; if (n == 1) { System.out.println(1); return; } long[] dp = new long[m + 1]; dp[0] = 1; for (int i = 1; i <= m; i++) { dp[i] += dp[i - 1]; if (i >= n) { dp[i] += dp[i - n]; } dp[i] %= mod; } System.err.println(Arrays.toString(dp)); System.out.println(dp[m]); } 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)); } }