結果
問題 | No.1702 count good string |
ユーザー |
![]() |
提出日時 | 2024-02-22 07:30:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 62 ms / 2,000 ms |
コード長 | 3,958 bytes |
コンパイル時間 | 1,245 ms |
コンパイル使用メモリ | 132,312 KB |
最終ジャッジ日時 | 2025-02-19 18:42:37 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <array>#include <iterator>#include <string>#include <cctype>#include <cstring>#include <cstdlib>#include <cassert>#include <cmath>#include <ctime>#include <iomanip>#include <numeric>#include <stack>#include <queue>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <bitset>#include <random>#include <utility>#include <functional>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};/* using mint = modint<998244353>; */using mint = modint<1000000007>;template<class S>struct combination{private:vector<S> f,invf;public:combination(int N = 0) : f(1,1),invf(1,1){update(N);}void update(int N){if((int)f.size() > N) return;int pi = (int)f.size();N = max(N,pi*2);f.resize(N+1),invf.resize(N+1);for(int i = pi;i <= N;i++) f[i] = f[i-1]*i;invf[N] = S(1)/f[N];for(int i = N-1;i >= pi;i--) invf[i] = invf[i+1]*(i+1);}S factorial(int N){update(N);return f[N];}S invfactorial(int N){update(N);return invf[N];}S P(int N,int K){assert(0 <= K && K <= N);update(N);return f[N]*invf[N-K];}S C(int N,int K){assert(0 <= K && K <= N);update(N);return f[N]*invf[K]*invf[N-K];}};combination<mint> C;void Main(){int N;string S;cin >> N >> S;vector<string> T = {"yukicoder"};for(int i = 0;i < 9;i++){string U = T[0];U[i] = '?';T.push_back(U);}mint ans = 0;for(int k = 0;k < (int)T.size();k++){const string U = T[k];vector<mint> dp(10);dp[0] = 1;for(int i = 0;i < N;i++){vector<mint> n_dp(10);for(int j = 0;j <= 9;j++){n_dp[j] += dp[j];if(j < 9 && S[i] == U[j]){n_dp[j + 1] += dp[j];}}swap(dp,n_dp);}ans += dp[9];}cout << ans << "\n";}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;/* cin >> tt; */while(tt--) Main();}