C++ 解法, 执行用时: 158ms, 内存消耗: 6264K, 提交时间: 2022-04-16 13:10:38

#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x; i<=y; ++i)

using namespace std;
const int N=100,INF=1000000000;
int n,l,r,a[N],b[N],f[2][N][N][N],tp,ans;

void chkmax(int &x,int y)
{
	if(x<y) x=y;
}

int getint()
{
	char ch;
	while(!isdigit(ch=getchar()));
	int x=ch-48;
	while(isdigit(ch=getchar())) x=x*10+ch-48;
	return x;
}

int main()
{
	n=getint(),l=getint(),r=getint();
	rep(i,1,n) a[i]=getint();
	rep(i,1,n) b[i]=getint();
	sort(a+1,a+1+n);
	rep(i,0,n) rep(j,0,n) rep(k,0,n) f[0][i][j][k]=-INF;
	f[0][0][0][0]=0;
	rep(p,1,n)
	{
		tp^=1;
		rep(i,0,n) rep(j,0,n) rep(k,0,n) f[tp][i][j][k]=-INF;
		rep(i,0,n) rep(j,0,n) rep(k,0,n) if(f[tp^1][i][j][k]>=0)
		{
			int x=f[tp^1][i][j][k];
			chkmax(f[tp][i][j+1][k],x);
			if(k) chkmax(f[tp][i][j][k-1],x);
			rep(len,l,r) if(len&1)
			{
				int y=(len+1)>>1;
				if(y-1>j) break;
				chkmax(f[tp][i+1][j-y+1][k+y-1],x+(a[p]^b[len]));
			}
		}
	}
	ans=-1;
	rep(i,1,n) if(f[tp][i][0][0]>=0) chkmax(ans,f[tp][i][0][0]/i);
	printf("%d\n",ans);
	return 0;
}