結果
問題 | No.2772 Appearing Even Times |
ユーザー |
![]() |
提出日時 | 2024-05-31 22:20:52 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 901 ms / 4,000 ms |
コード長 | 4,447 bytes |
コンパイル時間 | 1,470 ms |
コンパイル使用メモリ | 137,800 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-20 23:55:25 |
合計ジャッジ時間 | 12,741 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
#include <string.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cfloat>#include <climits>#include <cmath>#include <complex>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <list>#include <map>#include <memory>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using ll = long long;using pii = pair<int,int>;using pll = pair<ll,ll>;template <typename T> using vc = vector<T>;template <typename T> using vvc = vector<vector<T>>;template <typename T> using vvvc = vector<vector<vector<T>>>;template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }int dx4[] = {1,0,-1,0};int dy4[] = {0,1,0,-1};#define overload5(a, b, c, d, e, name, ...) name#define overload4(a, b, c, d, name, ...) name#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)#define REP1(i, n) for(ll i = 0; i < (n); ++i)#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)#define setbits(j, n) for(ll iiiii = (n), j = lowbit(iiiii); iiiii; iiiii ^= 1 << j, j = lowbit(iiiii))#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(all(v)));)#define fi first#define se second#define pb push_back#define ppb pop_back#define ppf pop_front#define drop(s) cout << #s << endl, exit(0)#define si(c) (int)(c).size()#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))#define rng(v, l, r) v.begin() + (l), v.begin() + (r)#define all(c) c.begin(), c.end()#define rall(c) c.rbegin(), c.rend()#define SORT(v) sort(all(v))#define REV(v) reverse(all(v))#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define overload2(_1, _2, name, ...) name#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))constexpr int mod = 998244353;void mpl(int &x,int y) {x += y;if(x >= mod) x -= mod;}int dp[2][1 << 10][2];int main() {ios::sync_with_stdio(false);cin.tie(nullptr);string n;cin >> n;rep(i,si(n)) {rep(j,1,10) {if(i == 0) {if(j < n[i]-'0') {mpl(dp[1][1 << j][0],1);}if(j == n[i]-'0') {mpl(dp[1][1 << j][1],1);}}else {mpl(dp[1][1 << j][0],1);}}rep(j,1 << 10) {rep(k,2) {rep(l,10) {if(k == 0) {mpl(dp[1][j^(1 << l)][0],dp[0][j][k]);}else {if(l < n[i]-'0') {mpl(dp[1][j^(1 << l)][0],dp[0][j][k]);}if(l == n[i]-'0') {mpl(dp[1][j^(1 << l)][1],dp[0][j][k]);}}}}}rep(j,1 << 10) {rep(k,2) {dp[0][j][k] = dp[1][j][k];dp[1][j][k] = 0;}}}cout << (dp[0][0][0]+dp[0][0][1])%mod << "\n";}