#936748 (C++17) No.2578 Jewelry Store

• 問題: No.2578 Jewelry Store
• ユーザー: i_am_noob
• 提出日時: 2023-12-06 01:28:53
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,017 ms / 3,500 ms
• コード長: 7,258 bytes
• コンパイル時間: 4,506 ms
• コンパイル使用メモリ: 276,116 KB
• 実行使用メモリ: 5,736 KB
• 最終ジャッジ日時: 2024-09-27 00:55:36
• 合計ジャッジ時間: 13,862 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	9 ms; 5,376 KB
testcase_03	AC	7 ms; 5,376 KB
testcase_04	AC	22 ms; 5,376 KB
testcase_05	AC	6 ms; 5,376 KB
testcase_06	AC	9 ms; 5,376 KB
testcase_07	AC	22 ms; 5,376 KB
testcase_08	AC	7 ms; 5,376 KB
testcase_09	AC	23 ms; 5,376 KB
testcase_10	AC	43 ms; 5,376 KB
testcase_11	AC	7 ms; 5,376 KB
testcase_12	AC	6 ms; 5,376 KB
testcase_13	AC	6 ms; 5,376 KB
testcase_14	AC	6 ms; 5,376 KB
testcase_15	AC	6 ms; 5,376 KB
testcase_16	AC	42 ms; 5,376 KB
testcase_17	AC	22 ms; 5,376 KB
testcase_18	AC	5 ms; 5,376 KB
testcase_19	AC	13 ms; 5,376 KB
testcase_20	AC	23 ms; 5,376 KB
testcase_21	AC	22 ms; 5,376 KB
testcase_22	AC	9 ms; 5,376 KB
testcase_23	AC	14 ms; 5,376 KB
testcase_24	AC	8 ms; 5,376 KB
testcase_25	AC	10 ms; 5,376 KB
testcase_26	AC	9 ms; 5,376 KB
testcase_27	AC	194 ms; 5,376 KB
testcase_28	AC	289 ms; 5,376 KB
testcase_29	AC	266 ms; 5,376 KB
testcase_30	AC	333 ms; 5,376 KB
testcase_31	AC	214 ms; 5,376 KB
testcase_32	AC	140 ms; 5,376 KB
testcase_33	AC	178 ms; 5,376 KB
testcase_34	AC	223 ms; 5,376 KB
testcase_35	AC	57 ms; 5,376 KB
testcase_36	AC	192 ms; 5,376 KB
testcase_37	AC	88 ms; 5,376 KB
testcase_38	AC	116 ms; 5,376 KB
testcase_39	AC	104 ms; 5,376 KB
testcase_40	AC	114 ms; 5,376 KB
testcase_41	AC	102 ms; 5,376 KB
testcase_42	AC	86 ms; 5,376 KB
testcase_43	AC	153 ms; 5,376 KB
testcase_44	AC	75 ms; 5,376 KB
testcase_45	AC	128 ms; 5,376 KB
testcase_46	AC	99 ms; 5,376 KB
testcase_47	AC	571 ms; 5,376 KB
testcase_48	AC	292 ms; 5,736 KB
testcase_49	AC	1,017 ms; 5,376 KB
testcase_50	AC	908 ms; 5,376 KB
testcase_51	AC	88 ms; 5,376 KB
testcase_52	AC	376 ms; 5,376 KB
testcase_53	AC	37 ms; 5,376 KB

ソースコード

#include<bits/stdc++.h>
using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

using ll=long long;
using u32=unsigned int;
using u64=unsigned long long;
using i128=__int128;
using u128=unsigned __int128;
using f128=__float128;

using pii=pair<int,int>;
using pll=pair<ll,ll>;

template<typename T> using vc=vector<T>;
template<typename T> using vvc=vc<vc<T>>;
template<typename T> using vvvc=vc<vvc<T>>;

using vi=vc<int>;
using vll=vc<ll>;
using vvi=vc<vi>;
using vvll=vc<vll>;

#define vv(type,name,n,...) \
    vector<vector<type>> name(n,vector<type>(__VA_ARGS__))
#define vvv(type,name,n,m,...) \
    vector<vector<vector<type>>> name(n,vector<vector<type>>(m,vector<type>(__VA_ARGS__)))

template<typename T> using min_heap=priority_queue<T,vector<T>,greater<T>>;
template<typename T> using max_heap=priority_queue<T>;

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))

template<typename T, typename S> constexpr T ifloor(const T a, const S b){return a/b-(a%b&&(a^b)<0);}
template<typename T, typename S> constexpr T iceil(const T a, const S b){return ifloor(a+b-1,b);}

template<typename T>
void sort_unique(vector<T> &vec){
    sort(vec.begin(),vec.end());
    vec.resize(unique(vec.begin(),vec.end())-vec.begin());
}

template<typename T, typename S> constexpr bool chmin(T &a, const S b){if(a>b) return a=b,true; return false;}
template<typename T, typename S> constexpr bool chmax(T &a, const S b){if(a<b) return a=b,true; return false;}

