# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917892 | vjudge1 | Happiness (Balkan15_HAPPINESS) | C++17 | 2041 ms | 88040 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 ll long long
#define N T[i]
struct node {
ll mx, lz;
int lc, rc;
} T[3<<23];
map<ll, int> mp;
int rt, cnt;
int nn() {
T[++cnt]={0,0,0,0};
return cnt;
}
void pd(int i) {
if(N.lz) {
N.mx+=N.lz;
if(!N.lc)
N.lc=nn();
if(!N.rc)
N.rc=nn();
T[N.lc].lz+=N.lz;
T[N.rc].lz+=N.lz;
}
N.lz=0;
}
void upd(int &i,ll v,ll tl,ll tr=1e12,ll l=1,ll r=1e12) {
if(!i) i=nn();
else pd(i);
if(tl>r||tr<l)
return;
if(tl<=l&&r<=tr) {
N.lz+=v;
pd(i);
return;
}
if(tl<=l+r>>1||N.lc)
upd(N.lc,v,tl,tr,l,l+r>>1ll);
if(tr>l+r>>1||N.rc)
upd(N.rc,v,tl,tr,l+r+2>>1,r);
N.mx=max(T[N.lc].mx,T[N.rc].mx);
}
void add(ll val) {
upd(rt,-val,val+1);
if(!mp[val])
upd(rt,val,val,val);
mp[val]++;
}
void del(ll val) {
upd(rt,val,val+1);
mp[val]--;
if(!mp[val])
upd(rt,-val,val,val);
}
bool init(int coinsCount, ll maxCoinSize, ll coins[]) {
for(int i=0;i<coinsCount;i++)
add(coins[i]);
return T[rt].mx<2;
}
bool is_happy(int event, int coinsCount, ll coins[]) {
for(int i=0;i<coinsCount;i++)
(event+1?add:del)(coins[i]);
return T[rt].mx<2;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |