結果
問題 | No.1066 #いろいろな色 / Red and Blue and more various colors (Easy) |
ユーザー | hiromi_ayase |
提出日時 | 2020-05-29 22:02:35 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,037 ms / 2,000 ms |
コード長 | 3,128 bytes |
コンパイル時間 | 2,302 ms |
コンパイル使用メモリ | 82,592 KB |
実行使用メモリ | 57,272 KB |
最終ジャッジ日時 | 2024-04-23 22:27:41 |
合計ジャッジ時間 | 11,225 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
51,548 KB |
testcase_01 | AC | 66 ms
51,356 KB |
testcase_02 | AC | 66 ms
51,408 KB |
testcase_03 | AC | 66 ms
51,392 KB |
testcase_04 | AC | 67 ms
51,336 KB |
testcase_05 | AC | 67 ms
51,424 KB |
testcase_06 | AC | 66 ms
51,348 KB |
testcase_07 | AC | 65 ms
51,480 KB |
testcase_08 | AC | 442 ms
53,152 KB |
testcase_09 | AC | 70 ms
51,348 KB |
testcase_10 | AC | 1,037 ms
57,272 KB |
testcase_11 | AC | 309 ms
53,248 KB |
testcase_12 | AC | 252 ms
52,792 KB |
testcase_13 | AC | 317 ms
53,156 KB |
testcase_14 | AC | 321 ms
53,480 KB |
testcase_15 | AC | 687 ms
53,208 KB |
testcase_16 | AC | 197 ms
52,976 KB |
testcase_17 | AC | 209 ms
52,828 KB |
testcase_18 | AC | 620 ms
53,176 KB |
testcase_19 | AC | 291 ms
52,916 KB |
testcase_20 | AC | 70 ms
51,444 KB |
testcase_21 | AC | 526 ms
53,268 KB |
testcase_22 | AC | 72 ms
51,480 KB |
testcase_23 | AC | 68 ms
51,456 KB |
testcase_24 | AC | 68 ms
51,228 KB |
testcase_25 | AC | 1,026 ms
57,184 KB |
testcase_26 | AC | 998 ms
56,104 KB |
ソースコード
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[2][n + 2]; dp[0][0] = 1; for (int i = 0; i < n; i ++) { int from = i % 2; int to = from ^ 1; for (int j = 0; j <= n; j ++) { dp[to][j] = dp[from][j] * (a[i]-1) % mod; if (j > 0) dp[to][j] += dp[from][j - 1]; dp[to][j] %= mod; } } for (int v : b) { out.println(dp[n%2][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)); } }