P1527 [国家集训队]矩阵乘法 整体二分求二维第k小

#include<bits/stdc++.h>
using namespace std;
const int N = 503;
int c[N][N],n,w;
const int M = 4e5+100;
int ans[M]; 
inline int in(){
	int x=0;char c=0;
	while(c<'0'||c>'9') c=getchar();
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
struct node{
	int x,y,a,b,k,op;
}q[M],lq[M],rq[M];
void add(int x,int y,int val){
	for(int i = x; i <= n; i+=i&-i)
	for(int j = y; j <= n; j+=j&-j){
		c[i][j]+=val;
	}
}
int query(int x,int y){
	int ret = 0;
	for(int i = x; i; i-=i&-i)
	for(int j = y; j; j-=j&-j){
		ret+=c[i][j];
	}
	return ret;
}
void solve(int lval,int rval,int st,int ed){
	if(st>ed) return;
	if(lval==rval){
		for(int i = st; i <= ed; i++)
			if(q[i].op>0) ans[q[i].op]=lval;
		return;
	}
	int mid = lval+rval>>1,lt = 0,rt = 0;
	for(int i = st; i <= ed; i++){
		if(q[i].op==0){
			if(q[i].k<=mid) add(q[i].x,q[i].y,1),lq[++lt]=q[i];
			else rq[++rt]=q[i];
		}else{
			int cnt = query(q[i].a,q[i].b)-query(q[i].x-1,q[i].b)-query(q[i].a,q[i].y-1)+query(q[i].x-1,q[i].y-1);
			if(cnt>=q[i].k) lq[++lt]=q[i];
			else q[i].k-=cnt,rq[++rt]=q[i];
		}
	}
	for(int i = 1; i <= lt; i++) q[st+i-1]=lq[i];
	for(int i = 1; i <= rt; i++) q[st+lt+i-1]=rq[i];
	for(int i = st; i <= st+lt-1; i++)
	if(q[i].op==0&&q[i].k<=mid) add(q[i].x,q[i].y,-1);
	solve(lval,mid,st,st+lt-1);
	solve(mid+1,rval,st+lt,ed);
}
int main(){
	n=in(),w=in();
	int t=0;
	for(int i = 1; i <= n; i++)
	for(int j = 1; j <= n; j++){
		int val;
		val=in();
		q[++t]=(node){i,j,0,0,val,0};
	}
	for(int i = 1; i <= w; i++){
		int x,y,a,b,k;
		x=in(),y=in(),a=in(),b=in(),k=in();
		q[++t]=(node){x,y,a,b,k,i};
	}
	solve(0,1e9,1,t);
	for(int i = 1; i <= w; i++) printf("%d\n",ans[i]); 
	return 0;	
}