結果

問題 No.2812 Plus Minus Blackboard
ユーザー soto800
提出日時 2024-07-19 21:39:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,400 bytes
コンパイル時間 2,036 ms
コンパイル使用メモリ 200,784 KB
最終ジャッジ日時 2025-02-23 16:26:09
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 20 WA * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (lli i = s; i < n; i++)
#define INF (1LL << 62)
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG1(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
#define LOG5(w, x, y, z, a) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
<< TO_STRING(a) << "=" << a << endl;
#define LOG6(w, x, y, z, a, b) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \
<< TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b \
<< endl;
#define overload6(a, b, c, d, e, f, g, ...) g
#define LOG(...) \
overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__)
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;
}
mt19937 engine;
std::chrono::system_clock::time_point start, endTime;
#define DEBUG 0
void solve() {
// write your code here
lli N;
cin >> N;
multiset<lli> basePl;
multiset<lli> baseMi;
REP(i, 0, N) {
lli num;
cin >> num;
if (num > 0) {
basePl.insert(num);
} else if (num < 0) {
baseMi.insert(num);
}
}
{
auto mi = baseMi;
auto pl = basePl;
// plus
while (mi.size() && pl.size()) {
lli nowMi = *mi.begin();
lli nowPl = *pl.begin();
lli nowNum = nowMi + nowPl;
mi.erase(mi.begin());
pl.erase(pl.begin());
if (nowNum > 0) {
pl.insert(nowNum);
} else if (nowNum < 0) {
mi.insert(nowNum);
}
}
if (mi.size() + pl.size() == 1) {
cout << "Yes" << endl;
return;
}
}
{
auto mi = baseMi;
auto pl = basePl;
// plus
while (mi.size() && pl.size()) {
lli nowMi = *mi.rbegin();
lli nowPl = *pl.rbegin();
lli nowNum = nowMi + nowPl;
mi.erase(mi.find(nowMi));
pl.erase(pl.find(nowPl));
if (nowNum > 0) {
pl.insert(nowNum);
} else if (nowNum < 0) {
mi.insert(nowNum);
}
}
if (mi.size() + pl.size() == 1) {
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
return;
}
// Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
// Failed to predict input format
lli N = 1;
// cin >> N;
while (N--)
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0