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

点击跳转

可以看成两道题吧

50\%: 二维前缀和+二分

50\%: 主席树同时维护区间大于k的个数、总和,然后二分即可

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define 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 2122219134
    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 int str=1<<20;static char in_buf[str],*in_s,*in_t;bool __=0;il char gc(){return (in_s==in_t)&&(in_t=(in_s=in_buf)+fread(in_buf,1,str,stdin)),in_s==in_t?EOF:*in_s++;}il void in(string &ch){ch.clear();if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)__=1;}il void in(char &ch){if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)__=1;else ch=c;}il void in(char *ch){*ch='\0';if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)__=1;*ch='\0';}template<typename T>il void in(T &x){if(__)return;char c=gc();bool f=0;while(c!=EOF&&(c<'0'||c>'9'))f^=(c=='-'),c=gc();if(c==EOF){__=1;return;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=x*10+c-48,c=gc();if(c==EOF)__=1;if(f)x=-x;}template<typename T,typename ... arr>il void in(T &x,arr & ... y){in(x),in(y...);}const char ln='\n';static char out_buf[str],*out_s=out_buf,*out_t=out_buf+str;il void flush(){fwrite(out_buf,1,out_s-out_buf,stdout);out_s=out_buf;}il void pt(char c){(out_s==out_t)?(fwrite(out_s=out_buf,1,str,stdout),*out_s++=c):(*out_s++=c);}il void out(const char* s){while(*s)pt(*s++);}il void out(char* s){while(*s)pt(*s++);}il void out(char c){pt(c);}il void out(string s){for(int i=0;s[i];i++)pt(s[i]);}template<typename T>il void out(T x){if(!x){pt('0');return;}if(x<0)pt('-'),x=-x;char a[50],t=0;while(x)a[t++]=x%10,x/= 10;while(t--)pt(a[t]+'0');}template<typename T,typename ... arr>il void out(T x,arr & ... y){out(x),out(y...);}}using namespace IO;
#define N 500011
int n,a[N];
int R,C,M,p[211][211],w[211][211][1001],W[211][211][1001];
int getw(int x,int y,int X,int Y,int k){
    return w[X][Y][k]-w[x-1][Y][k]-w[X][y-1][k]+w[x-1][y-1][k];
}
int getW(int x,int y,int X,int Y,int k){
    return W[X][Y][k]-W[x-1][Y][k]-W[X][y-1][k]+W[x-1][y-1][k];
}
void sol1(){
    int mx=0;
    Fur(i,1,R)
        Fur(j,1,C)
            in(p[i][j]),
            mx=MAX(mx,p[i][j]);

    Fur(k,0,mx)
        Fur(i,1,R)
            Fur(j,1,C)
                w[i][j][k]=w[i-1][j][k]+w[i][j-1][k]-w[i-1][j-1][k]+(p[i][j]>=k),
                W[i][j][k]=W[i-1][j][k]+W[i][j-1][k]-W[i-1][j-1][k]+(p[i][j]>=k?p[i][j]:0);

    while(M--){
        int x,y,X,Y,h;
        in(x,y,X,Y,h);
        if(getW(x,y,X,Y,0)<h)out("Poor QLW\n");
        else{
            int l=0,r=mx+1,ans=-1;
            while(l+1<r){
                int m=(l+r)>>1;
                if(getW(x,y,X,Y,m)>=h)ans=m,l=m;
                else r=m;
            }
            if(ans==-1)out("Poor QLW\n");
            else out(getw(x,y,X,Y,ans)-(getW(x,y,X,Y,ans)-h)/ans,ln);
        }
    }
}
int rt[N],ls[N*20],rs[N*20],s[N*20],S[N*20],sz=0;
void build(int &x,int l,int r){
    s[x=++sz]=0;
    S[x]=0;
    if(l==r)return;
    int m=(l+r)>>1;
    build(ls[x],l,m);build(rs[x],m+1,r);
}
void ins(int l,int r,int v,int &x,int pre){
    x=++sz;
    s[x]=s[pre]+1;
    S[x]=S[pre]+v;
    ls[x]=ls[pre];
    rs[x]=rs[pre];
    if(l==r)return;
    int m=(l+r)>>1;
    if(v<=m)ins(l,m,v,ls[x],ls[pre]);
    else ins(m+1,r,v,rs[x],rs[pre]);
}
int ask(int l,int r,int tt,int x,int y){
    int ans=0;
    while(l<r){
        int m=(l+r)>>1;
        int sum=S[rs[y]]-S[rs[x]];
        if(sum<tt)ans+=s[rs[y]]-s[rs[x]],tt-=sum,r=m,x=ls[x],y=ls[y];
        else l=m+1,x=rs[x],y=rs[y];
    }
    ans+=(tt+l-1)/l;
    return ans;
}
void sol2(){
    n=C;
    build(rt[0],1,1000);
    Fur(i,1,n)in(a[i]),ins(1,1000,a[i],rt[i],rt[i-1]);
    int l,r,h;
    while(M--){
        in(l,l,r,r,h);
        if(S[rt[r]]-S[rt[l-1]]<h)out("Poor QLW\n");
        else out(ask(1,1000,h,rt[l-1],rt[r]),ln);
    }
}
int main(){
    in(R,C,M);
    if(R!=1)sol1();
    else sol2();
    flush();
}
LG 2468 [SDOI2010]粟粟的书架
comment评论
Search
search