結果
問題 | No.2772 Appearing Even Times |
ユーザー |
|
提出日時 | 2024-05-31 22:50:11 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,022 ms / 4,000 ms |
コード長 | 2,802 bytes |
コンパイル時間 | 7,828 ms |
コンパイル使用メモリ | 337,828 KB |
実行使用メモリ | 166,144 KB |
最終ジャッジ日時 | 2024-12-21 00:47:30 |
合計ジャッジ時間 | 19,454 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }typedef long long ll;typedef vector<vector<int>> Graph;typedef pair<int, int> pii;typedef pair<ll, ll> pll;#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)#define rep(i,n) for (int i = 0;i < (int)(n); i++)#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define my_sort(x) sort(x.begin(), x.end())#define my_max(x) *max_element(all(x))#define my_min(x) *min_element(all(x))template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }const int INF = (1<<30) - 1;const ll LINF = (1LL<<62) - 1;const int MOD = 998244353;const int MOD2 = 1e9+7;const double PI = acos(-1);vector<int> di = {1,0,-1,0};vector<int> dj = {0,1,0,-1};#ifdef LOCAL# include <debug_print.hpp># define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing mint = modint998244353;int main(){cin.tie(0);ios_base::sync_with_stdio(false);string N; cin >> N;int L = N.size();int C = 10;int C2 = 1 << C;vector dp(L + 1, vector(2, vector(2, vector<mint>(C2))));dp[0][0][0][0] = 1; // dp[i][f][cnt][s]rep(i, L)rep(f, 2)rep(cnt, 2)rep(s, C2)if(dp[i][f][cnt][s]!=0){mint v = dp[i][f][cnt][s];rep(c, C){if(f == 0 && cnt == 0){if(c == 0) dp[i + 1][1][0][s] += v;else if(c < N[i] - '0') dp[i + 1][1][1][s ^ (1 << c)] += v;else if(c == N[i] - '0') dp[i + 1][0][1][s ^ (1 << c)] += v;}if(f == 1 && cnt == 0){if(c == 0) dp[i + 1][1][0][s] += v;else dp[i + 1][1][1][s ^ (1 << c)] += v;}if(f == 0 && cnt == 1){if(c < N[i] - '0') dp[i + 1][1][1][s ^ (1 << c)] += v;if(c == N[i] - '0') dp[i + 1][0][1][s ^ (1 << c)] += v;}if(f == 1 && cnt == 1){dp[i + 1][1][1][s ^ (1 << c)] += v;}}}mint ans = dp[L][0][1][0] + dp[L][1][1][0];cout << ans << endl;}