#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 = (lmn < lsm + rmn ? lmn : lsm + rmn);
}
}
pair<long long, long long> query(long long p) {
if (r <= p) return {sm, mn};
long long mid = (l + r) / 2;
if (p > mid) {
pair<int, int> lq = (lc ? lc->query(p) : {0, 0}), rq = (rc ? rc->query(p) : {0, 0});
return {lq.first + rq.first, (lq.second < lq.first + rq.second ? lq.second : lq.first + rq.second)};
}
return (lc ? lc->query(p) : {0, 0});
}
} *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->query(root->sm).first < -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->query(root->sm).first < -1;
}
Compilation message
happiness.cpp:26:5: error: 'pair' does not name a type
26 | pair<long long, long long> query(long long p) {
| ^~~~
happiness.cpp: In function 'bool init(int, long long int, long long int*)':
happiness.cpp:40:15: error: 'struct Node' has no member named 'query'
40 | return root->query(root->sm).first < -1;
| ^~~~~
happiness.cpp: In function 'bool is_happy(int, int, long long int*)':
happiness.cpp:45:18: error: 'struct Node' has no member named 'query'
45 | return root->query(root->sm).first < -1;
| ^~~~~
grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
16 | long long max_code;
| ^~~~~~~~
