记录编号	607749	评测结果	AAAAAAAAAAAAAAAAAAAA
题目名称	3782.[CSP 2022S]策略游戏	最终得分	100
用户昵称	李金泽	是否通过	通过
代码语言	C++	运行时间	1.469 s
提交时间	2025-10-20 09:09:06	内存使用	10.18 MiB

#include<cstdio>
#define N 200005
#define int long long 
#define ls(x) x<<1
#define rs(x) x<<1|1
#define ma(x) t[x].ma
#define mi(x) t[x].mi
#define mz(x) t[x].mz
#define mf(x) t[x].mf
#define z(x) t[x].z
#define f(x) t[x].f
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,q,a[N],x,y;const int inf=1e18;
struct tree{int ma,mi,mz,mf;bool z,f;}t[N<<2];
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
tree pu(const tree &l,const tree &r)
{
	tree x;
	x.ma=max(l.ma,r.ma);
	x.mi=min(l.mi,r.mi);
	x.mz=min(l.mz,r.mz);
	x.mf=max(l.mf,r.mf);
	x.z=l.z|r.z;x.f=l.f|r.f;
	return x;
}
void bd(int l,int r,int x)
{
	if(l==r)
	{
		ma(x)=mi(x)=a[l];
		if(a[l]>=0)z(x)=1,mz(x)=a[l],mf(x)=-inf;
		else f(x)=1,mf(x)=a[l],mz(x)=inf;
		return;
	}
	int mid=l+r>>1;
	bd(l,mid,ls(x));bd(mid+1,r,rs(x));
	t[x]=pu(t[ls(x)],t[rs(x)]);
}
tree qu(int l,int r,int sl,int sr,int x)
{
	if(sl<=l&&r<=sr)return t[x];
	int mid=l+r>>1;
	if(sr<=mid)return qu(l,mid,sl,sr,ls(x));
	if(mid<sl)return qu(mid+1,r,sl,sr,rs(x));
	return pu(qu(l,mid,sl,sr,ls(x)),qu(mid+1,r,sl,sr,rs(x)));
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("csp2022_game.in","r",stdin);freopen("csp2022_game.out","w",stdout);
	n=read();m=read();q=read();
	fo(i,1,n+m)a[i]=read();
	bd(1,n+m,1);
	while(q--)
	{
		tree l,r;int ans=-inf;
		x=read();y=read();l=qu(1,n+m,x,y,1);
		x=read();y=read();r=qu(1,n+m,x+n,y+n,1);
		if(l.z)ans=max(l.ma*r.mi,l.mz*r.mi);
		if(l.f)ans=max(ans,max(l.mi*r.ma,l.mf*r.ma));
		printf("%lld\n",ans);
	}
	return 0;
}