#837395 (C++17) No.2206 Popcount Sum 2

提出ソース

結果

問題	No.2206 Popcount Sum 2
ユーザー	bond_cmprog
提出日時	2023-02-03 23:49:24
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	890 ms / 4,000 ms
コード長	11,543 bytes
コンパイル時間	3,218 ms
コンパイル使用メモリ	219,692 KB
実行使用メモリ	13,396 KB
最終ジャッジ日時	2024-07-02 21:49:37
合計ジャッジ時間	14,771 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 6,400 KB
testcase_01	AC	5 ms 6,528 KB
testcase_02	AC	46 ms 7,680 KB
testcase_03	AC	47 ms 7,808 KB
testcase_04	AC	47 ms 7,808 KB
testcase_05	AC	878 ms 13,268 KB
testcase_06	AC	880 ms 13,272 KB
testcase_07	AC	890 ms 13,268 KB
testcase_08	AC	890 ms 13,268 KB
testcase_09	AC	885 ms 13,140 KB
testcase_10	AC	592 ms 13,268 KB
testcase_11	AC	589 ms 13,396 KB
testcase_12	AC	584 ms 13,268 KB
testcase_13	AC	540 ms 13,396 KB
testcase_14	AC	537 ms 13,264 KB
testcase_15	AC	543 ms 13,268 KB
testcase_16	AC	446 ms 13,264 KB
testcase_17	AC	446 ms 13,272 KB
testcase_18	AC	460 ms 13,268 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <stdio.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint = boost::multiprecision::cpp_int;
#define ALL(v) (v).begin(), (v).end()
#define OVERLOAD4(_1, _2, _3, _4, name, ...) name
#define REP1(n) for (ll i = 0; i < n; i++)
#define REP2(i, n) for (ll i = 0; i < n; i++)
#define REP3(i, a, b) for (ll i = a; i < b; i++)
#define REP4(i, a, b, c) for (ll i = a; i < b; i += c)
#define REP(...) OVERLOAD4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;  // 1e18
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
inline constexpr ll ceil_div(const ll a, const ll b) {
    return (a + b - 1) / b - !!((a + b - 1) % b < 0);
}  // return ceil(a/b)
inline constexpr ll floor_div(const ll a, const ll b) { return a / b - !!(a % b < 0); }  // return floor(a/b)

