#393263 (C++17) No.919 You Are A Project Manager

提出ソース

結果

問題	No.919 You Are A Project Manager
ユーザー	Pachicobue
提出日時	2019-10-25 22:07:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2,514 ms / 3,000 ms
コード長	11,698 bytes
コンパイル時間	3,003 ms
コンパイル使用メモリ	227,528 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-13 04:00:29
合計ジャッジ時間	42,903 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	266 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	15 ms 6,944 KB
testcase_05	AC	16 ms 6,944 KB
testcase_06	AC	37 ms 6,940 KB
testcase_07	AC	926 ms 6,940 KB
testcase_08	AC	215 ms 6,944 KB
testcase_09	AC	154 ms 6,940 KB
testcase_10	AC	294 ms 6,940 KB
testcase_11	AC	277 ms 6,940 KB
testcase_12	AC	8 ms 6,940 KB
testcase_13	AC	366 ms 6,940 KB
testcase_14	AC	20 ms 6,944 KB
testcase_15	AC	105 ms 6,940 KB
testcase_16	AC	518 ms 6,940 KB
testcase_17	AC	224 ms 6,940 KB
testcase_18	AC	95 ms 6,940 KB
testcase_19	AC	270 ms 6,944 KB
testcase_20	AC	2,285 ms 6,944 KB
testcase_21	AC	268 ms 6,944 KB
testcase_22	AC	1,037 ms 6,944 KB
testcase_23	AC	1,017 ms 6,940 KB
testcase_24	AC	1,083 ms 6,940 KB
testcase_25	AC	1,039 ms 6,940 KB
testcase_26	AC	2,231 ms 6,944 KB
testcase_27	AC	1,966 ms 6,944 KB
testcase_28	AC	2,441 ms 6,940 KB
testcase_29	AC	222 ms 6,940 KB
testcase_30	AC	223 ms 6,940 KB
testcase_31	AC	261 ms 6,940 KB
testcase_32	AC	196 ms 6,944 KB
testcase_33	AC	1,135 ms 6,940 KB
testcase_34	AC	1,138 ms 6,944 KB
testcase_35	AC	2,506 ms 6,944 KB
testcase_36	AC	2,497 ms 6,944 KB
testcase_37	AC	2,514 ms 6,944 KB
testcase_38	AC	2,504 ms 6,944 KB
testcase_39	AC	8 ms 6,940 KB
testcase_40	AC	110 ms 6,944 KB
testcase_41	AC	27 ms 6,944 KB
testcase_42	AC	35 ms 6,940 KB
testcase_43	AC	61 ms 6,940 KB
testcase_44	AC	148 ms 6,944 KB
testcase_45	AC	36 ms 6,944 KB
testcase_46	AC	125 ms 6,940 KB
testcase_47	AC	1,040 ms 6,940 KB
testcase_48	AC	1,027 ms 6,940 KB
testcase_49	AC	1,103 ms 6,940 KB
testcase_50	AC	1,037 ms 6,944 KB
testcase_51	AC	951 ms 6,940 KB
testcase_52	AC	740 ms 6,944 KB
testcase_53	AC	949 ms 6,944 KB
testcase_54	AC	111 ms 6,940 KB
testcase_55	AC	2 ms 6,944 KB
testcase_56	AC	2 ms 6,944 KB
testcase_57	AC	2 ms 6,944 KB

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

ソースコード

raw source code

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

#define NDEBUG
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<u64>(mask) >> ind) & static_cast<u64>(1)); }
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>
std::vector<T> read_vec(const std::size_t size)
{
    std::vector<T> v(size);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
template<typename... Types>
auto read_vals() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#define SHOW(...) static_cast<void>(0)
template<typename T>
std::vector<T> make_v(const std::size_t size, T v) { return std::vector<T>(size, v); }
template<class... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }

