#include<cstdio>
#include<algorithm>
#include<cctype>
#include<cstring>
#define maxn 500005
using namespace std;
int n,q,a[606][606],id,len,cnt_q;
int seq[maxn],b[maxn],ans[maxn],t[605][605],tmp[maxn];
struct node{
int u,d,l,r,idx,num,typ;
}Q[maxn],q1[maxn],q2[maxn];
void upd(int a,int b,int v){
for(int i=a;i<=n;i+=i&-i)
for(int j=b;j<=n;j+=j&-j)
t[i][j]+=v;
}
int qsum(int a,int b){
int res=0;
for(int i=a;i;i-=i&-i)
for(int j=b;j;j-=j&-j)
res+=t[i][j];
return res;
}
void divide(int H,int T,int L,int R){
if(H>T) return;
if(L==R){
for(int i=H;i<=T;i++) if(Q[i].typ==2)ans[Q[i].idx]=L;
return;
}
int mid=(L+R)>>1;
for(int i=H;i<=T;i++){
if(Q[i].typ==1 && Q[i].num<=mid) upd(Q[i].l,Q[i].u,1);
if(Q[i].typ==2) tmp[i]=qsum(Q[i].r,Q[i].d)-qsum(Q[i].l-1,Q[i].d)-qsum(Q[i].r,Q[i].u-1)+qsum(Q[i].l-1,Q[i].u-1);
}
for(int i=H;i<=T;i++)
if(Q[i].typ==1 && Q[i].num<=mid) upd(Q[i].l,Q[i].u,-1);
int l1=0,l2=0;
for(int i=H;i<=T;i++)
if(Q[i].typ==2){
if(tmp[i]>=Q[i].num) q1[l1++]=Q[i];
else Q[i].num-=tmp[i],q2[l2++]=Q[i];
}
else if(Q[i].num<=mid) q1[l1++]=Q[i];
else q2[l2++]=Q[i];
for(int i=0;i<l1;i++) Q[H+i]=q1[i];
for(int i=0;i<l2;i++) Q[H+i+l1]=q2[i];
divide(H,H+l1-1,L,mid);
divide(H+l1,T,mid+1,R);
}
int main(){
int id=0;
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%d",&a[i][j]);
Q[++cnt_q].typ=1;Q[cnt_q].l=i,Q[cnt_q].u=j;Q[cnt_q].num=a[i][j];
b[++len]=a[i][j];
}
for(int i=1;i<=q;i++){
Q[++cnt_q].typ=2;
scanf("%d%d%d%d%d",&Q[cnt_q].l,&Q[cnt_q].u,&Q[cnt_q].r,&Q[cnt_q].d,&Q[cnt_q].num);
Q[cnt_q].idx=++id;
}
sort(b+1,b+1+len);
len=unique(b+1,b+1+len)-b-1;
for(int i=1;i<=cnt_q;i++)
if(Q[i].typ==1)
Q[i].num=lower_bound(b+1,b+1+len,Q[i].num)-b;
divide(1,cnt_q,1,len);
for(int i=1;i<=id;i++)
printf("%d\n",b[ans[i]]);
}
矩阵乘法(梁 盾) 题解 整体二分
最新推荐文章于 2020-03-30 09:16:36 发布