結果
問題 | No.1374 Absolute Game |
ユーザー |
![]() |
提出日時 | 2024-10-19 02:01:13 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 24 ms / 2,000 ms |
コード長 | 1,605 bytes |
コンパイル時間 | 2,515 ms |
コンパイル使用メモリ | 204,356 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-19 02:01:18 |
合計ジャッジ時間 | 4,212 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define N 100005typedef long long ll;typedef unsigned long long ull;ll n, a[N], s[2], ans = LONG_LONG_MIN, s1, s2;int main() {#ifndef ONLINE_JUDGEfreopen("admin.in", "r", stdin);// freopen("admin.out", "w", stdout);#endifscanf("%lld", &n);for (int i = 1; i <= n; i++)scanf("%lld", a + i);sort(a + 1, a + 1 + n);if (n == 1)return printf("%lld", abs(a[1])), 0;int l, r, now;s1 = s2 = LONG_LONG_MAX;if (a[1] < 0) {if (a[2] < 0) {s[0] = s[1] = 0;now = 0;for (int i = 1; i <= n; i++, now ^= 1)s[now] += a[i];s1 = abs(s[0]) - abs(s[1]);}if (a[n] >= 0) {s[0] = s[1] = 0;l = 1, r = n, now = 0;while (l <= r) {if (!(now & 1))s[0] += a[l++];elses[1] += a[r--];now ^= 1;}s2 = abs(s[0]) - abs(s[1]);}}if (s1 == s2 && s1 == LONG_LONG_MAX)s1 = s2 = 0;ans = max(ans, min(s1, s2));s1 = s2 = LONG_LONG_MAX;if (a[n] >= 0) {if (a[1] < 0) {s[0] = s[1] = 0;l = 1, r = n, now = 0;while (l <= r) {if (!(now & 1))s[0] += a[r--];elses[1] += a[l++];now ^= 1;}s1 = abs(s[0]) - abs(s[1]);}if (a[n - 1] >= 0) {s[0] = s[1] = 0;now = 0;for (int i = n; i >= 1; i--, now ^= 1)s[now] += a[i];s2 = abs(s[0]) - abs(s[1]);}}if (s1 == s2 && s1 == LONG_LONG_MAX)s1 = s2 = 0;ans = max(ans, min(s1, s2));printf("%lld", ans);return 0;}