結果
問題 | No.2905 Nabeatsu Integration |
ユーザー |
👑 ![]() |
提出日時 | 2024-09-27 20:51:43 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 164 ms / 2,000 ms |
コード長 | 2,652 bytes |
コンパイル時間 | 3,091 ms |
コンパイル使用メモリ | 228,804 KB |
実行使用メモリ | 86,300 KB |
最終ジャッジ日時 | 2024-09-27 20:52:02 |
合計ジャッジ時間 | 12,305 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 70 |
ソースコード
#include <bits/stdc++.h>using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}#include <atcoder/modint>using mint = atcoder::modint998244353;#include <atcoder/string>void solve();// CYAN / FREDERICint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;// cin >> t;rep(i, 0, t) solve();}void solve(){string S;cin >> S;int N = S.size();auto Z = atcoder::z_algorithm(S);vector to(N + 1, vector<int>(10));rep(i, 1, N){if (i + Z[i] == N) continue;int c = S[Z[i]] - '0';chmax(to[i + Z[i]][c], Z[i] + 1);}// rep(i, 0, N) vec_out(to[i]);vector<mint> A(N + 1), B(N + 1);A[0] = 1;rep(i, 0, N){mint a = 0, b = 10;rep(j, 0, 10) if (S[i] - '0' != j){a += A[to[i][j]];b += B[to[i][j]];}A[i + 1] = A[i] * 10 - a;B[i + 1] = B[i] * 10 - b;// cout << (-B[i]).val() << "\n";}cout << (-B[N] / A[N] + 1 - N).val() << "\n";}