Submission #3590178


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll solve(int N, vi& a) {
    sort(ALL(a));

    int D = N-1;
    vll d(D); rep(i,D) d[i] = a[i+1] - a[i];
    vll e(D);
    for (int i=0,j=D-1,v=2; i<=j; ++i,--j,v+=2){
        e[i] = e[j] = v;
        // last
        if (i==j) e[i]--;
        else if (i+1==j){
            if (d[i] < d[j]) e[i]--;
            else e[j]--;
        }
    }
    ll ans = 0;
    rep(i,D) ans += d[i] * e[i];
    return ans;
}

int main() {
    int N; cin >> N;
    vi a(N); rep(i,N) cin >> a[i];
    cout << solve(N,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Align
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1770 Byte
Status AC
Exec Time 50 ms
Memory 2304 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 40
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 48 ms 2176 KB
02.txt AC 48 ms 2176 KB
03.txt AC 48 ms 2176 KB
04.txt AC 49 ms 2176 KB
05.txt AC 50 ms 2176 KB
06.txt AC 48 ms 2176 KB
07.txt AC 48 ms 2176 KB
08.txt AC 48 ms 2176 KB
09.txt AC 48 ms 2176 KB
10.txt AC 48 ms 2304 KB
11.txt AC 48 ms 2176 KB
12.txt AC 48 ms 2176 KB
13.txt AC 48 ms 2176 KB
14.txt AC 48 ms 2176 KB
15.txt AC 48 ms 2304 KB
16.txt AC 48 ms 2176 KB
17.txt AC 48 ms 2176 KB
18.txt AC 48 ms 2176 KB
19.txt AC 48 ms 2176 KB
20.txt AC 48 ms 2176 KB
21.txt AC 39 ms 2176 KB
22.txt AC 39 ms 2176 KB
23.txt AC 39 ms 2176 KB
24.txt AC 39 ms 2176 KB
25.txt AC 21 ms 2176 KB
26.txt AC 21 ms 2176 KB
27.txt AC 21 ms 2176 KB
28.txt AC 21 ms 2176 KB
29.txt AC 19 ms 2176 KB
30.txt AC 33 ms 2176 KB
31.txt AC 33 ms 2176 KB
32.txt AC 33 ms 2176 KB
33.txt AC 1 ms 256 KB
34.txt AC 1 ms 256 KB
35.txt AC 1 ms 256 KB
36.txt AC 1 ms 256 KB
37.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB