結果

問題 No.919 You Are A Project Manager
ユーザー 👑 hitonanodehitonanode
提出日時 2019-10-25 23:10:40
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 995 ms / 3,000 ms
コード長 6,323 bytes
コンパイル時間 2,739 ms
コンパイル使用メモリ 192,148 KB
実行使用メモリ 6,468 KB
最終ジャッジ日時 2023-09-10 01:18:43
合計ジャッジ時間 27,258 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 834 ms
6,468 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 146 ms
4,380 KB
testcase_05 AC 154 ms
4,384 KB
testcase_06 AC 11 ms
4,380 KB
testcase_07 AC 364 ms
4,872 KB
testcase_08 AC 72 ms
4,380 KB
testcase_09 AC 46 ms
4,384 KB
testcase_10 AC 91 ms
4,380 KB
testcase_11 AC 88 ms
4,384 KB
testcase_12 AC 3 ms
4,384 KB
testcase_13 AC 112 ms
4,380 KB
testcase_14 AC 6 ms
4,384 KB
testcase_15 AC 29 ms
4,384 KB
testcase_16 AC 177 ms
4,384 KB
testcase_17 AC 902 ms
6,204 KB
testcase_18 AC 870 ms
6,188 KB
testcase_19 AC 841 ms
6,372 KB
testcase_20 AC 956 ms
6,140 KB
testcase_21 AC 832 ms
6,368 KB
testcase_22 AC 394 ms
4,948 KB
testcase_23 AC 384 ms
4,648 KB
testcase_24 AC 412 ms
4,560 KB
testcase_25 AC 378 ms
4,656 KB
testcase_26 AC 883 ms
6,196 KB
testcase_27 AC 760 ms
5,444 KB
testcase_28 AC 981 ms
6,332 KB
testcase_29 AC 900 ms
6,188 KB
testcase_30 AC 872 ms
6,272 KB
testcase_31 AC 904 ms
6,208 KB
testcase_32 AC 902 ms
6,360 KB
testcase_33 AC 408 ms
4,560 KB
testcase_34 AC 409 ms
4,760 KB
testcase_35 AC 990 ms
6,184 KB
testcase_36 AC 995 ms
6,424 KB
testcase_37 AC 986 ms
6,232 KB
testcase_38 AC 989 ms
6,316 KB
testcase_39 AC 2 ms
4,384 KB
testcase_40 AC 30 ms
4,384 KB
testcase_41 AC 7 ms
4,380 KB
testcase_42 AC 9 ms
4,384 KB
testcase_43 AC 17 ms
4,384 KB
testcase_44 AC 42 ms
4,380 KB
testcase_45 AC 9 ms
4,380 KB
testcase_46 AC 36 ms
4,384 KB
testcase_47 AC 379 ms
4,652 KB
testcase_48 AC 369 ms
4,588 KB
testcase_49 AC 399 ms
4,556 KB
testcase_50 AC 396 ms
4,640 KB
testcase_51 AC 357 ms
4,532 KB
testcase_52 AC 252 ms
4,380 KB
testcase_53 AC 357 ms
4,600 KB
testcase_54 AC 30 ms
4,384 KB
testcase_55 AC 1 ms
4,384 KB
testcase_56 AC 2 ms
4,384 KB
testcase_57 AC 1 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/
using T = vector<lint>;
struct SegTree
{
    int N;
    int head;
    vector<T> x;
    T defaultT;
    using func = function<T(const T&, const T&)>;
    func merger;
    lint _get(int begin, int end, int pos, int l, int r, lint q) const
    {
        if (r <= begin or l >= end) return 0;
        if (l >= begin and r <= end)
        {
            return upper_bound(ALL(x[pos]), q) - x[pos].begin();
        }
        return _get(begin, end, 2 * pos + 1, l, (l + r) / 2, q) + _get(begin, end, 2 * pos + 2, (l + r) / 2, r, q);
    }
    SegTree(int N, T defaultT, func merger) : N(N), defaultT(defaultT), merger(merger)
    {
        int N_tmp = 1; while (N_tmp < N) N_tmp <<= 1;
        x.assign(N_tmp*2, defaultT), head = N_tmp - 1;
    }
    SegTree(const vector<T> &vals, T defaultT, func merger) : N(vals.size()), defaultT(defaultT), merger(merger)
    {
        int N_tmp = 1; while (N_tmp < N) N_tmp <<= 1;
        x.assign(N_tmp*2, defaultT), head = N_tmp - 1;
        copy(vals.begin(), vals.end(), x.begin() + head);
        IREP(i, head) x[i] = merger(x[i * 2 + 1], x[i * 2 + 2]);
    }
    SegTree() : SegTree(0, T(), [](T, T) { return T(); }) {}
    void build(const vector<T> &vals) { copy(vals.begin(), vals.end(), x.begin() + head); IREP(i, head) x[i] = merger(x[i * 2 + 1], x[i * 2 + 2]); }
    void update(int pos, T val) { pos += head, x[pos] = val; while (pos) pos = (pos - 1) / 2, x[pos] = merger(x[pos*2+1], x[pos*2+2]); }
    lint get(int begin, int end, lint q) const { return _get(begin, end, 0, 0, (int)x.size() / 2, q); }
    // friend ostream &operator<<(ostream &os, const SegTree &s) { os << "["; REP(i, s.N) os << s.get(i, i + 1) << ","; os << "]"; return os; }
    lint median(int l, int r)
    {
        int lo = -1e9 - 100, hi = 1e9 + 100;
        while (hi - lo > 1)
        {
            int c = (lo + hi) / 2;
            lint n = get(l, r, c); // c以下の個数を数える
            if (n + (r - l) / 2 >= r - l) hi = c;
            else lo = c;
        }
        return hi;
    }
};

int N;
vector<vector<lint>> A;
lint ret = 0;

int main()
{
    cin >> N;
    A.resize(N);
    REP(i, N)
    {
        lint a;
        cin >> a;
        A[i] = vector<lint>(1, a);
    }
    SegTree st(A, vector<lint>{}, [](T l, const T &r) {
        l.insert(l.end(), ALL(r));
        sort(ALL(l));
        return l;
    });
    FOR(k, 1, N + 1)
    {
        int nmax = N / k;
        vector<lint> l(nmax + 1), r(nmax + 1);
        REP(i, nmax)
        {
            l[i + 1] = st.median(i * k, (i + 1) * k);
            r[i + 1] = st.median(N - (i + 1) * k, N - i * k);
        }
        REP(i, nmax) l[i + 1] += l[i], r[i + 1] += r[i];
        REP(i, nmax) mmax(l[i + 1], l[i]), mmax(r[i + 1], r[i]);
        REP(i, nmax + 1) mmax(ret, (l[i] + r[nmax - i]) * k);
    }
    cout << ret << endl;
}
0