#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
typedef long long lld;
const lld MINF = -2000000000;
struct intv {
lld x, yl, yr; int sco;
intv(lld x_=0, lld yl_=0, lld yr_=0, int sco_=0){ x=x_, yl=yl_, yr=yr_, sco=sco_; }
bool operator< (const intv& c) const {
if(x == c.x)return sco < c.sco;
return x<c.x;
}
} ba[404000];
struct iix {
int sum, mx;
iix(int sum_=0, int mx_=0) : sum(sum_), mx(mx_) {}
};
struct segtr {
int l, r; lld s, e;
iix key;
segtr(lld s_=0, lld e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
} itr[3000000];
int N, bcn, dap; int icn;
lld L, R;
void add(int it, lld mi, lld mx, int v){
if(mi > mx)return;
lld l = itr[it].s, r = itr[it].e;
lld m = ((l-MINF)+(r-MINF))/2 + MINF;
if(m == r && l < m)m--;
// printf("%lld %lld %lld / %lld %lld\n", l, m, r, mi, mx);
if(l == -1 && r == -1 && mi == 0)exit(0);
if(l == mi && r == mx){
itr[it].key.sum += v;
itr[it].key.mx += v;
return;
}
if(itr[it].l == 0)itr[it].l = icn++, itr[itr[it].l] = segtr(l, m);
if(itr[it].r == 0)itr[it].r = icn++, itr[itr[it].r] = segtr(m+1, r);
if(mx <= m) add(itr[it].l, mi, mx, v);
else if(mi > m) add(itr[it].r, mi, mx, v);
else{
add(itr[it].l, mi, m, v);
add(itr[it].r, m+1, mx, v);
}
itr[it].key.mx = max(itr[itr[it].l].key.mx, itr[itr[it].r].key.mx) + itr[it].key.sum;
}
lld ys[1204040]; int ycn;
int main(){
icn++;
itr[0].s = 0, itr[0].e = 1300000;
scanf("%d %lld %lld", &N, &L, &R); L--;
for(int i=0; i<N; i++){
lld x, y; int s;
scanf("%lld%lld%d", &x, &y, &s);
ba[bcn++] = intv(x-R, y-R, y+R, s);
ba[bcn++] = intv(x-L, y-L, y+L, -s);
ba[bcn++] = intv(x+L+1, y-L, y+L, s);
ba[bcn++] = intv(x+R+1, y-R, y+R, -s);
ys[ycn++] = y-L; ys[ycn++] = y+L;
ys[ycn++] = y-L-1; ys[ycn++] = y+L-1;
ys[ycn++] = y-L+1; ys[ycn++] = y+L+1;
ys[ycn++] = y-R; ys[ycn++] = y+R;
ys[ycn++] = y-R-1; ys[ycn++] = y+R-1;
ys[ycn++] = y-R+1; ys[ycn++] = y+R+1;
}
sort(ba, ba+bcn);
sort(ys, ys+ycn); ycn = unique(ys, ys+ycn) - ys;
for(int i=0; i<bcn; i++){
int yl = lower_bound(ys, ys+ycn, ba[i].yl) - ys;
int yr = lower_bound(ys, ys+ycn, ba[i].yr) - ys;
add(0, yl, yr, ba[i].sco);
int mx = itr[0].key.mx;
if(dap < mx)dap = mx;
}
printf("%d", dap);
return 0;
}
Compilation message
DE.cpp: In constructor 'segtr::segtr(lld, lld)':
DE.cpp:26:45: warning: converting to non-pointer type 'int' from NULL [-Wconversion-null]
segtr(lld s_=0, lld e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
^
DE.cpp:26:53: warning: converting to non-pointer type 'int' from NULL [-Wconversion-null]
segtr(lld s_=0, lld e_=0) : s(s_), e(e_) {l=NULL, r=NULL;}
^
DE.cpp: In function 'int main()':
DE.cpp:61:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %lld %lld", &N, &L, &R); L--;
^
DE.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld%d", &x, &y, &s);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
116900 KB |
Output is correct |
| 2 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 3 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 4 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 5 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 6 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 7 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 8 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 9 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 10 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 11 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 12 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 13 |
Correct |
26 ms |
116900 KB |
Output is correct |
| 14 |
Correct |
26 ms |
116900 KB |
Output is correct |
| 15 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 16 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 17 |
Correct |
29 ms |
116900 KB |
Output is correct |
| 18 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 19 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 20 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 21 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 22 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 23 |
Correct |
33 ms |
116900 KB |
Output is correct |
| 24 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 25 |
Correct |
33 ms |
116900 KB |
Output is correct |
| 26 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 27 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 28 |
Correct |
29 ms |
116900 KB |
Output is correct |
| 29 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 30 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 31 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 32 |
Correct |
3 ms |
116900 KB |
Output is correct |
| 33 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 34 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 35 |
Correct |
16 ms |
116900 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
116900 KB |
Output is correct |
| 2 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 3 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 4 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 5 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 6 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 7 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 8 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 9 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 10 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 11 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 12 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 13 |
Correct |
26 ms |
116900 KB |
Output is correct |
| 14 |
Correct |
26 ms |
116900 KB |
Output is correct |
| 15 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 16 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 17 |
Correct |
29 ms |
116900 KB |
Output is correct |
| 18 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 19 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 20 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 21 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 22 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 23 |
Correct |
33 ms |
116900 KB |
Output is correct |
| 24 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 25 |
Correct |
33 ms |
116900 KB |
Output is correct |
| 26 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 27 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 28 |
Correct |
29 ms |
116900 KB |
Output is correct |
| 29 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 30 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 31 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 32 |
Correct |
3 ms |
116900 KB |
Output is correct |
| 33 |
Correct |
19 ms |
116900 KB |
Output is correct |
| 34 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 35 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 36 |
Correct |
13 ms |
116900 KB |
Output is correct |
| 37 |
Correct |
16 ms |
116900 KB |
Output is correct |
| 38 |
Correct |
9 ms |
116900 KB |
Output is correct |
| 39 |
Correct |
39 ms |
116900 KB |
Output is correct |
| 40 |
Correct |
23 ms |
116900 KB |
Output is correct |
| 41 |
Correct |
46 ms |
116900 KB |
Output is correct |
| 42 |
Correct |
66 ms |
116900 KB |
Output is correct |
| 43 |
Correct |
73 ms |
116900 KB |
Output is correct |
| 44 |
Correct |
103 ms |
116900 KB |
Output is correct |
| 45 |
Correct |
116 ms |
116900 KB |
Output is correct |
| 46 |
Correct |
153 ms |
116900 KB |
Output is correct |
| 47 |
Correct |
203 ms |
116900 KB |
Output is correct |
| 48 |
Correct |
236 ms |
116900 KB |
Output is correct |
| 49 |
Correct |
689 ms |
116900 KB |
Output is correct |
| 50 |
Correct |
823 ms |
116900 KB |
Output is correct |
| 51 |
Execution timed out |
1500 ms |
116900 KB |
Execution timed out |
| 52 |
Halted |
0 ms |
0 KB |
- |
