#913683 (C++17) No.972 選び方のスコア

• 問題: No.972 選び方のスコア
• ユーザー: kuhaku
• 提出日時: 2023-09-17 17:10:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 6,805 bytes
• コンパイル時間: 3,148 ms
• コンパイル使用メモリ: 223,980 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-04 11:56:03
• 合計ジャッジ時間: 6,101 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	58 ms; 5,368 KB
testcase_01	AC	59 ms; 5,376 KB
testcase_02	AC	59 ms; 5,376 KB
testcase_03	AC	30 ms; 5,376 KB
testcase_04	AC	57 ms; 5,376 KB
testcase_05	AC	57 ms; 5,376 KB
testcase_06	AC	59 ms; 5,376 KB
testcase_07	AC	45 ms; 5,376 KB
testcase_08	AC	55 ms; 5,376 KB
testcase_09	AC	53 ms; 5,376 KB
testcase_10	AC	64 ms; 5,376 KB
testcase_11	AC	64 ms; 5,376 KB
testcase_12	AC	56 ms; 5,376 KB
testcase_13	AC	64 ms; 5,376 KB
testcase_14	AC	57 ms; 5,376 KB
testcase_15	AC	51 ms; 5,376 KB
testcase_16	AC	52 ms; 5,376 KB
testcase_17	AC	52 ms; 5,376 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB

ソースコード

#line 1 "a.cpp"
#define PROBLEM ""
#line 2 "/home/kuhaku/atcoder/github/algo/lib/template/template.hpp"
#pragma GCC target("sse4.2,avx2,bmi2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
template <class T, class U>
bool chmax(T &a, const U &b) {
    return a < (T)b ? a = (T)b, true : false;
}
template <class T, class U>
bool chmin(T &a, const U &b) {
    return (T)b < a ? a = (T)b, true : false;
}
constexpr std::int64_t INF = 1000000000000000003;
constexpr int Inf = 1000000003;
constexpr int MOD = 1000000007;
constexpr int MOD_N = 998244353;
constexpr double EPS = 1e-7;
constexpr double PI = M_PI;
#line 3 "/home/kuhaku/atcoder/github/algo/lib/template/macro.hpp"
#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)
#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)
#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)
#define rep(i, n) FOR (i, 0, n)
#define repn(i, n) FOR (i, 1, n + 1)
#define repr(i, n) FORR (i, n, 0)
#define repnr(i, n) FORR (i, n + 1, 1)
#define all(s) (s).begin(), (s).end()
#line 3 "/home/kuhaku/atcoder/github/algo/lib/template/sonic.hpp"
struct Sonic {
    Sonic() {
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }

    constexpr void operator()() const {}
} sonic;
#line 5 "/home/kuhaku/atcoder/github/algo/lib/template/atcoder.hpp"
using namespace std;
using ll = std::int64_t;
using ld = long double;
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
    return is >> p.first >> p.second;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
    for (T &i : v) is >> i;
    return is;
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
    for (auto it = v.begin(); it != v.end(); ++it) {
        os << (it == v.begin() ? "" : " ") << *it;
    }
    return os;
}
template <class Head, class... Tail>
void co(Head &&head, Tail &&...tail) {
    if constexpr (sizeof...(tail) == 0) std::cout << head << '\n';
    else std::cout << head << ' ', co(std::forward<Tail>(tail)...);
}
template <class Head, class... Tail>
void ce(Head &&head, Tail &&...tail) {
    if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n';
    else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);
}
template <typename T, typename... Args>
auto make_vector(T x, int arg, Args... args) {
    if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);
    else return std::vector(arg, make_vector<T>(x, args...));
}
void setp(int n) {
    std::cout << std::fixed << std::setprecision(n);
}
void Yes(bool is_correct = true) {
    std::cout << (is_correct ? "Yes" : "No") << '\n';
}
void No(bool is_not_correct = true) {
    Yes(!is_not_correct);
}
void YES(bool is_correct = true) {
    std::cout << (is_correct ? "YES" : "NO") << '\n';
}
void NO(bool is_not_correct = true) {
    YES(!is_not_correct);
}
void Takahashi(bool is_correct = true) {
    std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n';
}
void Aoki(bool is_not_correct = true) {
    Takahashi(!is_not_correct);
}
#line 3 "a.cpp"

template <class T>
struct interval_heap {
    constexpr interval_heap() : _size(), data(1) {}

    constexpr int size() const {
        return _size;
    }

    T get_max() const {
        assert(_size);
        return data[1];
    }
    T get_min() const {
        assert(_size);
        return _size == 1 ? data[1] : data[2];
    }

    void push(const T &x) {
        data.emplace_back(x);
        apply();
    }
    void push(T &&x) {
        data.emplace_back(x);
        apply();
    }
    template <typename... Args>
    void emplace(Args &&...args) {
        data.emplace_back(std::forward<Args>(args)...);
        apply();
    }

    void pop_max() {
        assert(_size);
        --_size;
        if (_size < 2) {
            data.pop_back();
        } else {
            swap(data[1], data.back());
            data.pop_back();
            down(1);
        }
    }

    void pop_min() {
        assert(_size);
        --_size;
        if (_size < 2) {
            data.pop_back();
        } else {
            swap(data[2], data.back());
            data.pop_back();
            up(2);
        }
    }

    int _size;
    std::vector<T> data;

  private:
    std::pair<int, int> next(int idx) {
        assert(idx != 2 && _size >= 2);
        if (idx & 1) {
            if (idx * 2 + 1 <= _size) {
                idx = idx * 2 + 1;
                return std::make_pair(idx, idx + 2 <= _size ? idx + 2 : idx);
            }
            ++idx;
            if (idx <= _size)
                return std::make_pair(idx, idx);
        }
        idx = (idx / 2) & ~1;
        return std::make_pair(idx, idx);
    }

    std::pair<int, int> prev(int idx) {
        assert(idx != 1);
        if (~idx & 1) {
            if (idx * 2 - 1 <= _size) {
                idx = idx * 2;
                if (idx + 2 <= _size)
                    return std::make_pair(idx, idx + 2);
                if (idx <= _size)
                    return std::make_pair(idx, idx);
            }
            --idx;
            return std::make_pair(idx, idx);
        }
        idx = (idx / 2 - 1) | 1;
        return std::make_pair(idx, idx);
    }

    int down(int idx) {
        while (idx != 2) {
            auto &&[x, y] = next(idx);
            if (x != y && data[x] < data[y])
                swap(x, y);
            if (data[x] < data[idx])
                break;
            swap(data[x], data[idx]);
            idx = x;
        }
        return idx;
    }

    int up(int idx) {
        while (idx != 1) {
            auto &&[x, y] = prev(idx);
            if (x != y && data[y] < data[x])
                swap(x, y);
            if (data[idx] < data[x])
                break;
            swap(data[idx], data[x]);
            idx = x;
        }
        return idx;
    }

    void apply() {
        ++_size;
        if (_size >= 3) {
            int idx = _size;
            idx = down(idx);
            idx = up(idx);
        } else if (_size == 2 && data[1] < data[2]) {
            swap(data[1], data[2]);
        }
    }
};

int main(void) {
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;

    interval_heap<int> ih;
    rep (i, n) {
        ih.emplace(a[i]);
    }

    int m = ih.get_min();
    ih.pop_min();
    ll ans = 0;
    ll s = m;
    while (ih.size() >= 2) {
        s += ih.get_max();
        s += ih.get_min();
        m = ih.get_min();
        ih.pop_max();
        ih.pop_min();
        chmax(ans, s - (ll)m * (n - ih.size()));
    }
    co(ans);

    return 0;
}