結果
問題 | No.1066 #いろいろな色 / Red and Blue and more various colors (Easy) |
ユーザー | hiromi_ayase |
提出日時 | 2020-05-29 22:00:54 |
言語 | Java21 (openjdk 21) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,081 bytes |
コンパイル時間 | 1,974 ms |
コンパイル使用メモリ | 89,084 KB |
実行使用メモリ | 349,804 KB |
最終ジャッジ日時 | 2024-04-23 22:23:11 |
合計ジャッジ時間 | 12,799 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
51,384 KB |
testcase_01 | AC | 70 ms
51,332 KB |
testcase_02 | AC | 68 ms
51,292 KB |
testcase_03 | AC | 67 ms
51,304 KB |
testcase_04 | AC | 67 ms
51,268 KB |
testcase_05 | AC | 66 ms
51,036 KB |
testcase_06 | AC | 68 ms
50,920 KB |
testcase_07 | AC | 67 ms
50,924 KB |
testcase_08 | MLE | - |
testcase_09 | AC | 73 ms
51,008 KB |
testcase_10 | MLE | - |
testcase_11 | AC | 371 ms
109,432 KB |
testcase_12 | AC | 321 ms
109,088 KB |
testcase_13 | AC | 368 ms
109,512 KB |
testcase_14 | MLE | - |
testcase_15 | MLE | - |
testcase_16 | AC | 215 ms
75,776 KB |
testcase_17 | AC | 241 ms
74,668 KB |
testcase_18 | MLE | - |
testcase_19 | AC | 343 ms
109,468 KB |
testcase_20 | AC | 72 ms
50,992 KB |
testcase_21 | MLE | - |
testcase_22 | AC | 75 ms
51,304 KB |
testcase_23 | AC | 67 ms
51,296 KB |
testcase_24 | AC | 66 ms
51,356 KB |
testcase_25 | MLE | - |
testcase_26 | MLE | - |
ソースコード
public class Main { private static void solve() { int n = ni(); int q = ni(); int[] a = na(n); int[] b = na(q); int mod = 998244353; long[][] dp = new long[n + 1][n + 2]; dp[0][0] = 1; for (int i = 0; i < n; i ++) { for (int j = 0; j <= n; j ++) { dp[i + 1][j] += dp[i][j] * (a[i]-1) % mod; if (j > 0) dp[i + 1][j] += dp[i][j - 1]; dp[i + 1][j] %= mod; } } for (int v : b) { out.println(dp[n][v]); } } 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)); } }