結果
問題 | No.1374 Absolute Game |
ユーザー |
|
提出日時 | 2021-02-05 21:47:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,590 bytes |
コンパイル時間 | 2,481 ms |
コンパイル使用メモリ | 200,908 KB |
最終ジャッジ日時 | 2025-01-18 12:11:39 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 2 |
other | AC * 7 WA * 18 RE * 1 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:51:22: warning: ‘m’ may be used uninitialized [-Wmaybe-uninitialized] 51 | int n = (N+1)/2, m = N-m; | ^ main.cpp:51:22: note: ‘m’ was declared here 51 | int n = (N+1)/2, m = N-m; | ^
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ int N; cin >> N; vector<ll> c(N); rep(i, N) cin >> c[i]; sort(rall(c)); ll A = 0, B = 0; rep(i, N){ if(i&1) B += c[i]; else A += c[i]; } ll P = INF, Q = INF; if(A >= 0 && B >= 0) chmin(P, A-B); if(N%2 == 0) swap(A, B); if(A <= 0 && B <= 0) chmin(Q, B-A); A = 0, B = 0; int n = (N+1)/2, m = N-m; rep(i, n) A += c[i]; rep(i, m) B += c[n+i]; if(A >= 0 && B <= 0) chmin(P, A+B); A = 0, B = 0, reverse(all(c)); rep(i, n) A += c[i]; rep(i, m) B += c[n+i]; if(A <= 0 && B >= 0) chmin(Q, -A-B); cout << max(P, Q) << '\n'; }