# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443554 | valerikk | Santa Claus (RMI19_santa) | C++17 | 251 ms | 13920 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 <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 96068 + 123;
int n;
int x[N], type[N], val[N];
int res[N];
int sum[4 * N], min_sum[4 * N];
int taken[N];
void update(int i) {
sum[i] = sum[2 * i] + sum[2 * i + 1];
min_sum[i] = min(min_sum[2 * i], sum[2 * i] + min_sum[2 * i + 1]);
}
bool check() {
return min_sum[1] >= 0;
}
void add(int i, int l, int r, int pos, int delta) {
if (r - l == 1) {
sum[i] += delta;
min_sum[i] += delta;
} else {
int mid = (l + r) / 2;
if (pos < mid) {
add(2 * i, l, mid, pos, delta);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |