Submission #3597330
Source Code Expand
// 基本テンプレート #include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> #include <numeric> #include <fstream> #include <functional> using namespace std; #define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++) #define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++) #define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--) #define debug(...) fprintf(stderr, __VA_ARGS__) #define int long long int template<typename T> void chmax(T &a, T b) {a = max(a, b);} template<typename T> void chmin(T &a, T b) {a = min(a, b);} template<typename T> void chadd(T &a, T b) {a = a + b;} typedef pair<int, int> pii; typedef long long ll; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const ll INF = 1001001001001001LL; const ll MOD = 1000000007LL; int A[100010]; signed main() { int N; cin >> N; for(int i=0; i<N; i++) { cin >> A[i]; } sort(A, A+N, greater<int>()); int ans = 0; if(N % 2 == 0) { for(int i=0; i<N; i++) { if(i < N / 2) { ans += 2 * A[i]; if(i == N/2 - 1) ans -= A[i]; } else { ans -= 2 * A[i]; if(i == N/2) ans += A[i]; } } } else { int tmpA = 0, tmpB = 0; for(int i=0; i<N; i++) { // tmpA: 小さいほうが多い if(i < N / 2) { tmpA += 2 * A[i]; } else { tmpA -= 2 * A[i]; if(i < N / 2 + 2) tmpA += A[i]; } // tmpB: 大きいほうが多い if(i < N / 2 + 1) { tmpB += 2 * A[i]; if(i >= N / 2 - 1) tmpB -= A[i]; } else { tmpB -= 2 * A[i]; } } ans = max(tmpA, tmpB); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Align |
User | tsutaj |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 2273 Byte |
Status | AC |
Exec Time | 49 ms |
Memory | 1024 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 | 46 ms | 1024 KB |
02.txt | AC | 46 ms | 1024 KB |
03.txt | AC | 46 ms | 1024 KB |
04.txt | AC | 46 ms | 1024 KB |
05.txt | AC | 46 ms | 1024 KB |
06.txt | AC | 46 ms | 1024 KB |
07.txt | AC | 46 ms | 1024 KB |
08.txt | AC | 49 ms | 1024 KB |
09.txt | AC | 46 ms | 1024 KB |
10.txt | AC | 46 ms | 1024 KB |
11.txt | AC | 46 ms | 1024 KB |
12.txt | AC | 46 ms | 1024 KB |
13.txt | AC | 46 ms | 1024 KB |
14.txt | AC | 46 ms | 1024 KB |
15.txt | AC | 46 ms | 1024 KB |
16.txt | AC | 46 ms | 1024 KB |
17.txt | AC | 47 ms | 1024 KB |
18.txt | AC | 46 ms | 1024 KB |
19.txt | AC | 46 ms | 1024 KB |
20.txt | AC | 46 ms | 1024 KB |
21.txt | AC | 38 ms | 1024 KB |
22.txt | AC | 38 ms | 1024 KB |
23.txt | AC | 38 ms | 1024 KB |
24.txt | AC | 38 ms | 1024 KB |
25.txt | AC | 19 ms | 1024 KB |
26.txt | AC | 19 ms | 1024 KB |
27.txt | AC | 20 ms | 1024 KB |
28.txt | AC | 20 ms | 1024 KB |
29.txt | AC | 18 ms | 1024 KB |
30.txt | AC | 31 ms | 1024 KB |
31.txt | AC | 31 ms | 1024 KB |
32.txt | AC | 31 ms | 1024 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 |