Contest Duration: - (local time) (100 minutes) Back to Home

Submission #5169416

Source Code Expand

Copy
```#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
（ ´_ゝ`）　/　 ⌒i
／　　　＼　 　  |　|
/　　 /￣￣￣￣/　　|
＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N, A[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N) cin >> A[i];

int plus = 0, minus = 0, zero = 0;
rep(i, 0, N) {
if (0 < A[i]) plus++;
else if (A[i] < 0) minus++;
else zero++;
}

ll ans = 0;
if (minus % 2 == 0) {
rep(i, 0, N) ans += abs(A[i]);
}
else if (0 < zero) {
rep(i, 0, N) ans += abs(A[i]);
}
else {
int mi = inf;
rep(i, 0, N) chmin(mi, abs(A[i]));
rep(i, 0, N) ans += abs(A[i]);
ans -= mi * 2;
}
cout << ans << endl;
}
```

#### Submission Info

Submission Time 2019-04-28 09:05:51+0900 D - Flipping Signs hamayanhamayan C++14 (GCC 5.4.1) 400 1849 Byte AC 12 ms 640 KB

#### Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
 AC × 23
 AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19, testcase_20
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 8 ms 512 KB
testcase_02 AC 4 ms 384 KB
testcase_03 AC 12 ms 640 KB
testcase_04 AC 5 ms 384 KB
testcase_05 AC 2 ms 256 KB
testcase_06 AC 11 ms 640 KB
testcase_07 AC 8 ms 512 KB
testcase_08 AC 9 ms 512 KB
testcase_09 AC 8 ms 512 KB
testcase_10 AC 12 ms 640 KB
testcase_11 AC 7 ms 512 KB
testcase_12 AC 5 ms 384 KB
testcase_13 AC 12 ms 640 KB
testcase_14 AC 12 ms 640 KB
testcase_15 AC 11 ms 640 KB
testcase_16 AC 12 ms 640 KB
testcase_17 AC 12 ms 640 KB
testcase_18 AC 7 ms 640 KB
testcase_19 AC 1 ms 256 KB
testcase_20 AC 12 ms 640 KB