結果

問題 No.2388 At Least K-Characters
ユーザー PCTprobabilityPCTprobability
提出日時 2023-07-20 19:38:36
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 163 ms / 4,000 ms
コード長 5,543 bytes
コンパイル時間 4,488 ms
コンパイル使用メモリ 274,880 KB
実行使用メモリ 56,672 KB
最終ジャッジ日時 2024-07-05 03:39:36
合計ジャッジ時間 10,385 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 88 ms
56,192 KB
testcase_01 AC 85 ms
56,180 KB
testcase_02 AC 86 ms
56,288 KB
testcase_03 AC 88 ms
56,064 KB
testcase_04 AC 88 ms
56,064 KB
testcase_05 AC 88 ms
56,192 KB
testcase_06 AC 86 ms
56,092 KB
testcase_07 AC 89 ms
56,064 KB
testcase_08 AC 88 ms
56,064 KB
testcase_09 AC 88 ms
56,216 KB
testcase_10 AC 87 ms
56,196 KB
testcase_11 AC 86 ms
56,208 KB
testcase_12 AC 88 ms
56,064 KB
testcase_13 AC 90 ms
56,064 KB
testcase_14 AC 90 ms
56,192 KB
testcase_15 AC 88 ms
56,064 KB
testcase_16 AC 146 ms
56,544 KB
testcase_17 AC 109 ms
56,552 KB
testcase_18 AC 155 ms
56,632 KB
testcase_19 AC 154 ms
56,576 KB
testcase_20 AC 156 ms
56,600 KB
testcase_21 AC 160 ms
56,500 KB
testcase_22 AC 159 ms
56,448 KB
testcase_23 AC 156 ms
56,420 KB
testcase_24 AC 157 ms
56,576 KB
testcase_25 AC 155 ms
56,564 KB
testcase_26 AC 158 ms
56,448 KB
testcase_27 AC 163 ms
56,576 KB
testcase_28 AC 154 ms
56,548 KB
testcase_29 AC 161 ms
56,576 KB
testcase_30 AC 156 ms
56,544 KB
testcase_31 AC 157 ms
56,572 KB
testcase_32 AC 157 ms
56,672 KB
testcase_33 AC 158 ms
56,588 KB
testcase_34 AC 153 ms
56,576 KB
testcase_35 AC 158 ms
56,576 KB
testcase_36 AC 156 ms
56,576 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/atcoder/modint:1,
                 from /usr/include/atcoder/convolution.hpp:11,
                 from /usr/include/atcoder/convolution:1,
                 from /usr/include/atcoder/all:1,
                 from main.cpp:4:
In member function 'atcoder::static_modint<m, <anonymous> >::mint& atcoder::static_modint<m, <anonymous> >::operator+=(const mint&) [with int m = 998244353; std::enable_if_t<(1 <= m)>* <anonymous> = 0]',
    inlined from 'int main()' at main.cpp:123:35:
/usr/include/atcoder/modint.hpp:75:9: warning: iteration 26 invokes undefined behavior [-Waggressive-loop-optimizations]
   75 |         _v += rhs._v;
      |         ^~
main.cpp: In function 'int main()':
main.cpp:121:18: note: within this loop
  121 |     for(int j=0;j<=26;j++){
      |                 ~^~~~

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
using mint = modint998244353;
mint dp[500100][27];
int main() {
  cincout();
  ll n,m,k;
  cin>>n>>m>>k;
  string s;
  cin>>s;
  set<int> ss;
  for(int i=0;i<n&&i<m;i++){
    for(int j=0;j<s[i]-'a';j++){
      if(ss.find(j)!=ss.end()){
        dp[i+1][ss.size()]++;
      }
      else{
        dp[i+1][ss.size()+1]++;
      }
    }
    ss.insert(s[i]-'a');
  }
  for(int i=0;i<=500000;i++){
    for(int j=0;j<27;j++) dp[i+1][j]+=dp[i][j];
  }
  for(int i=0;i<=500000;i++){
    for(int j=0;j<=26;j++){
      dp[i+1][j]+=dp[i][j]*j;
      dp[i+1][j+1]+=dp[i][j]*(26-j);
    }
  }
  mint ans=0;
  for(int i=k;i<=26;i++) ans+=dp[m][i];
  set<int> s2;
  for(int i=0;i<m&&i<n-1;i++){
    s2.insert(s[i]);
    if(s2.size()>=k) ans++;
  }
  cout<<ans.val()<<endl;
}
0