結果
問題 | No.2388 At Least K-Characters |
ユーザー | hiromi_ayase |
提出日時 | 2023-07-21 23:06:39 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,068 ms / 4,000 ms |
コード長 | 3,564 bytes |
コンパイル時間 | 3,459 ms |
コンパイル使用メモリ | 84,992 KB |
実行使用メモリ | 174,508 KB |
最終ジャッジ日時 | 2023-09-18 13:00:27 |
合計ジャッジ時間 | 21,993 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
50,776 KB |
testcase_01 | AC | 67 ms
50,700 KB |
testcase_02 | AC | 67 ms
50,820 KB |
testcase_03 | AC | 67 ms
51,152 KB |
testcase_04 | AC | 67 ms
50,696 KB |
testcase_05 | AC | 67 ms
50,936 KB |
testcase_06 | AC | 66 ms
50,644 KB |
testcase_07 | AC | 67 ms
50,756 KB |
testcase_08 | AC | 67 ms
50,768 KB |
testcase_09 | AC | 66 ms
50,636 KB |
testcase_10 | AC | 66 ms
50,760 KB |
testcase_11 | AC | 66 ms
50,588 KB |
testcase_12 | AC | 67 ms
50,848 KB |
testcase_13 | AC | 76 ms
51,220 KB |
testcase_14 | AC | 72 ms
50,888 KB |
testcase_15 | AC | 77 ms
51,444 KB |
testcase_16 | AC | 959 ms
174,308 KB |
testcase_17 | AC | 366 ms
81,616 KB |
testcase_18 | AC | 1,065 ms
174,508 KB |
testcase_19 | AC | 1,067 ms
174,332 KB |
testcase_20 | AC | 826 ms
130,572 KB |
testcase_21 | AC | 467 ms
81,584 KB |
testcase_22 | AC | 492 ms
82,496 KB |
testcase_23 | AC | 474 ms
81,472 KB |
testcase_24 | AC | 703 ms
120,824 KB |
testcase_25 | AC | 1,059 ms
174,204 KB |
testcase_26 | AC | 584 ms
106,808 KB |
testcase_27 | AC | 674 ms
120,888 KB |
testcase_28 | AC | 521 ms
87,364 KB |
testcase_29 | AC | 765 ms
122,140 KB |
testcase_30 | AC | 861 ms
134,520 KB |
testcase_31 | AC | 985 ms
174,088 KB |
testcase_32 | AC | 1,063 ms
174,240 KB |
testcase_33 | AC | 1,068 ms
174,160 KB |
testcase_34 | AC | 589 ms
106,892 KB |
testcase_35 | AC | 472 ms
81,324 KB |
testcase_36 | AC | 618 ms
107,156 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); int m = ni(); int k = ni(); char[] s = ns(); int mod = 998244353; long[][] dp = new long[m + 1][k + 1]; long ret = 0; int used = 0; for (int i = 0; i < m; i++) { for (int j = 0; j < k; j++) { dp[i + 1][j + 1] += dp[i][j] * (26 - j) % mod; dp[i + 1][j + 1] %= mod; dp[i + 1][j] += dp[i][j] * j % mod; dp[i + 1][j] %= mod; } dp[i + 1][k] += dp[i][k] * 26 % mod; dp[i + 1][k] %= mod; if (i < n) { int c = s[i] - 'a'; for (int d = 0; d < 26; d++) { if (d < c) { int cnt = Math.min(k, Integer.bitCount(used | (1 << d))); dp[i + 1][cnt] += 1; dp[i + 1][cnt] %= mod; } } used |= 1 << c; if (i < n - 1 && Integer.bitCount(used) >= k) { ret ++; ret %= mod; } } } //(a,a,a) 1 //(a,b,*) 26 k>=2 //(a,a,*) 25 k=2 //a for (int i = 1; i <= m; i++) { ret += dp[i][k]; ret %= mod; } // System.out.println(Arrays.deepToString(dp)); System.out.println(ret); } 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)); } }