#include "happiness.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// segment tree of a[i] - a[i-1] - a[i-2] - ... - a[1]
// maximum of this must be zero or less
// when adding a[i], update range [a[i], a[i]] with +a[i]
// and updating range [a[i]+1,inf] with -a[i]
// and do the opposite when removing
struct Node;
const int sz = 12'000'000;
int nextfree = 1;
vector<Node> nodes(sz);
struct Node {
ll tag, mx;
int left, right;
Node() : tag(0), mx(0), left(0), right(0) {}
void extend(ll xl, ll xr) {
if (xl != xr && !left) {
left = nextfree++;
right = nextfree++;
}
}
void apply(ll xl, ll xr) {
extend(xl, xr);
if (tag != 0) {
mx += tag;
if (left) nodes[left].tag += tag;
if (right) nodes[right].tag += tag;
tag = 0;
}
}
void update(ll l, ll r, ll xl, ll xr, ll delta) {
if (l > r) return;
if (l == xl && r == xr) {
tag += delta;
} else {
apply(xl, xr);
ll xm = (xl + xr) / 2;
if (l <= xm) {
nodes[left].update(l, min(r, xm), xl, xm, delta);
nodes[left].apply(xl, xm);
}
if (r > xm) {
nodes[right].update(max(l, xm+1), r, xm+1, xr, delta);
nodes[right].apply(xm+1, xr);
}
mx = max(nodes[left].mx, nodes[right].mx);
}
}
} tree;
const ll hi = 1'000'000'000'005LL;
unordered_map<ll,int> cnt;
void add(ll coin) {
cnt[coin] += 1;
if (cnt[coin] == 1) tree.update(coin, coin, 1, hi, +coin);
tree.update(coin+1, hi, 1, hi, -coin);
}
void remove(ll coin) {
cnt[coin] -= 1;
if (cnt[coin] == 0) tree.update(coin, coin, 1, hi, -coin);
tree.update(coin+1, hi, 1, hi, +coin);
}
bool check() {
tree.apply(1, hi);
return tree.mx <= 1;
}
bool init(int coinsCount, ll maxCoinSize, ll coins[]) {
cnt.reserve(700'000);
for (int i=0; i<coinsCount; i++) add(coins[i]);
return check();
}
bool is_happy(int event, int coinsCount, ll coins[]) {
for (int i=0; i<coinsCount; i++)
if (event == 1) add(coins[i]);
else remove(coins[i]);
return check();
}
Compilation message
grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
16 | long long max_code;
| ^~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
287568 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
287568 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
287568 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
287568 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