template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;}
template<typename T, typename S> ostream& operator << (ostream& o, const pair<T,S> &p){return o << p.first << ' ' << p.second;}

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

template<typename T> void print(vector<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(unordered_set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(T && x) {cout << x << "\n";}
template<typename T, typename... S> void print(T && x, S&&... y) {cout << x << ' ';print(y...);}

template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;}

vvi read_graph(int n, int m, int base=1){
    vvi adj(n);
    for(int i=0,u,v; i<m; ++i){
        cin >> u >> v,u-=base,v-=base;
        adj[u].pb(v),adj[v].pb(u);
    }
    return adj;
}

vvi read_tree(int n, int base=1){return read_graph(n,n-1,base);}

template<typename T, typename S> pair<T,S> operator + (const pair<T,S> &a, const pair<T,S> &b){return {a.first+b.first,a.second+b.second};}

template<typename T> constexpr T inf=0;
template<> constexpr int inf<int> = 0x3f3f3f3f;
template<> constexpr ll inf<ll> = 0x3f3f3f3f3f3f3f3f;

template<typename T> vector<T> operator += (vector<T> &a, int val){for(auto &i: a) i+=val; return a;}

template<typename T> T isqrt(const T &x){T y=sqrt(x+2); while(y*y>x) y--; return y;}

#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())

#include<atcoder/all>
using namespace atcoder;

using mint=modint998244353;
//using mint=modint1000000007;

ll mul(ll x, ll y, ll p) {return (x * y - (ll)((long double)x / p * y) * p + p) % p;}
vector<ll> chk = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
ll Pow(ll a, ll b, ll n) {
  ll res = 1;
  for (; b; b >>= 1, a = mul(a, a, n))
    if (b & 1) res = mul(res, a, n);
  return res;
}
bool check(ll a, ll d, int s, ll n) {
  a = Pow(a, d, n);
  if (a <= 1) return 1;
  for (int i = 0; i < s; ++i, a = mul(a, a, n)) {
    if (a == 1) return 0;
    if (a == n - 1) return 1;
  }
  return 0;
}
bool IsPrime(ll n) {
  if (n < 2) return 0;
  if (n % 2 == 0) return n == 2;
  ll d = n - 1, s = 0;
  while (d % 2 == 0) d >>= 1, ++s;
  for (ll i : chk) if (!check(i, d, s, n)) return 0;
  return 1;
}
const vector<ll> small = {2, 3, 5, 7, 11, 13, 17, 19};
ll FindFactor(ll n) {
  if (IsPrime(n)) return 1;
  for (ll p : small) if (n % p == 0) return p;
  ll x, y = 2, d, t = 1;
  auto f = [&](ll a) {return (mul(a, a, n) + t) % n;};
  for (int l = 2; ; l <<= 1) {
    x = y;
    int m = min(l, 32);
    for (int i = 0; i < l; i += m) {
      d = 1;
      for (int j = 0; j < m; ++j) {
        y = f(y), d = mul(d, abs(x - y), n);
      }
      ll g = __gcd(d, n);
      if (g == n) {
        l = 1, y = 2, ++t;
        break;
      }
      if (g != 1) return g;
    }
  }
}
map <ll, int> res;
void PollardRho(ll n) {
  if (n == 1) return;
  if (IsPrime(n)) return ++res[n], void(0);
  ll d = FindFactor(n);
  PollardRho(n / d), PollardRho(d);
}

void ahcorz(){
    int t; ll m; cin >> t >> m;
    res.clear();
    PollardRho(m);
    vc<pair<ll,int>> pr;
    for(auto &[p,x]: res) pr.pb({p,x});
    vc<pair<ll,int>> vec;
    rep(1<<sz(pr)){
        ll cur=1;
        rep(j,sz(pr)) if(i>>j&1) cur*=pr[j].first;
        cur=m/cur;
        vec.pb({cur,__builtin_parity(i)?-1:1});
    }
    while(t--){
        int n,_B,_C,_D; cin >> n >> _B >> _C >> _D;
        mint B=_B,C=_C,D=_D;
        vc<mint> w(n);
        w[0]=B;
        rep(i,n-1) w[i+1]=w[i]*C+D;
        mint res;
        vc<mint> tot(1<<sz(pr),1);
        rep(n){
            ll x; cin >> x;
            ll y=x;
            bool ok=1;
            int val=1,mask=0;
            rep(j,sz(pr)){
                int cnt=0;
                while(x%pr[j].first==0) x/=pr[j].first,cnt++;
                if(cnt>pr[j].second){
                    ok=0;
                    break;
                }
                if(cnt<pr[j].second) mask|=1<<j;
            }
            if(x>1) ok=0;
            if(!ok) continue;
            tot[mask]*=w[i]+1;
        }
        rep(j,sz(pr)) rep(1<<sz(pr)) if(~i>>j&1) tot[i]*=tot[i^(1<<j)];
        rep(1<<sz(pr)) res+=tot[i]*vec[i].second;
        if(m==1) res--;
        print(res.val());
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cout << fixed << setprecision(20);
    int t=1;
    //cin >> t;
    while(t--) ahcorz();
}