結果
問題 | No.1195 数え上げを愛したい(文字列編) |
ユーザー | heno239 |
提出日時 | 2023-04-21 20:17:31 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 482 ms / 3,000 ms |
コード長 | 8,305 bytes |
コンパイル時間 | 2,453 ms |
コンパイル使用メモリ | 170,700 KB |
実行使用メモリ | 25,432 KB |
最終ジャッジ日時 | 2024-04-24 06:51:39 |
合計ジャッジ時間 | 10,458 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 477 ms
25,432 KB |
testcase_01 | AC | 482 ms
25,304 KB |
testcase_02 | AC | 478 ms
25,308 KB |
testcase_03 | AC | 61 ms
14,972 KB |
testcase_04 | AC | 70 ms
14,992 KB |
testcase_05 | AC | 68 ms
20,376 KB |
testcase_06 | AC | 19 ms
11,904 KB |
testcase_07 | AC | 19 ms
11,852 KB |
testcase_08 | AC | 90 ms
13,028 KB |
testcase_09 | AC | 459 ms
24,152 KB |
testcase_10 | AC | 261 ms
17,900 KB |
testcase_11 | AC | 424 ms
23,440 KB |
testcase_12 | AC | 377 ms
22,036 KB |
testcase_13 | AC | 328 ms
18,972 KB |
testcase_14 | AC | 217 ms
17,488 KB |
testcase_15 | AC | 252 ms
18,184 KB |
testcase_16 | AC | 225 ms
17,872 KB |
testcase_17 | AC | 96 ms
13,272 KB |
testcase_18 | AC | 397 ms
20,884 KB |
testcase_19 | AC | 379 ms
21,908 KB |
testcase_20 | AC | 330 ms
18,108 KB |
testcase_21 | AC | 421 ms
23,568 KB |
testcase_22 | AC | 318 ms
18,320 KB |
testcase_23 | AC | 20 ms
11,980 KB |
testcase_24 | AC | 20 ms
11,776 KB |
testcase_25 | AC | 19 ms
11,976 KB |
ソースコード
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<unordered_set> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> #include<chrono> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; //ll mod = 1; constexpr ll mod = 998244353; //constexpr ll mod = 1000000007; const int mod17 = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; using ld = long double; typedef pair<ld, ld> LDP; const ld eps = 1e-10; const ld pi = acosl(-1.0); template<typename T> void chmin(T& a, T b) { a = min(a, b); } template<typename T> void chmax(T& a, T b) { a = max(a, b); } template<typename T> vector<T> vmerge(vector<T>& a, vector<T>& b) { vector<T> res; int ida = 0, idb = 0; while (ida < a.size() || idb < b.size()) { if (idb == b.size()) { res.push_back(a[ida]); ida++; } else if (ida == a.size()) { res.push_back(b[idb]); idb++; } else { if (a[ida] < b[idb]) { res.push_back(a[ida]); ida++; } else { res.push_back(b[idb]); idb++; } } } return res; } template<typename T> void cinarray(vector<T>& v) { rep(i, v.size())cin >> v[i]; } template<typename T> void coutarray(vector<T>& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; //if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } //mod should be <2^31 struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } bool operator<(modint a, modint b) { return a.n < b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } template<typename T> void addv(vector<T>& v, int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } /*const int mn = 2000005; bool isp[mn]; vector<int> ps; void init() { fill(isp + 2, isp + mn, true); for (int i = 2; i < mn; i++) { if (!isp[i])continue; ps.push_back(i); for (int j = 2 * i; j < mn; j += i) { isp[j] = false; } } }*/ //[,val) template<typename T> auto prev_itr(set<T>& st, T val) { auto res = st.lower_bound(val); if (res == st.begin())return st.end(); res--; return res; } //[val,) template<typename T> auto next_itr(set<T>& st, T val) { auto res = st.lower_bound(val); return res; } using mP = pair<modint, modint>; mP operator+(mP a, mP b) { return { a.first + b.first,a.second + b.second }; } mP operator+=(mP& a, mP b) { a = a + b; return a; } mP operator-(mP a, mP b) { return { a.first - b.first,a.second - b.second }; } mP operator-=(mP& a, mP b) { a = a - b; return a; } LP operator+(LP a, LP b) { return { a.first + b.first,a.second + b.second }; } LP operator+=(LP& a, LP b) { a = a + b; return a; } LP operator-(LP a, LP b) { return { a.first - b.first,a.second - b.second }; } LP operator-=(LP& a, LP b) { a = a - b; return a; } mt19937 mt(time(0)); const string drul = "DRUL"; string senw = "SENW"; //DRUL,or SENW //int dx[4] = { 1,0,-1,0 }; //int dy[4] = { 0,1,0,-1 }; //----------------------------------------- int get_premitive_root() { int primitive_root = 0; if (!primitive_root) { primitive_root = [&]() { set<int> fac; int v = mod - 1; for (ll i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i; if (v > 1) fac.insert(v); for (int g = 1; g < mod; g++) { bool ok = true; for (auto i : fac) if (mod_pow(g, (mod - 1) / i) == 1) { ok = false; break; } if (ok) return g; } return -1; }(); } return primitive_root; } const int proot = get_premitive_root(); typedef vector <modint> poly; void dft(poly& f, bool inverse = false) { int n = f.size(); if (n == 1)return; static poly w{ 1 }, iw{ 1 }; for (int m = w.size(); m < n / 2; m *= 2) { modint dw = mod_pow(proot, (mod - 1) / (4 * m)), dwinv = (modint)1 / dw; w.resize(m * 2); iw.resize(m * 2); for (int i = 0; i < m; i++)w[m + i] = w[i] * dw, iw[m + i] = iw[i] * dwinv; } if (!inverse) { for (int m = n; m >>= 1;) { for (int s = 0, k = 0; s < n; s += 2 * m, k++) { for (int i = s; i < s + m; i++) { modint x = f[i], y = f[i + m] * w[k]; f[i] = x + y, f[i + m] = x - y; } } } } else { for (int m = 1; m < n; m *= 2) { for (int s = 0, k = 0; s < n; s += 2 * m, k++) { for (int i = s; i < s + m; i++) { modint x = f[i], y = f[i + m]; f[i] = x + y, f[i + m] = (x - y) * iw[k]; } } } modint n_inv = (modint)1 / (modint)n; for (modint& v : f)v *= n_inv; } } poly multiply(poly g, poly h) { int n = 1; int pi = 0, qi = 0; rep(i, g.size())if (g[i])pi = i; rep(i, h.size())if (h[i])qi = i; int sz = pi + qi + 2; while (n < sz)n *= 2; g.resize(n); h.resize(n); dft(g); dft(h); rep(i, n) { g[i] *= h[i]; } dft(g, true); return g; } //i<=j poly ordered_multiply(poly p, poly q, bool eq) { poly res; function<void(int, int)> dfs = [&](int l, int r) { if (l + 1 == r)return; int m = (l + r) / 2; dfs(l, m); dfs(m, r); poly pl, pr; Rep(j, l, m)if (j < p.size())pl.push_back(p[j]); Rep(j, m, r)pr.push_back(q[j]); poly pp = multiply(pl, pr); rep(j, pp.size())addv(res, l + m + j, pp[j]); }; dfs(0, q.size()); if (eq) { rep(j, q.size())if (j < p.size())addv(res, 2 * j, p[j] * q[j]); } return res; } void solve(){ int alf[26] = {}; string s; cin >> s; rep(i, s.size())alf[s[i] - 'a']++; sort(alf, alf + 26); poly dp = { 1 }; rep(i, 26) { int c = alf[i]; if (c == 0)continue; poly p(c + 1); rep(j, c + 1) { p[j] = factinv[j]; } poly q = dp; rep(j, dp.size()) { q[j] = q[j] * factinv[j]; } poly r = multiply(p, q); rep(j, r.size()) { r[j] = r[j] * fact[j]; } swap(dp, r); } modint ans = 0; for (int i = 1; i < dp.size(); i++)ans += dp[i]; cout << ans << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(12); init_f(); //init(); //while(true) //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }