#397090 (C++17) No.924 紲星

提出ソース

結果

問題	No.924 紲星
ユーザー	Pachicobue
提出日時	2019-11-09 04:44:28
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	9,018 bytes
コンパイル時間	2,743 ms
コンパイル使用メモリ	220,252 KB
実行使用メモリ	187,820 KB
最終ジャッジ日時	2023-10-13 06:41:26
合計ジャッジ時間	17,446 ms
ジャッジサーバーID （参考情報）	judge13 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,352 KB
testcase_01	AC	2 ms 4,352 KB
testcase_02	AC	1 ms 4,352 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-

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

ソースコード

raw source code

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};

template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename... Args>
auto read(const usize size, Args... args)
{
    std::vector<decltype(read<T>(args...))> ans(size);
    for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }
    return ans;
}
template<typename... Types>
auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#    define SHOW(...) static_cast<void>(0)
template<typename T>
T make_v(const T v) { return v; }
template<typename... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }

class segments
{
private:
    using P = std::pair<usize, usize>;
    const usize ceil;
    std::vector<P> rs;
    const usize num;  // 区間0は存在しないので、実際は区間1,2,...,num-1

public:
    segments(const usize sz) : ceil{ceil2(sz)}, rs(ceil << 1, P{0, 0}), num{ceil << 1}
    {
        for (usize sz = 1; sz <= ceil; sz <<= 1) {
            const usize len = ceil / sz;
            for (usize j = sz; j < (sz << 1); j++) { rs[j] = {len * (j - sz), len * (j - sz + 1)}; }
        }
    }
    std::vector<usize> under(usize l, usize r) const
    {
        assert(l < r), assert(r <= ceil);
        std::vector<usize> lind, rind;
        for (l += ceil, r += ceil; l < r; l >>= 1, r >>= 1) {
            if (l & 1) { lind.push_back(l++); }
            if (r & 1) { rind.push_back(--r); }
        }
        for (; not rind.empty(); rind.pop_back()) { lind.push_back(rind.back()); }
        return lind;
    }
    std::vector<usize> over(const usize a) const
    {
        assert(a < ceil);
        std::vector<usize> ans;
        for (usize i = a + ceil; i >= 1; i >>= 1) { ans.push_back(i); }
        std::reverse(ans.begin(), ans.end());
        return ans;
    }
    usize max_index() const { return num; }
    const P& operator[](const usize i) const
    {
        assert(i >= 1), assert(i < 2 * ceil);
        return rs[i];
    }
};

template<usize lg>
class wavelet_matrix
{
public:
    using value_type = u64;
    template<typename InIt>
    wavelet_matrix(const InIt first, const InIt last) : sz{static_cast<usize>(std::distance(first, last))}
    {
        for (usize i = 0; i < lg; i++) { zero[i] = 0, table[i] = fid(sz); }
        std::vector<value_type> v{first, last};
        std::vector<value_type> z(sz), o(sz);
        usize zn = 0, on = 0;
        for (usize d = 0; d < lg; d++) {
            zn = 0, on = 0;
            for (usize i = 0; i < sz; i++) {
                const bool b = btest(v[i], lg - d - 1);
                table[d].set(i, b), (b ? o[on++] : z[zn++]) = v[i];
            }
            table[d].build(), zero[d] = zn, std::swap(v, z);
            for (usize i = 0; i < on; i++) { v[zn + i] = o[i]; }
        }
    }
    usize less_than(usize l, usize r, const value_type v) const
    {
        assert(l <= r);
        usize ans = 0;
        for (usize i = 0; i < lg; i++) {
            const usize zl = table[i].zero(l), zr = table[i].zero(r), z = zero[i];
            if (btest(v, lg - i - 1)) {
                ans += zr - zl, l += z - zl, r += z - zr;
            } else {
                l = zl, r = zr;
            }
        }
        return ans;
    }
    usize range_freq(const usize l, const usize r, const value_type vmin, const value_type vsup) const { return less_than(l, r, vsup) - less_than(l, r, vmin); }
    value_type quantile(usize l, usize r, usize n) const
    {
        assert(l <= r), assert(r - l > n);
        value_type ans = 0;
        for (usize i = 0; i < lg; i++) {
            const usize zl = table[i].zero(l), zr = table[i].zero(r), z = zero[i];
            if (n >= zr - zl) {
                ans += value_type(1) << (lg - i - 1), l += z - zl, r += z - zr, n -= (zr - zl);
            } else {
                l = zl, r = zr;
            }
        }
        return ans;
    }

private:
    static constexpr usize bucket_size = sizeof(value_type) * 8;
    static constexpr usize bslog       = log2p1(bucket_size) - 1;
    static constexpr usize wind(const usize n) { return n >> (bslog); }
    static constexpr usize bind(const usize n) { return bcut(n, bslog); }
    class fid
    {
    private:
        usize sz, bn;
        std::vector<value_type> data;
        std::vector<usize> large;

    public:
        fid() : sz{0} {}
        fid(const usize b) : sz{b}, bn{wind(sz) + 2}, data(bn, 0), large(bn, 0) {}
        void build()
        {
            for (usize i = 1; i < large.size(); i++) { large[i] = large[i - 1] + popcount(data[i - 1]); }
        }
        bool operator[](const usize n) const { return btest(data[wind(n)], bind(n)); }
        void set(const usize n, const bool b) { bset(data[wind(n)], bind(n), b); }
        usize one(const usize n) const { return large[wind(n)] + popcount(bcut(data[wind(n)], bind(n))); }
        usize zero(const usize n) const { return n - one(n); }
    };
    const usize sz;
    std::array<usize, lg> zero;
    std::array<fid, lg> table;
};
int main()
{
    constexpr ll MAX  = 1000000000LL;
    const auto [n, q] = reads<usize, usize>();
    const auto m      = ceil2(n);
    auto a            = read<ll>(n);
    while (a.size() < m) { a.push_back(MAX); }
    auto b = a;
    for (auto& e : b) { e += MAX; }
    wavelet_matrix<30> wm(b.begin(), b.end());
    auto median = [&](const usize l, const usize r) { return wm.quantile(l, r, (r - l) / 2) - MAX; };
    auto sorted = make_v(m * 2, std::vector<ll>{});
    auto sum    = make_v(m * 2, std::vector<ll>{});
    segments s{n};
    for (usize i = 1; i < 2 * m; i++) {
        const auto [l, r] = s[i];
        sorted[i]         = std::vector<ll>(a.begin() + l, a.begin() + r);
        std::sort(sorted[i].begin(), sorted[i].end());
        sum[i].push_back(0LL);
        for (usize j = 0; j < sorted[i].size(); j++) { sum[i].push_back(sum[i].back() + sorted[i][j]); }
        sorted[i].push_back(2 * MAX);
    }
    for (usize i = 0; i < q; i++) {
        const auto l = read<usize>() - 1, r = read<usize>();
        const ll m      = median(l, r);
        const auto inds = s.under(l, r);
        ll ans          = 0;
        for (const usize i : inds) {
            const auto& v  = sorted[i];
            const auto& sm = sum[i];
            const usize l  = std::lower_bound(v.begin(), v.end(), m) - v.begin();
            const usize r  = v.size() - l - 1;
            const ll lsum  = (ll)l * m - sm[l];
            const ll rsum  = (sm.back() - sm[l]) - (ll)r * m;
            ans += (lsum + rsum);
        }
        std::cout << ans << std::endl;
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード