結果

問題 No.1532 Different Products
コンテスト
ユーザー PCTprobability
提出日時 2021-05-01 20:51:06
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 7,750 bytes
コンパイル時間 26,937 ms
コンパイル使用メモリ 361,424 KB
最終ジャッジ日時 2025-01-21 05:27:49
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 1
other AC * 12 WA * 33 RE * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = long long;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define pll pair<ll,ll>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define in scanner.read_int()
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}
void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } }
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
const ll t0=1,t1=10,t2=100,t3=1000,t4=10000,t5=100000,t6=1000000,t7=10000000,t8=t7*10,t9=t8*10,t10=t9*10,t11=t10*10,t12=t11*10,t13=t12*10,t14=t13*10,t15=t14*10,t16=t15*10,t17=t16*10,t18=t17*10;
void gbjsmzmfuuvdf(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
class Scanner {
    vector<char> buffer;
    ssize_t n_written;
    ssize_t n_read;

public:
    Scanner(): buffer(1024*1024) { do_read(); }

    int64_t read_int() {
        int64_t ret = 0, sgn = 1;
        int ch = current_char();
        while (isspace(ch)) { ch = next_char(); }
        if (ch == '-') { sgn = -1; ch = next_char(); }
        for (; isdigit(ch); ch = next_char())
            ret = (ret * 10) + (ch - '0');
        return sgn * ret;
    }

private:
    void do_read() {
        ssize_t r = read(0, &buffer[0], buffer.size());
        if (r < 0) {
            throw runtime_error(strerror(errno));
        }
        n_written = r;
        n_read = 0;
    }

    inline int next_char() {
        ++n_read;
        if (n_read == n_written) { do_read(); }
        return current_char();
    }

    inline int current_char() {
        return (n_read == n_written) ? EOF : buffer[n_read];
    }
};
template<typename T>struct Dirichlet{
   ll N,K,L;
   vector<T> a,A;
   Dirichlet(ll n):N(n),
      K(ceil(cbrt(n*n))),
      L(ceil(cbrt(n))),
      a(K+1),A(L+1){}
   void ident(){
      a.assign(K+1,0);
      A.assign(L+1,0);
   }
   void zeta(){
      a.assign(K+1,1);
      a[0]=0;
      A.assign(L+1,0);
      rep(d,1,L+1)A[d]=N/d;
      return;
   }
   Dirichlet operator*(const Dirichlet& x){
      assert(N==x.N);
      vector<T> ruia(K+1),ruib(K+1);
      rep(i,1,K+1){
         ruia[i]=ruia[i-1]+a[i];
         ruib[i]=ruib[i-1]+x.a[i];
      }
      Dirichlet res(N);
      rep(i,1,K+1){
         rep(j,1,K/i+1){
            res.a[i*j]+=a[i]*x.a[j];
         }
      }
      auto getA=[&](int n){return (n<=K?ruia[n]:A[N/n]);};
      auto getB=[&](int n){return (n<=K?ruib[n]:x.A[N/n]);};
      rep(i,1,L+1){
         int n=N/i,M=floor(sqrt(n));
         rep(j,1,M+1){
            res.A[i]+=a[j]*getB(n/j);
            res.A[i]+=x.a[j]*(getA(n/j)-getA(M));
         }
      }
      return res;
   }
   Dirichlet pow(ll t){
      Dirichlet res(N),b=*this;
      res.ident();
      while(t){
         if(t&1)res=res*b;
         b=b*b;
         t>>=1;
      }
      return res;
   }
};
template <class S, S (*op)(S, S), S (*e)()> class dynamic_segtree {
public:
    dynamic_segtree(size_t n) : n(n), root(nullptr) {}

    void set(size_t p, S x) {
        assert(p < n);
        set(root, 0, n, p, x);
    }

    S get(size_t p) const {
        assert(p < n);
        return get(root, 0, n, p);
    }

    S prod(size_t l, size_t r) const {
        assert(l <= r && r <= n);
        return prod(root, 0, n, l, r);
    }

    S all_prod() const { return root ? root->product : e(); }

private:
    struct node;
    using node_ptr = std::unique_ptr<node>;

    struct node {
        size_t index;
        S value, product;
        node_ptr left, right;

        node(size_t index, S value)
            : index(index),
              value(value),
              product(value),
              left(nullptr),
              right(nullptr) {}

        void update() {
            product = op(op(left ? left->product : e(), value),
                         right ? right->product : e());
        }
    };

    const size_t n;
    node_ptr root;

    void set(node_ptr& t, size_t a, size_t b, size_t p, S x) const {
        if (!t) {
            t = std::make_unique<node>(p, x);
            return;
        }
        if (t->index == p) {
            t->value = x;
            t->update();
            return;
        }
        size_t c = (a + b) >> 1;
        if (p < c) {
            if (t->index < p) std::swap(t->index, p), std::swap(t->value, x);
            set(t->left, a, c, p, x);
        } else {
            if (p < t->index) std::swap(p, t->index), std::swap(x, t->value);
            set(t->right, c, b, p, x);
        }
        t->update();
    }

    S get(const node_ptr& t, size_t a, size_t b, size_t p) const {
        if (!t) return e();
        if (t->index == p) return t->value;
        size_t c = (a + b) >> 1;
        if (p < c) return get(t->left, a, c, p);
        else return get(t->right, c, b, p);
    }

    S prod(const node_ptr& t, size_t a, size_t b, size_t l, size_t r) const {
        if (!t || b <= l || r <= a) return e();
        if (l <= a && b <= r) return t->product;
        size_t c = (a + b) >> 1;
        S result = prod(t->left, a, c, l, r);
        if (l <= t->index && t->index < r) result = op(result, t->value);
        return op(result, prod(t->right, c, b, l, r));
    }
};
using mint = modint998244353;
using S = mint;
S op(S a, S b) { return a + b; }
S e() { return mint(0); }
//Scanner scanner;
//void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;}
int main() {
  gbjsmzmfuuvdf();
  ll n,k;
  cin>>n>>k;
  Dirichlet<mint> a(k);
  a.a[1]=1;
  a.A.assign(a.L+1,1);
  for(int i=1;i<=10;i++){
    Dirichlet<mint> b(k);
    vector<ll> s;
    dynamic_segtree<S, op, e> seg(k+1);
    for(int j=(i-1)*20+1;j<=i*20&&j<=n;j++) s.pb(j);
    ll u=s.size();
    if(u==0) break;
    for(int j=0;j<(1<<u);j++){
      ll t=1;
      for(int p=0;p<u;p++){
        if((j>>p)&1){
          t*=s[p];
          if(t>=k+100){
            break;
          }
        }
      }
      if(t<=k){
        seg.set(t,seg.get(t)+1);
      }
    }
    for(int j=1;j<=b.K;j++){
      b.a[j]=seg.get(j);
    }
    for(int j=1;j<=b.L;j++){
      b.A[j]=seg.prod(0,k/j+1);
    }
    a=a*b;
  }
  cout<<(a.A[1]-1).val()<<endl;
}
0