結果

問題 No.3215 Make K types-able
ユーザー HoyHoyCharhang
提出日時 2025-07-26 03:10:05
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 454 ms / 4,000 ms
コード長 2,968 bytes
コンパイル時間 3,895 ms
コンパイル使用メモリ 281,584 KB
実行使用メモリ 17,240 KB
最終ジャッジ日時 2025-07-26 03:10:17
合計ジャッジ時間 9,607 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

template< int mod >
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    assert(x);
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using mint = ModInt<998244353>;

int main() {
  int n = 200010, k = 9;
  vector<vector<mint>> dp(n+1, vector<mint>(k+1, 0));
  dp[0][0] = dp[0][1] = 1;
  mint p2 = 2;
  mint i4 = mint(4).inverse();
  rep(i,0,n) {
    p2 *= p2;
    dp[i+1][0] = dp[i][0]*dp[i][0] + (p2*p2)*i4;
    // cout << (p2*p2)*i4 << endl;
    rep(j,1,k+1) {
      rep(nj,0,j+1) {
        dp[i+1][j] += dp[i][nj]*dp[i][j-nj];
      }
    }
  }
  // rep(i,0,10) {
  //   rep(j,0,10) {
  //     cout << dp[i][j] << " ";
  //   }
  //   cout << endl;
  // }
  int q;
  cin >> q;
  while(q--) {
    int x, y;
    cin >> x >> y;
    cout << dp[x-1][y-1] << endl;
  }
  return 0;
}
0