結果
| 問題 | No.919 You Are A Project Manager |
| ユーザー |
 Pachicobue
|
| 提出日時 | 2019-10-30 17:53:21 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 7,319 bytes |
| コンパイル時間 | 3,335 ms |
| コンパイル使用メモリ | 203,876 KB |
| 最終ジャッジ日時 | 2025-01-08 02:08:33 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 50 TLE * 5 |
ソースコード
#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>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 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(){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());auto median = [&](const usize l, const usize r) -> ll {ll inf = -1, sup = 2 * MAX + 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;}