bzoj2738【整体二分】

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
	int x=0;bool f=0;char c=getchar();
	for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
	for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
	return f?-x:x;
}
const int N=510,M=60000+500*500+10;
int n,q,val[N][N],num[M],L,Q=0,ans[M],ss[N][N],tmp[M];
struct na
{
	int k,x,y,x2,y2,id;
}e[M],e1[M],e2[M];

inline int add(int x,int y,int a)
{
	for (int i=x;i<=n;i+=i&-i)
		for (int j=y;j<=n;j+=j&-j) ss[i][j]+=a;
}

inline int cal(int x,int y)
{
	int rec=0;
	for (int i=x;i;i-=i&-i)
		for (int j=y;j;j-=j&-j) rec+=ss[i][j];
	return rec;
}

inline int cal(int x1,int y1,int x2,int y2)
{
	x1--;y1--;
	return cal(x2,y2)-cal(x1,y2)-cal(x2,y1)+cal(x1,y1);
}

inline int find(int x)
{
	if (num[1]==x) return 1;
	if (num[L]==x) return L;
	int l=1,r=L,mid;
	while (l+1<r)
	{
		if (num[mid=l+r>>1]<=x) l=mid;
		else r=mid;
	}
	return l;
}

void solve(int hd,int tl,int l,int r)
{
	if (hd>tl) return;
	if (l==r) 
	{
		for (int i=hd;i<=tl;i++)
			if (e[i].id) ans[e[i].id]=l;
		return;
	}
	int mid=l+r>>1,l1=0,l2=0,lp=hd;
	for (int i=hd;i<=tl;i++)
	{
		if (!e[i].id&&e[i].k<=mid) add(e[i].x,e[i].y,1);
		if (e[i].id) tmp[i]=cal(e[i].x,e[i].y,e[i].x2,e[i].y2);
	}
	for (int i=hd;i<=tl;i++)
		if (!e[i].id&&e[i].k<=mid) add(e[i].x,e[i].y,-1);
	for (int i=hd;i<=tl;i++)
	{
		if (!e[i].id) 
		{
			if (e[i].k<=mid) e1[++l1]=e[i];
			else e2[++l2]=e[i];
		}
		else 
		{
			if (e[i].k<=tmp[i]) e1[++l1]=e[i];
			else e[i].k-=tmp[i],e2[++l2]=e[i];
		}
	}
	for (int i=1;i<=l1;i++) e[lp++]=e1[i];
	for (int i=1;i<=l2;i++) e[lp++]=e2[i];
	solve(hd,hd+l1-1,l,mid);
	solve(hd+l1,tl,mid+1,r);
}

int main()
{
	n=read();q=read();
	for (int i=1,c=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			val[i][j]=num[c++]=read();
	sort(num+1,num+n*n+1);
	L=unique(num+1,num+n*n+1)-num-1;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
		{
			val[i][j]=find(val[i][j]);
			e[++Q]=(na){val[i][j],i,j,0,0,0};
		}
	for (int i=1,x1,x2,y1,y2,k;i<=q;i++)
	{
		x1=read();y1=read();x2=read();y2=read();k=read();
		e[++Q]=(na){k,x1,y1,x2,y2,i};
	}
	solve(1,Q,1,L);
	for (int i=1;i<=q;i++) printf("%d\n",num[ans[i]]);
	return 0;
}