zcmimi's blog
avatar
zc
2019-12-21 19:47:00
  • 本文总阅读量
查看原题

点击跳转

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define rg register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i=x;i<=y;i++)
    #define Fdr(i,x,y) for(int i=x;i>=y;i--)
    #define fl(i,x) for(int i=head[x],to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) (int(log2(n)))
    #define inf 0x3f3f3f3f
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const char* ln="\n";const int str=1<<20;struct IN{char buf[str],*s,*t;bool _;IN():s(buf),t(buf),_(0){}il char gc(){return s==t&&((t=(s=buf)+fread(buf,1,str,stdin))==s)?EOF:(*s++);}IN&operator>>(char&ch){if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)_=1;else ch=c;return *this;}IN& operator>>(char* ch){clr(ch,0);if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)return _=1,*this;*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)_=1;return *this;}IN& operator>>(string& ch){if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)return _=1,*this;ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)_=1;return *this;}template<typename T>IN&operator>>(T&x){if(_)return *this;char c=gc();bool ff=0;while(c!=EOF&&(c<'0'||c>'9'))ff^=(c=='-'),c=gc();if(c==EOF){_=1;return *this;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=(x<<3)+(x<<1)+c-48,c=gc();if(c==EOF)_=1;if(ff)x=-x;return *this;}}in;struct OUT{char buf[str],*s,*t;OUT():s(buf),t(buf+str){}~OUT(){fwrite(buf,1,s-buf,stdout);}void pt(char c){(s==t)?(fwrite(s=buf,1,str,stdout),*s++=c):(*s++=c);}OUT&operator<<(const char*s){while(*s)pt(*s++);return *this;}OUT&operator<<(char*s){while(*s)pt(*s++);return *this;}OUT&operator<<(string s){for(int i=0;s[i];i++)pt(s[i]);return *this;}template<typename T>OUT&operator<<(T x){if(!x)return pt('0'),*this;if(x<0)pt('-'),x=-x;char a[30],t=0;while(x)a[t++]=x%10,x/=10;while(t--)pt(a[t]+'0');return *this;}}out;}using namespace IO;
#define N 40011
#define int ll
#define ls rt<<1
#define rs rt<<1|1
int n,W,H,s[N<<2],val[N],laz[N<<2];
struct node{
    int p,x,y,v;
}a[N];
struct NODE{
    int x,id,f;
}b[N];
il bool cmp(node x,node y){
    return (x.p==y.p)?(x.v>y.v):(x.p<y.p);
}
il bool cmp2(NODE x,NODE y){
    return x.x<y.x;
}
void pd(int rt){
    if(laz[rt]){
        laz[ls]+=laz[rt];laz[rs]+=laz[rt];
        s[ls]+=laz[rt];s[rs]+=laz[rt];
        laz[rt]=0;
    }
}
void upd(int L,int R,int v,int l,int r,int rt){
    if(L<=l&&r<=R){
        s[rt]+=v;laz[rt]+=v;
        return;
    }
    int m=(l+r)>>1;
    pd(rt);
    if(L<=m)upd(L,R,v,l,m,ls);
    if(R>m)upd(L,R,v,m+1,r,rs);
    s[rt]=MAX(s[ls],s[rs]);
}
signed main(){
int T;in>>T;
while(T--){
    int x,y,v;
    clr(s,0),clr(laz,0);
    clr(a,0);clr(b,0);clr(val,0);
    in>>n>>W>>H;
    Fur(i,1,n){
        in>>x>>y>>v;
        a[i]=node{x,y,y+H-1,v};
        a[i+n]=node{x+W-1,y,y+H-1,-v};
        b[i]=NODE{y,i,0};b[i+n]=NODE{y+H-1,i,1};
    }
    sort(b+1,b+n*2+1,cmp2);
    int d=0;
    Fur(i,1,n*2){
        if(b[i].x!=b[i-1].x)d++;
        val[d]=b[i].x;
        if(b[i].f)a[b[i].id].y=a[b[i].id+n].y=d;
        else a[b[i].id].x=a[b[i].id+n].x=d;
    }
    sort(a+1,a+n*2+1,cmp);
    int ans=0;
    Fur(i,1,n*2){
        upd(a[i].x,a[i].y-1,a[i].v,1,n*2,1);
        ans=MAX(ans,s[1]);
    }
    out<<ans<<ln;
}
}
LG 1502 窗口的星星
comment评论
Search
search