Submission #3597078
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef vector<int> vi; typedef long long ll; typedef vector<ll> vll; main(){ int n; cin >> n; vll asc(n); for(int i=0;i<n;++i) cin >> asc[i]; sort(asc.begin(),asc.end()); vll ans(n,-1); ans[(n-1)/2] = asc[0]; int l = (n-1)/2 - 1; int r = l+2; bool turn = 1; int posA =1, posD = n-1; for(int i=1;i<n-1;i+=2){ if(turn){ ans[r] = asc[posD]; ans[l] = asc[posD-1]; posD-=2; }else{ ans[r] = asc[posA]; ans[l] = asc[posA+1]; posA+=2; } r++;l--; turn = !turn; } if(n%2==0){ if(turn) ans[n-1] = asc[posD]; else ans[n-1] = asc[posA]; } ll val1 = 0; for(int i=0;i<n-1;++i){ val1 += abs(ans[i] - ans[i+1]); } sort(asc.begin(),asc.end(),greater<ll>()); ans[(n-1)/2] = asc[0]; l = (n-1)/2 - 1; r = l+2; turn = 1; posA =1, posD = n-1; for(int i=1;i<n-1;i+=2){ if(turn){ ans[r] = asc[posD]; ans[l] = asc[posD-1]; posD-=2; }else{ ans[r] = asc[posA]; ans[l] = asc[posA+1]; posA+=2; } r++;l--; turn = !turn; } if(n%2==0){ if(turn) ans[n-1] = asc[posD]; else ans[n-1] = asc[posA]; } ll val2 = 0; for(int i=0;i<n-1;++i){ val2 += abs(ans[i] - ans[i+1]); } cout << max(val1,val2) << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Align |
User | spassos |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1347 Byte |
Status | AC |
Exec Time | 51 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | 49 ms | 1792 KB |
02.txt | AC | 49 ms | 1792 KB |
03.txt | AC | 49 ms | 1792 KB |
04.txt | AC | 49 ms | 1792 KB |
05.txt | AC | 49 ms | 1792 KB |
06.txt | AC | 49 ms | 1792 KB |
07.txt | AC | 49 ms | 1792 KB |
08.txt | AC | 49 ms | 1792 KB |
09.txt | AC | 49 ms | 1792 KB |
10.txt | AC | 49 ms | 1792 KB |
11.txt | AC | 49 ms | 1792 KB |
12.txt | AC | 49 ms | 1792 KB |
13.txt | AC | 49 ms | 1792 KB |
14.txt | AC | 49 ms | 1792 KB |
15.txt | AC | 49 ms | 1792 KB |
16.txt | AC | 49 ms | 1792 KB |
17.txt | AC | 49 ms | 1792 KB |
18.txt | AC | 49 ms | 1792 KB |
19.txt | AC | 51 ms | 1792 KB |
20.txt | AC | 49 ms | 1792 KB |
21.txt | AC | 40 ms | 1792 KB |
22.txt | AC | 40 ms | 1792 KB |
23.txt | AC | 40 ms | 1792 KB |
24.txt | AC | 40 ms | 1792 KB |
25.txt | AC | 22 ms | 1792 KB |
26.txt | AC | 22 ms | 1792 KB |
27.txt | AC | 22 ms | 1792 KB |
28.txt | AC | 22 ms | 1792 KB |
29.txt | AC | 20 ms | 1792 KB |
30.txt | AC | 34 ms | 1792 KB |
31.txt | AC | 34 ms | 1792 KB |
32.txt | AC | 34 ms | 1792 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 |