| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 276374 | sjimed | 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"
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;
struct Node {
ll v, lz;
int l, r;
Node() {
v = 0;
lz = 0;
l = r = 0;
}
};
ll sz = 0;
ll n, m;
map<ll,int> chk;
Node tree[20202020];
void update(int &node, ll &s, ll &e, ll &l, ll &r, ll &x) {
if(r < s || e < l) return;
if(l <= s && e <= r) {
tree[node].v += x;
tree[node].lz += x;
return;
}
if(tree[node].l == 0) {
tree[node].l = sz++;
tree[tree[node].l].v = INF - (s+e)/2;
}
if(tree[node].r == 0) {
tree[node].r = sz++;
tree[tree[node].r].v = INF - e;
}
update(tree[node].l, s, (s+e)/2, l, r, x);
update(tree[node].r, (s+e)/2+1, e, l, r, x);
tree[node].v = min(tree[tree[node].l].v, tree[tree[node].r].v) + tree[node].lz;
}
bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
n = coinsCount;
m = maxCoinSize + 1;
tree[0].v = INF - m;
sz++;
for(int i=0; i<n; i++) {
if(chk.find(coins[i]) == chk.end()) update(0, 0, m, coins[i], coins[i], -INF);
update(0, 0, m, coins[i]+1, m, coins[i]);
chk[coins[i]]++;
}
return tree[0].v >= -1;
}
bool is_happy(int event, int coinsCount, long long coins[]) {
n = coinsCount;
for(int i=0; i<n; i++) {
if(chk.find(coins[i]) != chk.end() && chk[coins[i]] == 1 && event == -1) update(0, 0, m, coins[i], coins[i], INF);
if((chk.find(coins[i]) == chk.end() || chk[coins[i]] == 0) && event == 1) update(0, 0, m, coins[i], coins[i], -INF);
if(event == 1) update(0, 0, m, coins[i]+1, m, coins[i]);
else update(0, 0, m, coins[i]+1, m, -coins[i]);
chk[coins[i]] += event;
}
return tree[0].v >= -1;
}