//To be submitted - START
#include "candies.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v);
//Segment tree beats: version 2
//range min-with, range max-with, range add, range sum
struct segtree_beats {
bool cmp(__int128 x, __int128 y) { return x > y; }
int stok;
const __int128 extr = 2e18;
struct node {
__int128 max1, max2, maxc;
__int128 min1, min2, minc;
__int128 lazy, sum;
__int128 l, r;
};
vector<node> a;
void pushtag_max(int idx, __int128 val) {
if(val >= a[idx].max1) return;
a[idx].sum -= (a[idx].max1 - val) * a[idx].maxc;
a[idx].max1 = val;
if(a[idx].l == a[idx].r) {
a[idx].min1 = val;
}
else {
if(a[idx].min1 >= val) {
a[idx].min1 = val;
a[idx].min2 = extr;
a[idx].minc = a[idx].r - a[idx].l + 1;
}
else if(a[idx].min2 > val && a[idx].min2 != extr) {
a[idx].min2 = val;
}
}
}
void pushtag_min(int idx, __int128 val) {
if(val <= a[idx].min1) return;
a[idx].sum += (val - a[idx].min1) * a[idx].minc;
a[idx].min1 = val;
if(a[idx].l == a[idx].r) {
a[idx].max1 = val;
}
else {
if(a[idx].max1 <= val) {
a[idx].max1 = val;
a[idx].max2 = -extr;
a[idx].maxc = a[idx].r - a[idx].l + 1;
}
else if(a[idx].max2 < val && a[idx].max2 != -extr) {
a[idx].max2 = val;
}
}
}
void pushtag_add(int idx, __int128 val) {
a[idx].max1 += val;
if(a[idx].max2 != -extr) a[idx].max2 += val;
a[idx].min1 += val;
if(a[idx].min2 != extr) a[idx].min2 += val;
a[idx].lazy += val;
a[idx].sum += val * (a[idx].r - a[idx].l + 1);
}
void pushdown(int idx) {
pushtag_add(2*idx+1, a[idx].lazy);
pushtag_add(2*idx+2, a[idx].lazy);
a[idx].lazy = 0;
pushtag_max(2*idx+1, a[idx].max1);
pushtag_max(2*idx+2, a[idx].max1);
pushtag_min(2*idx+1, a[idx].min1);
pushtag_min(2*idx+2, a[idx].min1);
}
void pushup(int idx) {
__int128 max1, max2, maxc;
__int128 min1, min2, minc;
__int128 lazy, sum;
__int128 l, r;
a[idx].max1 = max(a[2*idx+1].max1, a[2*idx+2].max1);
a[idx].max2 = (a[2*idx+1].max1 == a[2*idx+2].max1 ?
max(a[2*idx+1].max2, a[2*idx+2].max2) :
(a[2*idx+1].max1 < a[2*idx+2].max1 ?
max(a[2*idx+1].max1, a[2*idx+2].max2) :
max(a[2*idx+1].max2, a[2*idx+2].max1)
));
a[idx].maxc = (a[2*idx+1].max1 == a[2*idx+2].max1 ?
a[2*idx+1].maxc + a[2*idx+2].maxc :
(a[2*idx+1].max1 < a[2*idx+2].max1 ?
a[2*idx+2].maxc :
a[2*idx+1].maxc)
);
a[idx].min1 = min(a[2*idx+1].min1, a[2*idx+2].min1);
a[idx].min2 = (a[2*idx+1].min1 == a[2*idx+2].min1 ?
min(a[2*idx+1].min2, a[2*idx+2].min2) :
(a[2*idx+1].min1 > a[2*idx+2].min1 ?
min(a[2*idx+1].min1, a[2*idx+2].min2) :
min(a[2*idx+1].min2, a[2*idx+2].min1)
));
a[idx].minc = (a[2*idx+1].min1 == a[2*idx+2].min1 ?
a[2*idx+1].minc + a[2*idx+2].minc :
(a[2*idx+1].min1 > a[2*idx+2].min1 ?
a[2*idx+2].minc :
a[2*idx+1].minc)
);
a[idx].sum = a[2*idx+1].sum + a[2*idx+2].sum;
}
void init1(int l, int r, int idx, __int128 val) {
a[idx].l = l, a[idx].r = r;
if(l == r) {
a[idx].max1 = a[idx].min1 = val;
a[idx].max2 = -extr;
a[idx].min2 = extr;
a[idx].maxc = a[idx].minc = 1;
a[idx].lazy = 0;
a[idx].sum = val;
return;
}
int mid = (l+r) >> 1;
init1(l, mid, 2*idx+1, val);
init1(mid+1, r, 2*idx+2, val);
pushup(idx);
}
void u1(int l, int r, int constl, int constr, int idx, __int128 v) {
if(v >= a[idx].max1) return;
if(l<=constl && constr<=r && v>a[idx].max2) {
pushtag_max(idx, v);
return;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) u1(l, r, mid+1, constr, 2*idx+2, v);
else if(constr < l || r < mid+1) u1(l, r, constl, mid, 2*idx+1, v);
else {
u1(l, r, constl, mid, 2*idx+1, v);
u1(l, r, mid+1, constr, 2*idx+2, v);
}
pushup(idx);
}
void u2(int l, int r, int constl, int constr, int idx, __int128 v) {
if(v <= a[idx].min1) return;
if(l<=constl && constr<=r && v<a[idx].min2) {
pushtag_min(idx, v);
return;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) u2(l, r, mid+1, constr, 2*idx+2, v);
else if(constr < l || r < mid+1) u2(l, r, constl, mid, 2*idx+1, v);
else {
u2(l, r, constl, mid, 2*idx+1, v);
u2(l, r, mid+1, constr, 2*idx+2, v);
}
pushup(idx);
}
void u3(int l, int r, int constl, int constr, int idx, __int128 v) {
if(l <= constl && constr <= r) {
pushtag_add(idx, v);
return;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) u3(l, r, mid+1, constr, 2*idx+2, v);
else if(constr < l || r < mid+1) u3(l, r, constl, mid, 2*idx+1, v);
else {
u3(l, r, constl, mid, 2*idx+1, v);
u3(l, r, mid+1, constr, 2*idx+2, v);
}
pushup(idx);
}
__int128 qu(int l, int r, int constl, int constr, int idx) {
if(l <= constl && constr <= r) {
return a[idx].sum;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
else if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
else {
return qu(l, r, constl, mid, 2*idx+1) + qu(l, r, mid+1, constr, 2*idx+2);
}
}
public:
void resize(int k) {
stok = k;
a.resize(4*k + 10);
}
void init(__int128 v) { // Initialize everything to v
init1(0, stok, 0, v);
}
void min_with(int l, int r, __int128 v) {
u1(l, r, 0, stok, 0, v);
}
void max_with(int l, int r, __int128 v) {
u2(l, r, 0, stok, 0, v);
}
void range_add(int l, int r, __int128 v) {
u3(l, r, 0, stok, 0, v);
}
long long query_sum(int l, int r) {
return (long long)qu(l, r, 0, stok, 0);
}
};
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
std::vector<int> r, std::vector<int> v) {
int n = c.size();
std::vector<int> s(n);
int q = l.size();
segtree_beats a;
a.resize(n);
a.init(0);
for(int i=0; i<q; i++) {
a.range_add(l[i], r[i], v[i]);
a.min_with(l[i], r[i], c[0]);
a.max_with(l[i], r[i], 0);
}
for(int i=0; i<n; i++) {
s[i] = a.query_sum(i, i);
}
return s;
}
//To be submitted - END
Compilation message
candies.cpp: In member function 'void segtree_beats::pushup(int)':
candies.cpp:79:18: warning: unused variable 'max1' [-Wunused-variable]
79 | __int128 max1, max2, maxc;
| ^~~~
candies.cpp:79:24: warning: unused variable 'max2' [-Wunused-variable]
79 | __int128 max1, max2, maxc;
| ^~~~
candies.cpp:79:30: warning: unused variable 'maxc' [-Wunused-variable]
79 | __int128 max1, max2, maxc;
| ^~~~
candies.cpp:80:18: warning: unused variable 'min1' [-Wunused-variable]
80 | __int128 min1, min2, minc;
| ^~~~
candies.cpp:80:24: warning: unused variable 'min2' [-Wunused-variable]
80 | __int128 min1, min2, minc;
| ^~~~
candies.cpp:80:30: warning: unused variable 'minc' [-Wunused-variable]
80 | __int128 min1, min2, minc;
| ^~~~
candies.cpp:81:18: warning: unused variable 'lazy' [-Wunused-variable]
81 | __int128 lazy, sum;
| ^~~~
candies.cpp:81:24: warning: unused variable 'sum' [-Wunused-variable]
81 | __int128 lazy, sum;
| ^~~
candies.cpp:82:18: warning: unused variable 'l' [-Wunused-variable]
82 | __int128 l, r;
| ^
candies.cpp:82:21: warning: unused variable 'r' [-Wunused-variable]
82 | __int128 l, r;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1089 ms |
137484 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
844 KB |
Output is correct |
| 2 |
Correct |
246 ms |
9156 KB |
Output is correct |
| 3 |
Correct |
194 ms |
130096 KB |
Output is correct |
| 4 |
Correct |
815 ms |
138532 KB |
Output is correct |
| 5 |
Correct |
957 ms |
138900 KB |
Output is correct |
| 6 |
Correct |
1296 ms |
139196 KB |
Output is correct |
| 7 |
Correct |
1207 ms |
138692 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
296 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