template<usize lg>
class wavelet_matrix
{
public:
    using bucket_type                  = u64;
    static constexpr usize bucket_size = sizeof(bucket_type) * 8;
    template<typename InIt>
    wavelet_matrix(const InIt first, const InIt last) : sz{static_cast<usize>(std::distance(first, last))}
    {
        std::vector<bool> b(sz);
        std::vector<bucket_type> v{first, last};
        for (usize d = 0; d < lg; d++) {
            std::vector<bucket_type> z, o;
            for (usize i = 0; i < sz; i++) { b[i] = btest(v[i], lg - d - 1), (b[i] ? o : z).push_back(v[i]); }
            table.push_back(fid{b}), zero.push_back(z.size());
            for (usize i = 0; i < z.size(); i++) { v[i] = z[i]; }
            for (usize i = 0; i < o.size(); i++) { v[z.size() + i] = o[i]; }
        }
    }
    usize less_than(usize l, usize r, const bucket_type v) const
    {
        usize ans = 0;
        for (usize i = 0; i < lg; i++) {
            if (btest(v, lg - i - 1)) {
                ans += table[i].zero(r) - table[i].zero(l), l = zero[i] + table[i].one(l), r = zero[i] + table[i].one(r);
            } else {
                l = table[i].zero(l), r = table[i].zero(r);
            }
        }
        return ans;
    }
    usize range_freq(const usize l, const usize r, const bucket_type vmin, const bucket_type vsup) const { return less_than(l, r, vsup) - less_than(l, r, vmin); }

private:
    class fid
    {
    private:
        const usize sz;
        std::vector<bucket_type> data;
        std::vector<usize> large;

    public:
        fid(const std::vector<bool>& b) : sz(b.size()), data(sz / bucket_size + 2, 0), large(sz / bucket_size + 2, 0)
        {
            for (usize i = 0; i < sz; i++) { data[i / bucket_size] |= (static_cast<bucket_type>(b[i]) << (i % bucket_size)), large[i / bucket_size + 1] += b[i]; }
            for (usize i = 1; i < large.size(); i++) { large[i] += large[i - 1]; }
        }
        bool operator[](const usize n) const { return btest(data[n / bucket_size], n % bucket_size); }
        usize one(const usize n) const { return large[n / bucket_size] + popcount(bcut(data[n / bucket_size], n % bucket_size)); }
        usize zero(const usize n) const { return n - one(n); }
    };
    const usize sz;
    std::vector<usize> zero;
    std::vector<fid> table;
};


