#include "happiness.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node
{
int left, right;
int sum, lazy;
int l, r;
int maxi;
node() {
sum=0, left=-1, right=-1, maxi=0;
}
};
node st[1234567*64];
int cnt=1;
void update(int root, int left, int right, int qLeft, int qRight, int nValue)
{
if (left>qRight || right<qLeft) return;
if (left>=qLeft && right<=qRight) {
st[root].sum+=left*nValue;
if (st[root].sum!=0) st[root].maxi=left;
else st[root].maxi=0;
return;
}
int mid=(left+right)/2;
if (st[root].left==-1) {
st[root].left = cnt++;
st[ st[root].left ].l=left, st[ st[root].left ].r=mid;
}
if (st[root].right==-1) {
st[root].right = cnt++;
st[ st[root].right ].l=mid+1, st[ st[root].right ].r=right;
}
if (mid>=qLeft) update(st[root].left, left, mid, qLeft, qRight, nValue);
if (mid+1<=qRight) update(st[root].right, mid+1, right, qLeft, qRight, nValue);
st[root].sum=st[ st[root].left ].sum + st[ st[root].right ].sum;
st[root].maxi=st[ st[root].right ].maxi - st[ st[root].left ].sum;
st[root].maxi=max(st[ st[root].left ].maxi, st[root].maxi);
st[root].maxi=max(st[root].maxi, 0LL);
return;
}
int mx;
bool init(signed n, long long mxx, long long coins[]) {
mx=mxx+100;
st[0].l=1, st[0].r=mx+1;
for (int i=0; i<n; i++) update(0, 1, mx+1, coins[i], coins[i], 1);
return st[0].maxi<=1;
}
bool is_happy(signed event, signed n, long long coins[]) {
for (int i=0; i<n; i++) update(0, 1, mx+1, coins[i], coins[i], event);
return st[0].maxi<=1;
}
Compilation message
grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
16 | long long max_code;
| ^~~~~~~~
/usr/bin/ld: failed to convert GOTPCREL relocation; relink with --no-relax
collect2: error: ld returned 1 exit status