/*  ----------------------- DEBUG FUNCTION ---------------------------- */
#define DUMPOUT cerr
void dump_function() { DUMPOUT << ' '; }
void dump_function(bool a) { DUMPOUT << a; }
void dump_function(int a) { DUMPOUT << a; }
void dump_function(long long a) { DUMPOUT << a; }
void dump_function(char a) { DUMPOUT << a; }
void dump_function(string &a) { DUMPOUT << a; }
void dump_function(double a) { DUMPOUT << a; }
template<class T> void dump_function(const vector<T> &);
template<class T, size_t size> void dump_function(const array<T, size> &);
template<class T, class L> void dump_function(const pair<T, L> &p);
template<class T, size_t size> void dump_function(const T (&)[size]);
template<class T> void dump_function(const vector<T> &a) {
    if (a.empty()) return;
    dump_function(a[0]);
    for (auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
    DUMPOUT << endl;
}
template<class T> void dump_function(const deque<T> &a) {
    if (a.empty()) return;
    dump_function(a[0]);
    for (auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template<class T, size_t size> void dump_function(const array<T, size> &a) {
    dump_function(a[0]);
    for (auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template<class T, class L> void dump_function(const pair<T, L> &p) {
    DUMPOUT << '(';
    dump_function(p.first);
    DUMPOUT << ",";
    dump_function(p.second);
    DUMPOUT << ')';
}
template<class T> void dump_function(set<T> &x) {
    for (auto e : x)
        dump_function(e), DUMPOUT << " ";
    DUMPOUT << endl;
}
template<class T> void dump_function(multiset<T> &x) {
    for (auto e : x)
        dump_function(e), DUMPOUT << " ";
    DUMPOUT << endl;
}
template<class T, size_t size> void dump_function(const T (&a)[size]) {
    dump_function(a[0]);
    for (auto i = a; ++i != end(a);) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template<class T> void dump_function(const T &a) { DUMPOUT << a; }
int dump_out() {
    DUMPOUT << '\n';
    return 0;
}
template<class T> int dump_out(const T &t) {
    dump_function(t);
    DUMPOUT << '\n';
    return 0;
}
template<class Head, class... Tail> int dump_out(const Head &head, const Tail &...tail) {
    dump_function(head);
    DUMPOUT << ' ';
    dump_out(tail...);
    return 0;
}

#ifdef DEBUG_
#define dump(x)                                                                                                        \
    DUMPOUT << #x << ": ";                                                                                             \
    dump_function(x);                                                                                                  \
    DUMPOUT << endl;
void dumps() { }
template<class T> void dumps(const T &t) {
    dump_function(t);
    DUMPOUT << " ";
}
template<class Head, class... Tail> void dumps(const Head &head, const Tail &...tail) {
    dump_function(head);
    DUMPOUT << ' ';
    dump_out(tail...);
}
#else
#define dump(x)
template<class... T> void dumps(const T &...) { }
#endif
/*  ----------------------- DEBUG FUNCTION ---------------------------- */

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() const { return MOD; }
    constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
    constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp &operator+=(const Fp &r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp &operator-=(const Fp &r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp &operator*=(const Fp &r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp &operator/=(const Fp &r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator==(const Fp &r) const noexcept { return this->val == r.val; }
    constexpr bool operator!=(const Fp &r) const noexcept { return this->val != r.val; }
    friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0) x.val += MOD;
        return is;
    }
    friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept { return os << x.val; }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &r, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(r, n / 2);
        t = t * t;
        if (n & 1) t = t * r;
        return t;
    }
    friend constexpr Fp<MOD> modinv(const Fp<MOD> &r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Fp<MOD>(u);
    }
};

template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() { }
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { init(n); }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for (int i = 2; i < n; i++) {
            fact_[i] = fact_[i - 1] * i;
            inv_[i] = -inv_[MOD % i] * (MOD / i);
            finv_[i] = finv_[i - 1] * inv_[i];
        }
    }
    constexpr T nCr(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        int MOD = fact_[0].getmod();
        if (n < MOD) return fact_[n] * finv_[k] * finv_[n - k];

        // Lucasの定理
        T ret = 1;
        while (n || k) {
            int _n = n % MOD, _k = k % MOD;
            n /= MOD;
            k /= MOD;
            ret *= nCr(_n, _k);
        }
        return ret;
    }
    constexpr T nPr(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[n - k];
    }
    constexpr T nHr(int n, int k) const noexcept {
        if (n <= 0 || k < 0) return 0;
        return nCr(n + k - 1, k);
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};

/* ----------------------------- MOD ----------------------------------- */
const int MOD = 1000000007;
const int MOD2 = 998244353;
using mint = Fp<MOD2>;
BiCoef<mint> bc;
// using vec = vector<int>;
// using mat = vector<vec>;
/* ----------------------------- MOD ----------------------------------- */

/*  ----------------------- AtCoder Library ---------------------------- */
// #include <atcoder/all>
// using namespace atcoder;
/*  ----------------------- AtCoder Library ---------------------------- */
struct Mo {
    int n;
    vector<pair<int, int>> lr;

    explicit Mo(int n) : n(n) { }

    void add(int l, int r) { /* [l, r) */
        lr.emplace_back(l, r);
    }

    template<typename AL, typename AR, typename EL, typename ER, typename O>
    void build(const AL &add_left, const AR &add_right, const EL &erase_left, const ER &erase_right, const O &out) {
        int q = (int)lr.size();
        int bs = n / min<int>(n, sqrt(q));
        vector<int> ord(q);
        iota(begin(ord), end(ord), 0);
        sort(begin(ord), end(ord), [&](int a, int b) {
            int ablock = lr[a].first / bs, bblock = lr[b].first / bs;
            if (ablock != bblock) return ablock < bblock;
            return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;
        });
        int l = 0, r = 0;
        for (auto idx : ord) {
            while (l > lr[idx].first)
                add_left(--l);
            while (r < lr[idx].second)
                add_right(r++);
            while (l < lr[idx].first)
                erase_left(l++);
            while (r > lr[idx].second)
                erase_right(--r);
            out(idx);
        }
    }

    template<typename A, typename E, typename O> void build(const A &add, const E &erase, const O &out) {
        build(add, add, erase, erase, out);
    }
};

template<typename mint> vector<mint> multipoint_binomial_sum(const vector<pair<int, int>> &qs) {
    int N = 2;
    for (auto &p : qs)
        N = max(N, p.first);
    BiCoef<mint> b(N + 1);
    int Q = qs.size();
    Mo mo(N);
    for (auto &p : qs) {
        assert(p.second <= p.first);
        assert(p.first <= N);
        mo.add(p.second, p.first);
    }
    vector<mint> ans(Q);
    mint cur = 1;
    int n = 0, m = 0;
    auto al = [&](int) { cur -= b.nCr(n, m--); };
    auto ar = [&](int) { cur += cur - b.nCr(n++, m); };
    auto el = [&](int) { cur += b.nCr(n, ++m); };
    auto er = [&](int) { cur = (cur + b.nCr(--n, m)) * b.inv(2); };
    auto q = [&](int i) { ans[i] = cur; };
    mo.build(al, ar, el, er, q);
    return ans;
}

void solve() {
    int T;
    cin >> T;
    vector<pair<int, int>> qs(T);
    REP(i, T) {
        int a, b;
        cin >> a >> b;
        qs[i] = {a - 1, b - 1};
    }
    auto res = multipoint_binomial_sum<mint>(qs);
    vector<mint> two(202020), cum(202020);
    two[0] = 1;
    REP(i, 1, 202020) {
        two[i] = two[i - 1] * 2;
        cum[i] = cum[i - 1] + two[i - 1];
    }
    REP(i, T) { cout << cum[qs[i].first + 1] * res[i] << endl; }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    // int T;
    // cin >> T;
    // REP(t, T) solve();
}

yukicoder

結果

テストケース

ソースコード