結果
問題 | No.2772 Appearing Even Times |
ユーザー |
|
提出日時 | 2024-05-31 22:54:39 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 521 ms / 4,000 ms |
コード長 | 3,240 bytes |
コンパイル時間 | 2,959 ms |
コンパイル使用メモリ | 211,632 KB |
実行使用メモリ | 166,016 KB |
最終ジャッジ日時 | 2024-12-21 01:00:16 |
合計ジャッジ時間 | 9,614 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;template<const unsigned int MOD> struct prime_modint {using mint = prime_modint;unsigned int v;prime_modint() : v(0) {}prime_modint(unsigned int a) { a %= MOD; v = a; }prime_modint(unsigned long long a) { a %= MOD; v = a; }prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }static constexpr int mod() { return MOD; }mint& operator++() {v++; if(v == MOD)v = 0; return *this;}mint& operator--() {if(v == 0)v = MOD; v--; return *this;}mint operator++(int) { mint result = *this; ++*this; return result; }mint operator--(int) { mint result = *this; --*this; return result; }mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }mint& operator*=(const mint& rhs) {v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint r = 1, x = *this;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const { assert(v); return pow(MOD - 2); }friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }};//using mint = prime_modint<1000000007>;using mint = prime_modint<998244353>;int main(){ios::sync_with_stdio(false);cin.tie(0);string s;cin >> s;int n = s.size();vector dp(n + 1, vector(2, vector(2, vector<mint>(1 << 10))));dp[0][1][1][0] = 1;for(int i = 0; i < n; i++){for(int ld = 0; ld < 2; ld++){for(int j = 0; j < 2; j++){int r = j ? s[i] - '0' : 9;for(int k = 0; k < (1 << 10); k++){if(dp[i][ld][j][k] == 0) continue;for(int l = 0; l <= r; l++){if(ld == 1 && l == 0){dp[i + 1][1][j & (l == r)][k] += dp[i][ld][j][k];}else{dp[i + 1][0][j & (l == r)][k ^ (1 << l)] += dp[i][ld][j][k];}}}}}}mint ans;for(int j = 0; j < 2; j++){ans += dp[n][0][j][0];}cout << ans << '\n';}