# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286878 | dolphingarlic | Happiness (Balkan15_HAPPINESS) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "happiness.h"
struct Node {
long long l, r, sm, mn;
Node *lc, *rc;
Node(long long L, long long R): l(L), r(R), sm(0), mn(R), lc(nullptr), rc(nullptr) {}
void update(long long p, long long v) {
sm += v;
if (l != r) {
long long mid = (l + r) / 2;
if (p > mid) {
if (!rc) rc = new Node(mid + 1, r);
rc->update(p, v);
} else {
if (!lc) lc = new Node(l, mid);
lc->update(p, v);
}
long long lmn = (lc ? lc->mn : mid), rmn = (rc ? rc->mn : r);
long long lsm = (lc ? lc->sm : 0);
mn = min(lmn, lsm + rmn);
}
}
} *root;
bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
root = new Node(1, maxCoinSize);
for (int i = 0; i < coinsCount; i++) root->update(coins[i], coins[i]);
return root->mn < -1;
}
bool is_happy(int event, int coinsCount, long long coins[]) {
for (int i = 0; i < coinsCount; i++) root->update(coins[i], event * coins[i]);
return root->mn < -1;
}