結果
問題 | No.2388 At Least K-Characters |
ユーザー | AngrySadEight |
提出日時 | 2023-10-04 01:17:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 456 ms / 4,000 ms |
コード長 | 4,678 bytes |
コンパイル時間 | 5,835 ms |
コンパイル使用メモリ | 224,644 KB |
実行使用メモリ | 249,964 KB |
最終ジャッジ日時 | 2023-10-04 01:18:03 |
合計ジャッジ時間 | 18,060 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 3 ms
4,484 KB |
testcase_14 | AC | 3 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 446 ms
249,964 KB |
testcase_17 | AC | 449 ms
249,760 KB |
testcase_18 | AC | 379 ms
249,712 KB |
testcase_19 | AC | 383 ms
249,816 KB |
testcase_20 | AC | 398 ms
249,740 KB |
testcase_21 | AC | 456 ms
249,680 KB |
testcase_22 | AC | 447 ms
249,740 KB |
testcase_23 | AC | 451 ms
249,748 KB |
testcase_24 | AC | 419 ms
249,808 KB |
testcase_25 | AC | 377 ms
249,680 KB |
testcase_26 | AC | 428 ms
249,692 KB |
testcase_27 | AC | 423 ms
249,904 KB |
testcase_28 | AC | 437 ms
249,728 KB |
testcase_29 | AC | 409 ms
249,732 KB |
testcase_30 | AC | 428 ms
249,820 KB |
testcase_31 | AC | 387 ms
249,920 KB |
testcase_32 | AC | 381 ms
249,736 KB |
testcase_33 | AC | 398 ms
249,680 KB |
testcase_34 | AC | 430 ms
249,780 KB |
testcase_35 | AC | 453 ms
249,720 KB |
testcase_36 | AC | 425 ms
249,616 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod) { // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0) { ret = 1; } else if (n % 2 == 1) { ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else { ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); } int main() { ll N, M, K; cin >> N >> M >> K; string S; cin >> S; vector<ll> ns(N); for (ll i = 0; i < N; i++) { ns[i] = (ll)(S[i] - 'a'); } vector<vector<ll>> dp1(M, vector<ll>(27, 0)); vector<vector<ll>> dp2(M, vector<ll>(27, 0)); dp2[0][1] = ns[0]; dp1[0][1] = 1; ll now_kind = 1; vector<ll> kinds(26, 0); kinds[ns[0]]++; for (ll i = 1; i < N; i++) { if (kinds[ns[i]] == 0) { now_kind++; } kinds[ns[i]]++; dp1[i][now_kind] = 1; for (ll j = 1; j <= 26; j++) { dp2[i][j] = (dp2[i][j] + dp2[i - 1][j] * j) % mod2; dp2[i][j] = (dp2[i][j] + dp2[i - 1][j - 1] * (26 - (j - 1))) % mod2; } ll up = 0; ll down = 0; for (ll j = 0; j < ns[i]; j++) { if (kinds[j] == 0) { down++; } else { up++; } } for (ll j = 1; j <= 26; j++) { dp2[i][j] = (dp2[i][j] + dp1[i - 1][j] * up) % mod2; dp2[i][j] = (dp2[i][j] + dp1[i - 1][j - 1] * down) % mod2; } } for (ll i = N; i < M; i++) { for (ll j = 1; j <= 26; j++) { dp2[i][j] = (dp2[i][j] + (dp2[i - 1][j] * j)) % mod2; dp2[i][j] = (dp2[i][j] + dp2[i - 1][j - 1] * (26 - (j - 1))) % mod2; } } ll ans = 0; for (ll i = 0; i < M; i++) { for (ll j = K; j <= 26; j++) { ans = (ans + dp2[i][j]) % mod2; } } for (ll i = 0; i < N - 1; i++) { for (ll j = K; j <= 26; j++) { ans = (ans + dp1[i][j]) % mod2; } } // debug(dp1); // debug(dp2); cout << ans << endl; }