結果
問題 | No.2206 Popcount Sum 2 |
ユーザー |
👑 ![]() |
提出日時 | 2023-02-03 21:55:20 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,453 ms / 4,000 ms |
コード長 | 2,618 bytes |
コンパイル時間 | 962 ms |
コンパイル使用メモリ | 83,644 KB |
最終ジャッジ日時 | 2025-02-10 09:10:42 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 18 |
ソースコード
#line 1 "Main.cpp"#include <iostream>#include <string>#include <vector>#include <algorithm>#include <atcoder/modint>#line 3 "nachia\\math\\combination.hpp"namespace nachia{template<class Modint>class Comb{private:std::vector<Modint> F;std::vector<Modint> iF;public:void extend(int newN){int prevN = (int)F.size() - 1;if(prevN >= newN) return;F.resize(newN+1);iF.resize(newN+1);for(int i=prevN+1; i<=newN; i++) F[i] = F[i-1] * Modint::raw(i);iF[newN] = F[newN].inv();for(int i=newN; i>prevN; i--) iF[i-1] = iF[i] * Modint::raw(i);}Comb(int n = 1){F.assign(2, Modint(1));iF.assign(2, Modint(1));extend(n);}Modint factorial(int n) const { return F[n]; }Modint invFactorial(int n) const { return iF[n]; }Modint invOf(int n) const { return iF[n] * F[n-1]; }Modint comb(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return F[n] * iF[r] * iF[n-r];}Modint invComb(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return iF[n] * F[r] * F[n-r];}Modint perm(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return F[n] * iF[n-r];}Modint invPerm(int n, int r) const {if(n < 0 || n < r || r < 0) return Modint(0);return iF[n] * F[n-r];}Modint operator()(int n, int r) const { return comb(n,r); }};} // namespace nachia#line 7 "Main.cpp"using namespace std;using i32 = int;using u32 = unsigned int;using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(int i=0; i<(int)(n); i++)const i64 INF = 1001001001001001001;using Modint = atcoder::static_modint<998244353>;int main(){const int D = 512;nachia::Comb<Modint> C(300000);vector<vector<Modint>> X(401);rep(i,X.size()){vector<Modint> tmp;tmp.push_back(i?1:0);for(int j=1; j<=200000; j++) tmp.push_back(tmp.back() + tmp.back() - C(j-1,i*D-1));X[i] = std::move(tmp);}auto eval = [&](int n, int m) -> Modint {int f = m / D;Modint x = X[f][n];for(int k=f*D; k<m; k++) x += C(n,k);return x;};int T; cin >> T;rep(t,T){int N,M; cin >> N >> M;Modint ans = eval(N-1,M) * (Modint(2).pow(N)-1);cout << ans.val() << '\n';}return 0;}struct ios_do_not_sync{ios_do_not_sync(){ios::sync_with_stdio(false);cin.tie(nullptr);}} ios_do_not_sync_instance;