2019南京网络赛A题 The beautiful values of the palace

对于查询（x1，y1）（x2，y2），只需在x1~ x2的范围内查询y1~ y2的sum。考虑用主席树维护sum，则答案为

query(rt[x1-1],rt[x2],1,n,y1,y2)

计算美丽值先考虑当前坐标（x，y）在从外向内数第几层，再分类讨论（x，y）在当前层数的位置（右、下、左、上）

	位置=min(x,y,n-x+1,n-y+1);
	sum+=(minn-1)*(n-minn+1)*4;
	
	如果在左边 sum+=(n-minn*2+1)*2+y-minn+1;
	如果在下边 sum+=(n-minn*2+1)+n-minn-x+2;
	如果在右边 sum+=n-minn-y+2;
	如果在上边 sum+=(n-minn*2+1)*3+x-minn+1;

sum即为当前土地的价值
AC代码：

#include<bits/stdc++.h>
using namespace std;
#define maxn 2000500
#define INF 100000000
#define ll long long
#define cin(x) scanf("%lld",&x)
#define cout(x) printf("%lld\n",x)
struct nodes1{
	ll l,r,sum;
}tree[maxn];
struct nodes2{
	ll x,y,val;
}a[maxn];
ll T,n,m,p,cnt,rt[maxn],fir[maxn],xa,xb,ya,yb;
ll cal(ll x,ll y)//计算美丽值
{
	ll sum=0,ret=0,minn=min(min(x,y),min(n-x+1,n-y+1));
	sum+=(minn-1)*(n-minn+1)*4;
	if(x==minn) sum+=(n-minn*2+1)*2+y-minn+1;
	else if(y==minn) sum+=(n-minn*2+1)+n-minn-x+2;
	else if(x==n-minn+1) sum+=n-minn-y+2;
	else if(y==n-minn+1) sum+=(n-minn*2+1)*3+x-minn+1;
	while(sum){
		ret+=(sum%10);
		sum/=10;
	}
	return ret;
}
ll build(ll l,ll r){
	ll rt=++cnt;
	tree[rt].sum=0;
	if(l==r){
		return rt;
	}
	ll mid=(l+r)>>1;
	tree[rt].l=build(l,mid);
	tree[rt].r=build(mid+1,r);
	return rt;
}
ll cmp(nodes2 a,nodes2 b){
	return a.x<b.x;
}
ll update(ll lrt,ll l ,ll r ,ll pos ,ll val){
	ll rt=++cnt;
	tree[rt].l=tree[lrt].l;tree[rt].r=tree[lrt].r;tree[rt].sum=tree[lrt].sum+val;
	//printf("%lld %lld+\n",rt,tree[rt].sum);
	if(l==r) return rt;
	ll mid=(l+r)>>1;
	if(pos<=mid) tree[rt].l=update(tree[lrt].l,l,mid,pos,val);
	else tree[rt].r=update(tree[lrt].r,mid+1,r,pos,val);
	return rt;
}
ll query(ll u,ll v,ll l,ll r,ll la,ll ra){
	//printf("%lld %lld +\n",u,v);
	if(l>=la&&r<=ra) return tree[v].sum-tree[u].sum;
	if(l>ra||r<la) return 0;
	ll mid=(l+r)>>1;
	return query(tree[u].l,tree[v].l,l,mid,la,ra)+query(tree[u].r,tree[v].r,mid+1,r,la,ra);
}
int main(){
	cin(T);
	while(T--){
		cin(n),cin(m),cin(p);
		for(int i=1;i<=m;i++){
			cin(a[i].x),cin(a[i].y);
			a[i].val=cal(a[i].x,a[i].y);
		}
		cnt=0;
		rt[0]=build(1,n);
		sort(a+1,a+1+m,cmp);
		for(ll i=1;i<=m;i++){
			ll j=i;
			while(a[j+1].x==a[i].x){
				j++;
			}
			for(ll k=i;k<=j;k++){
				rt[k]=update(rt[k-1],1,n,a[k].y,a[k].val);
				fir[k]=a[i].x;
			}
			i=j;
		}
		fir[m+1]=INF;
		for(ll i=1;i<=p;i++){
			cin(xa),cin(ya),cin(xb),cin(yb);
			ll l=lower_bound(fir+1,fir+1+m,xa)-fir;ll r=upper_bound(fir+1,fir+1+m,xb)-fir-1;
			//找到x>=xa的最小值和x<=xb的最大值
			printf("%lld\n",query(rt[l-1],rt[r],1,n,ya,yb));
		}
	}
	return 0;
}