#1197570 (C++23) No.2206 Popcount Sum 2

• 問題: No.2206 Popcount Sum 2
• ユーザー: ooaiu
• 提出日時: 2026-11-07 11:47:37
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 705 ms / 4,000 ms
• コード長: 6,048 bytes
• コンパイル時間: 2,554 ms
• コンパイル使用メモリ: 353,160 KB
• 実行使用メモリ: 10,012 KB
• 最終ジャッジ日時: 2026-11-07 11:48:00
• 合計ジャッジ時間: 22,446 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge4_0

ファイルパターン	結果
sample	AC * 1
other	AC * 18

ソースコード

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

template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};

using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;

using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T, class U = std::less<T>> using prique = priority_queue<T, vector<T>, U>;

#define overload(a, b, c, d, e, ...) e
#define len(x) (ll)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep1(n) for (ll _ = 0; _ < ll(n); _++)
#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 += ll(c))
#define rep(...) overload(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, n) for (ll i = ll(n) - 1; i >= 0; i--)

template <class T = ll, class U> vector<T> cumsum(const vector<U>& a) { vector<T> res(a.size() + 1); rep(i, a.size()) res[i + 1] = res[i] + a[i]; return res; }
template <class T> void dedup(vector<T>& a) { sort(all(a)), a.erase(unique(all(a)), a.end()); }
template <class T, class S> bool chmax(T& a, const S& b) { return a < static_cast<T>(b) ? a = static_cast<T>(b), 1 : 0; }
template <class T, class S> bool chmin(T& a, const S& b) { return a > static_cast<T>(b) ? a = static_cast<T>(b), 1 : 0; }

namespace cppio {

template <typename T> struct is_tuple_like : false_type {};
template <typename... Ts> struct is_tuple_like<tuple<Ts...>> : true_type {};
template <typename T, typename U> struct is_tuple_like<pair<T, U>> : true_type {};
template <typename T, typename = void> struct is_container : false_type {};
template <typename T> struct is_container<T, void_t<decltype(begin(declval<T&>()))>> : bool_constant<!is_same_v<decay_t<T>, string> && !is_same_v<decay_t<T>, char*> && !is_same_v<decay_t<T>, const char*> && !is_array_v<remove_reference_t<T>>> {};
template <typename T> void _in(T& x) { if constexpr (is_tuple_like<T>::value) apply([](auto&... elems) { (_in(elems), ...); }, x); else if constexpr (is_container<T>::value) { for (auto& e : x) _in(e); } else cin >> x; }
template <typename... Ts> void _in_all(Ts&... args) { (_in(args), ...); }
template <typename T> void _out(const T& x) { bool first = true; if constexpr (is_tuple_like<T>::value) { apply([&](const auto&... elems) { ((cout << (first ? "" : " "), _out(elems), first = false), ...); }, x); } else if constexpr (is_container<T>::value) { for (const auto& e : x) { if (!first) cout << ' '; _out(e), first = false; } } else cout << x; }
template <typename... Ts> void _print(const Ts&... args) { bool first = true; ((cout << (first ? "" : " "), _out(args), first = false), ...); }
template <typename... Ts> void _out_no_el(const Ts&... args) { _print(args...); }
template <typename... Ts> void _out_all(const Ts&... args) { _out_no_el(args...), cout << '\n'; }

}  // namespace cppio

#define IN(...) cppio::_in_all(__VA_ARGS__)
#define OUT(...) cppio::_out_all(__VA_ARGS__)

#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...)  ll __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); IN(name)
#define VV(type, name, h, w)  vector<vector<type>> name(h, vector<type>(w)); IN(name)
#define RETURN(...) do { __VA_ARGS__; return; } while (0)

bool Yes(bool b = true) { return OUT(b ? "Yes" : "No"), b; }
bool No(bool b = true) { return Yes(!b), b; }
bool YES(bool b = true) { return OUT(b ? "YES" : "NO"), b; }
bool NO(bool b = true) { return YES(!b), b; }

#ifdef ONLINE_JUDGE
#define debug(...) (void(0))
#endif

template <class Mint> struct Binom {
   private:
    std::vector<Mint> _fact, _ifac;

   public:
    explicit Binom(size_t N = 0) : _fact(1, 1), _ifac(1, 1) { extend(N); }

    void extend(size_t N) {
        const size_t a = _fact.size();
        if (a > N) return;
        _fact.resize(N + 1);
        for (size_t i = a; i <= N; i++) _fact[i] = _fact[i - 1] * i;
        _ifac.resize(N + 1);
        _ifac[N] = Mint{1} / _fact[N];
        for (size_t i = N; i > a; i--) _ifac[i - 1] = _ifac[i] * i;
    }

    Mint fact(size_t x) {
        extend(x);
        return _fact[x];
    }
    Mint invfact(size_t x) {
        extend(x);
        return _ifac[x];
    }
    Mint perm(size_t N, size_t K) {
        if (N < K) return Mint{0};
        return this->fact(N) * this->invfact(N - K);
    }
    Mint comb(size_t N, size_t K) {
        if (N < K) return Mint{0};
        return this->fact(N) * this->invfact(K) * this->invfact(N - K);
    }
    Mint homo(size_t N, size_t K) {
        if (N == 0) return K == 0 ? Mint{1} : Mint{0};
        return comb(N - 1 + K, K);
    }
};

#include <atcoder/modint>
using mint = atcoder::modint998244353;
Binom<mint> C;
mint S[1001][1001];
mint pw2[2 << 17];
void run_case() {
    INT(N, M);
    mint ans = pw2[N] - 1;
    N--,M--;
    mint bns = S[N / 200][M / 200];
    int n = N / 200 * 200, k = M / 200 * 200;
    while (n < N) {
        bns = 2 * bns - C.comb(n, k);
        n += 1;
    }
    while (k < M) {
        bns += C.comb(n, k + 1);
        k += 1;
    }
    ans *= bns;
    OUT(ans.val());
}
int main() {
    pw2[0] = 1;
    rep(i, 1, 2 << 17) pw2[i] = pw2[i - 1] * 2;
    rep(i, 1001) {
        S[i][0] = 1;
        rep(j, 1, i + 1) {
            S[i][j] = S[i][j - 1];
            int n = 200 * i, k = 200 * (j - 1);
            rep(a, 200) S[i][j] += C.comb(n, k + a + 1);
        }
    }
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int t = 1;
    cin >> t;
    while (t--) run_case();
}