#pragma GCC optimize ("Ofast") #include using namespace std; void *wmem; char memarr[96000000]; template inline S min_L(S a,T b){ return a<=b?a:b; } template inline void walloc1d(T **arr, int x, void **mem = &wmem){ static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] ); (*arr)=(T*)(*mem); (*mem)=((*arr)+x); } template void sortA_L(int N, T1 a[], void *mem = wmem){ sort(a, a+N); } template void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){ int i; pair *arr; walloc1d(&arr, N, &mem); for(i=(0);i<(N);i++){ arr[i].first = a[i]; arr[i].second = b[i]; } sort(arr, arr+N); for(i=(0);i<(N);i++){ a[i] = arr[i].first; b[i] = arr[i].second; } } template void sortA_L(int N, T1 a[], T2 b[], T3 c[], void *mem = wmem){ int i; pair > *arr; walloc1d(&arr, N, &mem); for(i=(0);i<(N);i++){ arr[i].first = a[i]; arr[i].second.first = b[i]; arr[i].second.second = c[i]; } sort(arr, arr+N); for(i=(0);i<(N);i++){ a[i] = arr[i].first; b[i] = arr[i].second.first; c[i] = arr[i].second.second; } } template void sortA_L(int N, T1 a[], T2 b[], T3 c[], T4 d[], void *mem = wmem){ int i; pair, pair > *arr; walloc1d(&arr, N, &mem); for(i=(0);i<(N);i++){ arr[i].first.first = a[i]; arr[i].first.second = b[i]; arr[i].second.first = c[i]; arr[i].second.second = d[i]; } sort(arr, arr+N); for(i=(0);i<(N);i++){ a[i] = arr[i].first.first; b[i] = arr[i].first.second; c[i] = arr[i].second.first; d[i] = arr[i].second.second; } } inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(int &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } inline void rd(long long &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } inline void wt_L(char a){ my_putchar_unlocked(a); } inline void wt_L(long long x){ int s=0; int m=0; char f[20]; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(const char c[]){ int i=0; for(i=0;c[i]!='\0';i++){ my_putchar_unlocked(c[i]); } } template struct segtree_Point_Minval{ int N; int logN; T *mn; void malloc(int maxN, int once = 0){ int i; for(i=1;i 1){ a /= 2; mn[a] =min_L(mn[2*a], mn[2*a+1]); } } inline void change(int a, T val){ mn[a+N] = val; build(a+N); } inline void add(int a, T val){ mn[a+N] += val; build(a+N); } inline T getMinVal(int a, int b){ T res; T tmp; int fga = 0; int fgb = 0; a += N; b += N; while(a < b){ if(a%2){ if(fga){ res =min_L(res, mn[a]); } else{ res = mn[a]; fga = 1; } a++; } if(b%2){ b--; if(fgb){ tmp =min_L(mn[b], tmp); } else{ tmp = mn[b]; fgb = 1; } } a /= 2; b /= 2; } if(fga==1 && fgb==0){ return res; } if(fga==0 && fgb==1){ return tmp; } if(fga==1 && fgb==1){ res =min_L(res, tmp); return res; } return res; } } ; int N; long long A[100000]; long long B[100000]; long long C[100000]; int ind[100000]; int nx[100000]; int val[100000]; int nxind[100000]; long long res[100000]; int main(){ int i, loop; wmem = memarr; long long tmp; segtree_Point_Minval t; rd(N); { int Lj4PdHRW; for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){ rd(A[Lj4PdHRW]); rd(B[Lj4PdHRW]); rd(C[Lj4PdHRW]); } } for(i=(0);i<(N);i++){ ind[i] = i; } sortA_L(N,A,B,C,ind); for(i=(0);i<(N);i++){ int xr20shxY; int WYIGIcGE; int t_ynMSdg; xr20shxY = -1; WYIGIcGE = N-1; while(xr20shxY < WYIGIcGE){ if((xr20shxY + WYIGIcGE)%2==0){ t_ynMSdg = (xr20shxY + WYIGIcGE) / 2; } else{ t_ynMSdg = (xr20shxY + WYIGIcGE + 1) / 2; } if(A[t_ynMSdg] <= B[i]-C[i]){ xr20shxY = t_ynMSdg; } else{ WYIGIcGE = t_ynMSdg - 1; } } nx[i] =WYIGIcGE; } for(i=(0);i<(N);i++){ if(nx[i]==i){ nx[i]--; } } for(i=(0);i<(N);i++){ { auto APIVbQlN = (nx[i]); auto YREPHmFM = ( i); val[i] = APIVbQlN; nxind[i] = YREPHmFM; } } sortA_L(N, val, nxind); t.walloc(N,1); for(loop=(0);loop<(4);loop++){ int ZIeRIny5; for(ZIeRIny5=(0);ZIeRIny5<(N);ZIeRIny5++){ auto &i = nxind[ZIeRIny5]; if(nx[i]==-1){ tmp = B[i]; } else if(nx[i] < i){ tmp = B[i] - t.getMinVal(0,nx[i]+1); } else{ tmp = B[i] -min_L(t.getMinVal(0,i), t.getMinVal(i+1,nx[i]+1)); } if(tmp >= 4611686016279904256LL){ tmp = 4611686016279904256LL; } if(res[ind[i]] < tmp){ res[ind[i]] = tmp; t.change(i, -tmp); } } } for(i=(0);i<(N);i++){ if(res[i]==4611686016279904256LL){ wt_L("BAN"); wt_L('\n'); } else{ wt_L(res[i]); wt_L('\n'); } } return 0; } // cLay varsion 20200317-1 // --- original code --- // int N; ll A[1d5], B[1d5], C[1d5]; // int ind[1d5]; // // int nx[1d5], val[1d5], nxind[1d5]; // ll res[1d5]; // // { // ll tmp; // segtree_Point_Minval t; // rd(N,(A,B,C)(N)); // rep(i,N) ind[i] = i; // sortA(N,A,B,C,ind); // // rep(i,N) nx[i] = bsearch_max[int,x,-1,N-1](A[x] <= B[i]-C[i]); // rep(i,N) if(nx[i]==i) nx[i]--; // rep(i,N) (val[i], nxind[i]) = (nx[i], i); // sortA(N, val, nxind); // // t.walloc(N,1); // rep(loop,4) rep[nxind](i,N){ // if(nx[i]==-1){ // tmp = B[i]; // } else if(nx[i] < i){ // tmp = B[i] - t.getMinVal(0,nx[i]+1); // } else { // tmp = B[i] - min(t.getMinVal(0,i), t.getMinVal(i+1,nx[i]+1)); // } // if(tmp >= ll_inf) tmp = ll_inf; // if(res[ind[i]] < tmp){ // // if(loop==3) tmp = ll_inf; // res[ind[i]] = tmp; // t.change(i, -tmp); // } // } // // rep(i,N) wt(if[res[i]==ll_inf, "BAN", res[i]]); // }