template<typename SemiGroup>
class sparse_table
{
public:
    using semigroup_type = SemiGroup;
    using value_type     = typename semigroup_type::value_type;
    template<typename InIt>
    sparse_table(const InIt first, const InIt last) : lg{clog(static_cast<usize>(std::distance(first, last) + 1))}, table(lg, std::vector<value_type>(1 << lg))
    {
        const usize cap = 1 << lg;
        for (usize d = 0, base = 1; d < lg; d++, base <<= 1) {
            std::copy(first, last, table[d].begin());
            for (usize b = 0; b < cap / base; b++) {
                if (b % 2 == 1) {
                    for (usize i = 1; i < base; i++) { table[d][b * base + i] = semigroup_type::merge(table[d][b * base + i - 1], table[d][b * base + i]); }
                } else {
                    for (usize i = 1; i < base; i++) { table[d][(b + 1) * base - i - 1] = semigroup_type::merge(table[d][(b + 1) * base - i - 1], table[d][(b + 1) * base - i]); }
                }
            }
        }
    }
    value_type fold(const usize l, const usize r) const
    {
        assert(l < r);
        if (r - l == 1) { return table[0][l]; }
        const usize d = log2p1(r ^ l) - 1;
        return semigroup_type::merge(table[d][l], table[d][r - 1]);
    }

private:
    const usize lg;
    std::vector<std::vector<value_type>> table;
};
template<typename Value, typename Comp = std::less<Value>, typename B = uint64_t>
class linear_rmq
{
public:
    using value_type                   = Value;
    using comparator_type              = Comp;
    using bucket_type                  = B;
    static constexpr usize bucket_size = sizeof(bucket_type) * 8;
    template<typename InIt>
    linear_rmq(const InIt first, const InIt last) : sz{static_cast<usize>(std::distance(first, last))}, bucket_num{(sz + bucket_size - 1) / bucket_size}, val{first, last}, bucket_val([&]() {
                                                        std::vector<value_type> ans(bucket_num);
                                                        for (usize i = 0; i < sz; i++) { ans[i / bucket_size] = i % bucket_size == 0 ? val[i] : std::min(ans[i / bucket_size], val[i], comparator_type{}); }
                                                        return ans;
                                                    }()),
                                                    masks(sz, 0),
                                                    stable(bucket_val.begin(), bucket_val.end())
    {
        for (usize i = 0; i < bucket_num; i++) {
            std::vector<usize> g(bucket_size, sz);
            std::stack<usize> stack;
            for (usize j = 0; j < bucket_size and i * bucket_size + j < sz; j++) {
                for (; not stack.empty() and not comparator_type{}(val[stack.top()], val[i * bucket_size + j]); stack.pop()) {}
                g[j] = stack.empty() ? sz : stack.top(), stack.push(i * bucket_size + j);
            }
            for (usize j = 0; j < bucket_size and i * bucket_size + j < sz; j++) { masks[i * bucket_size + j] = g[j] == sz ? static_cast<bucket_type>(0) : (masks[g[j]] | static_cast<bucket_type>(1) << (g[j] - i * bucket_size)); }
        }
    }
    value_type fold(const usize l, const usize r) const
    {
        assert(l < r), assert(r <= sz);
        const usize left_bucket = (l + bucket_size - 1) / bucket_size, right_bucket = r / bucket_size;
        if (left_bucket > right_bucket) {
            return internal(l, r);
        } else {
            return left_bucket < right_bucket
                       ? (l < bucket_size * left_bucket
                              ? (bucket_size * right_bucket < r
                                     ? std::min({stable.fold(left_bucket, right_bucket), internal(l, bucket_size * left_bucket), internal(bucket_size * right_bucket, r)}, comparator_type{})
                                     : std::min(stable.fold(left_bucket, right_bucket), internal(l, bucket_size * left_bucket), comparator_type{}))
                              : (bucket_size * right_bucket < r
                                     ? std::min(stable.fold(left_bucket, right_bucket), internal(bucket_size * right_bucket, r), comparator_type{})
                                     : stable.fold(left_bucket, right_bucket)))
                       : (l < bucket_size * left_bucket
                              ? (bucket_size * right_bucket < r
                                     ? std::min(internal(l, bucket_size * left_bucket), internal(bucket_size * right_bucket, r), comparator_type{})
                                     : internal(l, bucket_size * left_bucket))
                              : (bucket_size * right_bucket < r
                                     ? internal(bucket_size * right_bucket, r)
                                     : value_type{}));
        }
    }
    usize size() const { return sz; }

private:
    value_type internal(const usize l, usize r) const
    {
        r--;
        const B w = masks[r] >> (l % bucket_size);
        return w == 0 ? val[r] : val[l + lsbp1(w) - 1];
    }
    const usize sz, bucket_num;
    std::vector<value_type> val, bucket_val;
    std::vector<B> masks;
    struct min
    {
        using value_type = Value;
        static value_type merge(const value_type& a, const value_type& b) { return std::min(a, b, comparator_type{}); }
    };
    sparse_table<min> stable;
};
int main()
{
    const auto n     = read<usize>();
    const auto a     = read_vec<ll>(n);
    auto b           = a;
    constexpr ll MAX = 1000000000;
    for (usize i = 0; i < n; i++) { b[i] += MAX; }
    wavelet_matrix<32> wm(b.begin(), b.end());
    linear_rmq<ll> rmq(b.begin(), b.end());
    linear_rmq<ll, std::greater<ll>> rMq(b.begin(), b.end());
    auto median = [&](const usize l, const usize r) -> ll {
        ll inf = rmq.fold(l, r) - 1, sup = rMq.fold(l, r) + 1;
        while (sup - inf > 1) {
            const ll mid                  = (inf + sup) / 2;
            const usize low               = wm.less_than(l, r, mid);
            (low * 2 < r - l ? inf : sup) = mid;
        }
        return inf - MAX;
    };
    ll ans = 0;
    for (usize k = 1; k <= n; k++) {
        std::vector<ll> left{0}, right{0};
        for (usize l = 0; l + k <= n; l += k) { left.push_back(median(l, l + k) * (ll)k); }
        for (int r = (int)n; r - (int)k >= 0; r -= k) { right.push_back(median(r - k, r) * (ll)k); }
        const usize s = left.size() - 1;
        for (usize i = 1; i <= s; i++) { left[i] += left[i - 1], right[i] += right[i - 1]; }
        for (usize i = 1; i <= s; i++) { chmax(left[i], left[i - 1]), chmax(right[i], right[i - 1]); }
        for (usize i = 0; i <= s; i++) { chmax(ans, left[i] + right[s - i]); }
    }
    std::cout << ans << std::endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード