結果

問題 No.972 選び方のスコア
ユーザー akuaakua
提出日時 2022-09-23 19:49:32
言語 C++17
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 118 ms / 2,000 ms
コード長 6,834 Byte
コンパイル時間 3,379 ms
使用メモリ 36,916 KB
最終ジャッジ日時 2022-09-23 19:49:42
合計ジャッジ時間 9,427 ms
ジャッジサーバーID
(参考情報)
judge13 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 118 ms
36,728 KB
testcase_01 AC 104 ms
36,660 KB
testcase_02 AC 101 ms
36,544 KB
testcase_03 AC 68 ms
35,404 KB
testcase_04 AC 106 ms
36,708 KB
testcase_05 AC 108 ms
36,724 KB
testcase_06 AC 105 ms
36,796 KB
testcase_07 AC 85 ms
36,128 KB
testcase_08 AC 88 ms
36,844 KB
testcase_09 AC 86 ms
36,464 KB
testcase_10 AC 88 ms
36,784 KB
testcase_11 AC 89 ms
36,792 KB
testcase_12 AC 95 ms
36,736 KB
testcase_13 AC 102 ms
36,692 KB
testcase_14 AC 90 ms
36,800 KB
testcase_15 AC 89 ms
36,836 KB
testcase_16 AC 89 ms
36,916 KB
testcase_17 AC 88 ms
36,764 KB
testcase_18 AC 33 ms
34,240 KB
testcase_19 AC 101 ms
36,760 KB
testcase_20 AC 101 ms
36,820 KB
testcase_21 AC 101 ms
36,668 KB
testcase_22 AC 101 ms
36,652 KB
testcase_23 AC 101 ms
36,800 KB
testcase_24 AC 100 ms
36,800 KB
testcase_25 AC 38 ms
34,176 KB
testcase_26 AC 39 ms
34,352 KB
testcase_27 AC 34 ms
34,336 KB
testcase_28 AC 33 ms
34,232 KB
testcase_29 AC 33 ms
34,276 KB
testcase_30 AC 32 ms
34,168 KB
testcase_31 AC 33 ms
34,232 KB
testcase_32 AC 32 ms
34,228 KB
testcase_33 AC 33 ms
34,168 KB
testcase_34 AC 33 ms
34,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vpp=vector<vp>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++14 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
 
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};

ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
 struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};
 
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
 
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const ll mod =1e9+7;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(int n, int k) {
    return fact[n]*ifact[n-k];
  }
} c(2000005);
using vm=vector<mint> ;
using vvm=vector<vm> ;
 
 
ll sqrt_(ll x) {
  ll l = 0, r = ll(3e9)+1;
  while (l+1<r) {
    ll c = (l+r)/2;
    if (c*c <= x) l = c; else r = c;
  }
  return l;
}
 
 
int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}
 
 
 
 
ll comb[301][301];
 
void init_comb(int M){
  comb[0][0]=1;
  for(int i=1; i<=300; i++){
    for(int j=0; j<=i; j++){
      if(j==0 || j==i)comb[i][j]=1;
      else comb[i][j]=(comb[i-1][j]+comb[i-1][j-1])%M;
    }
  }
}
 
ll nCk(int n,int k){
  return comb[n][k];
}
 
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost) {}
}; 
 
using ve=vector<edge>;
using vve =vector<ve>;
 
map<ll,ll>d;
void comp(vll&a){
  set<ll>s(a.begin(),a.end());
  int cnt=0;
  for(auto y:s)d[y]=cnt++;
  for(auto&y:a)y=d[y];
}
//snuke
template<typename T>
struct Matrix {
  int h, w;
  vector<vector<T> > d;
  Matrix() {}
  Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {}
  Matrix& unit() {
    //assert(h == w);
    rep(i,h) d[i][i] = 1;
    return *this;
  }
  const vector<T>& operator[](int i) const { return d[i];}
  vector<T>& operator[](int i) { return d[i];}
  Matrix operator*(const Matrix& a) const {
    //assert(w == a.h);
    Matrix r(h, a.w);
    rep(i,h)rep(k,w)rep(j,a.w) {
      r[i][j] += d[i][k]*a[k][j];
    }
    return r;
  }
  Matrix pow(ll t) const {
  //  assert(h == w);
    if (!t) return Matrix(h,h).unit();
    if (t == 1) return *this;
    Matrix r = pow(t>>1);
    r = r*r;
    if (t&1) r = r*(*this);
    return r;
  }
};

int main(){cin.tie(0); ios::sync_with_stdio(false);
  int n; cin >> n;
  vi a(n+1);rep(i,n)cin >> a[i+1];
  sort(a.begin(),a.end());
  vll sum(n+1);repi(i,1,n+1)sum[i]=sum[i-1]+a[i];
  auto f=[&](int k){
    ll base=a[k];
    int ac=n+1,wa=k;
    while(ac-wa>1){
      int wj=(wa+ac)/2;
      int dj=k-1-(n-wj);
      if(dj<=0)wa=wj;
      else if(a[dj]+a[wj]>2*base)ac=wj;
      else wa=wj;
    }
    int aj=k-1-(n-ac);
    ll res=sum[n]-sum[ac-1]+sum[k]-sum[aj-1];
    res-=(1+(n-ac+1)*2)*base;
    return res;
  };
  auto g=[&](int k){
    ll base=a[k]+a[k+1];
    int ac=n+1,wa=k+1;
    while(ac-wa>1){
      int wj=(wa+ac)/2;
      int dj=k-1-(n-wj);
      if(dj<=0)wa=wj;
      else if(a[dj]+a[wj]>base)ac=wj;
      else wa=wj;
    }
    int aj=k-1-(n-ac);
    ll res=sum[n]-sum[ac-1]+sum[k+1]-sum[aj-1];
    res-=(n-ac+1+1)*base;
    return res;
  };
  ll ans=0;
  repi(i,1,n+1)chmax(ans,f(i));
  repi(i,1,n)chmax(ans,g(i));
  cout << ans << endl;
}
  //g++ main.cpp -std=c++14 -I .  


0