結果

問題 No.2772 Appearing Even Times
ユーザー 👑 binapbinap
提出日時 2024-05-01 11:12:44
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 284 ms / 4,000 ms
コード長 2,208 bytes
コンパイル時間 4,757 ms
コンパイル使用メモリ 265,080 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-20 20:39:04
合計ジャッジ時間 8,340 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;
ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return
    os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : "");
    return os;}
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);}
using mint = modint998244353;
void solve(string s){
int n = s.size();
if(n % 2 == 1){
string t;
rep(i, n - 1) t += '9';
solve(t);
return;
}
vector<mint> equal(1 << 10);
vector<mint> small(1 << 10);
equal[0] = 1;
rep(i, n){
vector<mint> equal_old(1 << 10);
vector<mint> small_old(1 << 10);
swap(equal, equal_old);
swap(small, small_old);
int num = s[i] - '0';
rep(bit, 1 << 10){
for(int x = 0; x < num; x++) small[bit ^ (1 << x)] += equal_old[bit];
equal[bit ^ (1 << num)] += equal_old[bit];
if(bit == 1 && i % 2 == 1){
small[bit ^ (1 << 0)] += small_old[bit];
for(int x = 1; x <= 9; x++) small[bit ^ (1 << x)] += (small_old[bit] - 1);
}else{
for(int x = 0; x <= 9; x++) small[bit ^ (1 << x)] += small_old[bit];
}
}
}
cout << (equal[0] + small[0] - 1).val() << "\n";
}
int main(){
string s;
cin >> s;
solve(s);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0