結果

問題 No.2703 FizzBuzz Letter Counting
ユーザー HIR180
提出日時 2024-03-29 22:06:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,849 ms / 3,000 ms
コード長 12,954 bytes
コンパイル時間 3,795 ms
コンパイル使用メモリ 203,124 KB
最終ジャッジ日時 2025-02-20 15:05:17
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 60
権限があれば一括ダウンロードができます

ソースコード

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

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
//#include <unordered_map>
//#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <atcoder/convolution>
//#include <atcoder/lazysegtree>
//#include <atcoder/maxflow>
//#include <atcoder/mincostflow>
//#include <atcoder/segtree>
//#include <atcoder/string>
using namespace std;
//using namespace atcoder;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define gnr(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define per(i,b) gnr(i,0,b)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) (int)(x.size())
#define pcnt(x) __builtin_popcountll(x)
#define all(x) x.begin(),x.end()
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
    return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
    os<<"{";
    for(auto e:v)os<<e<<",";
    return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
    //don't make x negative!
    size_t operator()(pair<int,int> x)const{
        return operator()(uint64_t(x.first)<<32|x.second);
    }
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;
template<class T>
void o(const T &a,bool space=false){
    cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
struct mint{
    ll v;
    mint(ll vv=0){s(vv%mod+mod);}
    mint& s(ll vv){
        v=vv<mod?vv:vv-mod;
        return *this;
    }
    mint operator-()const{return mint()-*this;}
    mint &operator+=(const mint&rhs){return s(v+rhs.v);}
    mint &operator-=(const mint&rhs){return s(v+mod-rhs.v);}
    mint &operator*=(const mint&rhs){v=ll(v)*rhs.v%mod;return *this;}
    mint &operator/=(const mint&rhs){return *this*=rhs.inv();}
    mint operator+(const mint&rhs)const{return mint(*this)+=rhs;}
    mint operator-(const mint&rhs)const{return mint(*this)-=rhs;}
    mint operator*(const mint&rhs)const{return mint(*this)*=rhs;}
    mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}
    mint pow(ll n)const{
        if(n<0)return inv().pow(-n);
        mint res(1),x(*this);
        while(n){
            if(n&1)res*=x;
            x*=x;
            n>>=1;
        }
        return res;
    }
    mint inv()const{return pow(mod-2);}
    friend mint operator+(ll x,const mint&y){
        return mint(x)+y;
    }
    friend mint operator-(ll x,const mint&y){
        return mint(x)-y;
    }
    friend mint operator*(ll x,const mint&y){
        return mint(x)*y;
    }
    friend mint operator/(ll x,const mint&y){
        return mint(x)/y;
    }
    friend ostream& operator<<(ostream&os,const mint&m){
        return os<<m.v;
    }
    friend istream& operator>>(istream&is,mint&m){
        ll x;is>>x;
        m=mint(x);
        return is;
    }
    bool operator<(const mint&r)const{return v<r.v;}
    bool operator==(const mint&r)const{return v==r.v;}
    bool operator!=(const mint&r)const{return v!=r.v;}
    explicit operator bool()const{
        return v;
    }
};
ll modpow(ll x,ll n,ll _md=mod){
    ll res=1;
    while(n>0){
        if(n&1) res=res*x%_md;
        x=x*x%_md;
        n>>=1;
    }
    return res;
}
#define _sz 1
mint F[_sz],R[_sz];
void make(){
    F[0] = 1;
    for(int i=1;i<_sz;i++) F[i] = F[i-1] * i;
    R[_sz-1] = F[_sz-1].pow(mod-2);
    for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1);
}
mint C(int a,int b){
    if(b < 0 || a < b) return mint();
    return F[a]*R[b]*R[a-b];
}
using ld=long double;
using vi=vc<int>;
using ull=unsigned long long;
/*int dst(P p, P q){
    return (p.a-q.a)*(p.a-q.a)+(p.b-q.b)*(p.b-q.b);
}*/
/*template<class t>
void add_inplace(t &a, t b){
    if(a.size() < b.size()) swap(a, b);
    for(int i=0;i<si(b);i++){
        a[i] += b[i];
        if(a[i] < 0) a[i] += mod;
        if(a[i] >= mod) a[i] -= mod;
    }
    return ;
}*/
template<class t>
void ov(const vc<t>&a){
    if(a.empty()) return;
    rep(i, si(a)) cout << a[i] << (i+1==si(a)?'\n':' ');
}
//o(ans?"Yes":"No");
template<class T> using mat = vc<vc<T>>;
template<class T=int>
mat<T> make_e(int n, int m, T v = (int)1){
    mat<T>ret(n, vc<T>(m));
    rep(i, min(n, m)) ret[i][i] = v;
    return ret;
}
template<class T>
mat<T> operator+(mat<T> a, mat<T> b){
    assert(a.size() == b.size());
    if(a.size()) assert(a[0].size() == b[0].size());
    
    rep(i, a.size()) rep(j, a[0].size()){
        a[i][j] += b[i][j];
        if(a[i][j] >= mod) a[i][j] -= mod;
    }
    
    return a;
}
template<class T>
mat<T> operator-(mat<T> a, mat<T> b){
    assert(a.size() == b.size());
    if(a.size()) assert(a[0].size() == b[0].size());
    
    rep(i, a.size()) rep(j, a[0].size()){
        a[i][j] += mod - b[i][j];
        if(a[i][j] >= mod) a[i][j] -= mod;
    }
    
    return a;
}
template<class T>
mat<T> operator*(mat<T> a, mat<T> b){
    if(a.empty() || b.empty()) return mat<T>();
    int n = a.size();
    int m = b[0].size();
    int len = a[0].size();
    assert(len == b.size());
    mat<T>ret(n);
    rep(i, n) ret[i] = vc<T>(m);
    
    rep(i, n) rep(j, len) rep(k, m){
        ll add = (ll)(a[i][j]) * b[j][k];
        add %= mod;
        ret[i][k] += add;
        if(ret[i][k] >= mod) ret[i][k] -= mod;
    }
    return ret;
}
template<class T>
vc<T> operator*(mat<T> a, vc<T> b){
    if(a.empty() || b.empty()) return vc<T>();
    assert(si(a[0]) == si(b));
    vc<T>ret(si(a));
    rep(i, si(a)){
        rep(j, si(b)){
            ll add = (ll)a[i][j] * b[j] % mod;
            ret[i] += add;
            if(ret[i] >= mod) ret[i] -= mod;
        }
    }
    return ret;
}
template<class T>
mat<T> modpow(mat<T> a, int n){
    if(a.empty()) return mat<T>();
    mat<T>ret = make_e(a.size(), a[0].size(), (T)(1));
    while(n){
        if(n&1) ret = ret * a;
        a = a * a;
        n /= 2;
    }
    return ret;
}
template<class T>
ll det(mat<T>m){
    int n = m.size();
    assert(n > 0 && m[0].size() == n);
    
    ll ret = 1;
    for(int j=0;j<n;j++){
        int pivot=-1;
        for(int i=j;i<n;i++){
            if(m[i][j]){
                pivot = i; break;
            }
        }
        if(pivot == -1) return 0;
        if(j != pivot){
            rep(k,n) swap(m[j][k],m[pivot][k]);
            ret = -ret;
        }
        ret = ret * m[j][j] % mod;
        ll rev = modpow(m[j][j],mod-2);
        for(int i=j+1;i<n;i++){
            if(m[i][j]){
                ll gg = (ll)m[i][j]*rev%mod;
                for(int g=j;g<n;g++){
                    m[i][g] -= (ll)m[j][g]*gg%mod;
                    if(m[i][g]<0) m[i][g]+=mod;
                }
            }
        }
    }
    return (mod+ret)%mod;
}
//vc<vc<int>>bs;
template<class T>
vc<T>AxB(mat<T>A, vc<T>b){
    int r = A.size(), c = A[0].size();
    assert(b.size() == r);
    
    int nxt = 0, free = 0;
    vc<T>ret(c, 0);
    
    rep(j, c){
        int pivot = -1;
        for(int i=nxt;i<r;i++){
            if(A[i][j]){
                pivot = i; break;
            }
        }
        if(pivot == -1){
            free ++;
            continue;
        }
        if(nxt != pivot){
            rep(k, c) swap(A[nxt][k],A[pivot][k]);
            swap(b[nxt], b[pivot]);
        }
        ll rev = modpow(A[nxt][j],mod-2);
        for(int g=j;g<c;g++){
            A[nxt][g] = A[nxt][g]*rev%mod;
        }
        b[nxt] = b[nxt]*rev%mod;
        rep(i, r){
            if(i != nxt and A[i][j]){
                T gg = A[i][j];
                for(int g=j;g<c;g++){
                    A[i][g] -= A[nxt][g]*gg%mod;
                    if(A[i][g]<0) A[i][g]+=mod;
                }
                b[i] -= b[nxt]*gg%mod;
                if(b[i]<0) b[i]+=mod;
            }
        }
        nxt ++;
    }
    vc<int>fix(c, 0);
    vc<int>top(nxt);
    rep(i, nxt){
        rep(j, c){
            if(A[i][j] != 0){
                top[i] = j;
                fix[j] = 1;
                ret[j] = b[i];
                break;
            }
        }
    }
    //error
    for(int i=nxt;i<r;i++) if(b[i] != 0) return vc<T>();
    //get basis
    /*vc<vc<T>>basis(free);
    int id = 0;
    rep(j, c){
        if(fix[j] == 1) continue;
        vc<T>tmp(c, 0);
        tmp[j] = 1;
        for(int i=0;i<nxt;i++){
            tmp[top[i]] = (mod-A[i][j])%mod;
        }
        basis[id++] = tmp;
    }
    bs = basis;*/
    return ret;
}
//A...n*n matrix or n*2n matrix, left = A and right = E
template<class T>
mat<T>inv(mat<T>A){
    int r = A.size(), c = A[0].size();
    if(c == r){
        rep(i, r){
            A[i].resize(r+r, 0);
            rep(j, r) A[i][r+j] = (i == j);
        }
        c += r;
    }
    assert(c == r+r);
    rep(j, r){
        int pivot = -1;
        for(int i=j;i<r;i++){
            if(A[i][j]){
                pivot = i; break;
            }
        }
        if(pivot == -1){
            return mat<T>();
        }
        if(j != pivot){
            rep(k, c) swap(A[j][k],A[pivot][k]);
        }
        ll rev = modpow(A[j][j],mod-2);
        for(int g=j;g<c;g++){
            A[j][g] = A[j][g]*rev%mod;
        }
        rep(i, r){
            if(i != j and A[i][j]){
                T gg = A[i][j];
                for(int g=j;g<c;g++){
                    A[i][g] -= A[j][g]*gg%mod;
                    if(A[i][g]<0) A[i][g]+=mod;
                }
            }
        }
    }
    mat<int>ret = make_e(r, r, 0LL);
    rep(i, r) rep(j, r){
        assert(A[i][j] == (i==j));
        ret[i][j] = A[i][r+j];
    }
    return ret;
}
//B...bitset
//T...int
//F2 /64
template<class B, class T=int>
vc<T>AxB(vc<B>A, vc<T>b){
    int r = A.size(), c = A[0].size();
    assert(b.size() == r);
    
    int nxt = 0;
    vc<T>ret(c);
    
    rep(j, c){
        int pivot = -1;
        for(int i=nxt;i<r;i++){
            if(A[i][j]){
                pivot = i; break;
            }
        }
        if(pivot == -1){
            continue;
        }
        if(nxt != pivot){
            swap(A[nxt], A[pivot]);
            swap(b[nxt], b[pivot]);
        }
        rep(i, r){
            if(i != nxt and A[i][j]){
                A[i] ^= A[nxt];
                b[i] ^= b[nxt];
            }
        }
        nxt ++;
    }
    vc<T>fix(c, 0);
    vc<T>top(nxt);
    rep(i, nxt){
        rep(j, c){
            if(A[i][j] != 0){
                top[i] = j;
                fix[j] = 1;
                ret[j] = b[i];
                break;
            }
        }
    }
    //error
    for(int i=nxt;i<r;i++) if(b[i] != 0) return vc<T>();
    return ret;
}
void solve(){
    mat<int>M[10];
    rep(i,10){
        M[i] = make_e<int>(120, 120, 0);
    }
    rep(now,10){
        rep(m3, 3){
            rep(m5, 5){
                rep(eq, 2){
                    rep(isz, 2){
                        int id = m3*20 + m5*4 + eq*2 + isz;
                        //id -> count
                        rep(nxt, 10){
                            if(eq == 1 and now < nxt) continue;
                            int nid = (m3*10+nxt)%3*20 + (m5*10+nxt)%5*4
                            + (eq == 1 and now == nxt)*2 + (isz == 1 and nxt == 0);
                            
                            M[now][nid][id] ++;
                            if(isz == 1 and nxt == 0);
                            else M[now][nid+60][id] ++;
                            M[now][nid+60][id+60] ++;
                        }
                    }
                }
            }
        }
    }
    vi dp(120);
    //0,0,1,1
    dp[3] = 1;
    int m;cin>>m;
    int sum = 0;
    vc<P>vec;
    rep(i,m){
        int v; int len;
        cin>>v>>len;
        sum += len;
        vec.eb(v, len);
        //dp = (modpow(M[v],len)*dp);
    }
    
    dp = modpow(M[9],sum-1)*dp;
    auto get=[&](int t, int add)->mint{
        //10^t+add / 15
        int rem = modpow(10, t, 15) + add;
        rem %= 15;
        
        //10^t+add-rem / 15
        int up = modpow(10, t) + add - rem;
        up *= modpow(15, mod-2);
        
        return mint(up%mod);
    };
    auto get2=[&](int add)->mint{
        //vec+add / 15
        int now = 0;
        for(auto [v, len]:vec){
            now = now * modpow(10, len, 15) % 15;
            //v * (10^len-1) / 9
            int up = v * (modpow(10, len, 135)-1) % 135;
            up /= 9;
            now = (now+up)%15;
        }
        int rem = (now+add)%15;
        //vec+add-rem / 15
        mint ret;
        for(auto [v, len]:vec){
            ret = ret*modpow(10,len);
            ret += v*(modpow(10,len)-1)*modpow(9,mod-2);
        }
        ret += add-rem;
        ret /= mint(15);
        return ret;
    };
    
    mint ans;
    rep(r,15){
        //[10^(sum-1), vec]
        //[10^(sum-1)+15-r, vec+15-r]
        mint now = get2(15-r) - get(sum-1, 14-r);
        
        if(r == 0){
            ans += now * 8;
        }
        else if(r%3 == 0 or r%5 == 0){
            ans += now * 4;
        }
        else{
            ans += now * (sum%mod);
        }
    }
    {
        rep(m3, 3){
            rep(m5, 5){
                rep(eq, 2){
                    rep(isz, 2){
                        int id = m3*20 + m5*4 + eq*2 + isz;
                        if(m3 == 0 and m5 == 0){
                            ans += dp[id] * 8 % mod;
                        }
                        else if(m3 == 0 or m5 == 0){
                            ans += dp[id] * 4 % mod;
                        }
                        else{
                            ans += dp[id+60];
                        }
                    }
                }
            }
        }
    }
    o(ans+mod-8);
}
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);
    int t; t=1;//cin >> t;
    while(t--) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0