結果

問題 No.972 選び方のスコア
ユーザー 👑 hitonanodehitonanode
提出日時 2020-01-17 21:59:41
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 4,033 bytes
コンパイル時間 1,602 ms
コンパイル使用メモリ 171,516 KB
実行使用メモリ 6,280 KB
最終ジャッジ日時 2023-09-08 02:51:12
合計ジャッジ時間 4,655 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
6,188 KB
testcase_01 AC 59 ms
6,172 KB
testcase_02 AC 55 ms
5,912 KB
testcase_03 AC 28 ms
4,592 KB
testcase_04 AC 57 ms
6,224 KB
testcase_05 AC 56 ms
6,188 KB
testcase_06 AC 58 ms
6,280 KB
testcase_07 AC 43 ms
5,452 KB
testcase_08 AC 43 ms
6,168 KB
testcase_09 AC 42 ms
5,960 KB
testcase_10 AC 44 ms
6,232 KB
testcase_11 AC 45 ms
6,112 KB
testcase_12 AC 44 ms
6,228 KB
testcase_13 AC 46 ms
6,084 KB
testcase_14 AC 45 ms
6,172 KB
testcase_15 AC 47 ms
6,232 KB
testcase_16 AC 47 ms
6,152 KB
testcase_17 AC 47 ms
6,244 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 53 ms
6,232 KB
testcase_20 AC 56 ms
6,236 KB
testcase_21 AC 55 ms
6,112 KB
testcase_22 AC 53 ms
5,880 KB
testcase_23 AC 53 ms
6,108 KB
testcase_24 AC 54 ms
6,172 KB
testcase_25 AC 2 ms
4,376 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 1 ms
4,376 KB
testcase_29 AC 1 ms
4,380 KB
testcase_30 AC 2 ms
4,376 KB
testcase_31 AC 1 ms
4,376 KB
testcase_32 AC 2 ms
4,380 KB
testcase_33 AC 1 ms
4,380 KB
testcase_34 AC 1 ms
4,380 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>;
*/



int main()
{
    int N;
    cin >> N;
    vector<lint> A(N);
    cin >> A;
    sort(ALL(A));
    vector<lint> B(N + 1);
    REP(i, N) B[i + 1] = B[i] + A[i];

    lint ret = 0;
    REP(i, N) {
        int l = 0, r = i + 1;
        while (r - l > 1) {
            lint c = (l + r) / 2;
            lint b1 = A[i] - A[i - c];
            lint b2 = A[N - c] - A[i];
            if (b1 < b2) l = c;
            else r = c;
        }
        mmax(ret, B[i] - B[i - l] + B[N] - B[N - l] - A[i] * (l * 2));
    }
    cout << ret << endl;
}
0