【2019ICPC南京网络赛】A.The beautiful values of the palace 离线树状数组

A.The beautiful values of the palace

比赛时候的多组输入，忘清空数组了，WA了无数发，赛后清空一发过，现在的心情十分的差。

这题乍一看二维的，不就是个CDQ分治 || 树套树嘛…

但是，再一看，我们可以发现，对坐标的x排序后，就可以用树状数组通过四个前缀和询问答案了。

难点在螺旋矩阵通过坐标算出权值吧…

#include <bits/stdc++.h>
#define sc(n) scanf("%d",&n)
#define pt(n) printf("%d\n",n)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int maxn = 5e6+7;
int n,m,p,cnt=0;
int x[maxn],y[maxn],a[maxn],b[maxn],c[maxn],d[maxn],qy[maxn];
ll sum[maxn],ans[maxn];
struct node
{
	int x,y;
	int id;
	int f;
	ll w;
	bool operator<(const node &rhs)const
	{
		if(x==rhs.x && y==rhs.y) return f<rhs.f;
		if(x==rhs.x) return y<rhs.y;
		return x<rhs.x;
	}
}q[maxn];
void add(int p,ll x)
{
	for(int i=p;i<maxn;i+=(i & -i)) sum[i] += x;
}
ll query(int p)
{
	ll ans = 0;
	for(int i=p;i;i-=(i & -i)) ans += sum[i];
	return ans;
}
void insert(int id,int x,int y,int f,ll w)
{
	q[++cnt].x = x;
	q[cnt].y = y;
	q[cnt].f = f;
	q[cnt].id = id;
	q[cnt].w = w;
	qy[cnt] = y;
}
ll cal(int x,int y)
{
	ll mx=n-1;
	ll num=min(min(n-y,y-1),min(n-x,x-1));
	ll ans=(mx+mx-2LL*(num-1))*num/2*4;
	if(x==(n+1)/2 && y==(n+1)/2) return ans+1;
	else
	{
		ll len=mx-num*2;
		if(y==(n-num))
		{
			ans+=x-num;
		}
		else if(x==(n-num))
		{
			ans+=len;
			ans+=(n-y+1)-num;
		}
		else if(y==(num+1))
		{
			ans+=2*len;
			ans+=(n-x+1)-num;
		}
		else if(x==(num+1))
		{
			ans+=3*len;
			ans+=y-num;
		}
		return ans;
	}
	return 0;
}
ll solve(ll x)
{
	ll ans = 0;
	while(x)
	{
		ans += x%10;
		x /= 10;
	}	
	return ans;
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		memset(q,0,sizeof(q));
		cnt = 0;
		memset(ans,0,sizeof(ans));
		scanf("%d%d%d",&n,&m,&p);
		for(int i=1;i<=m;i++)
		{
			scanf("%d%d",x+i,y+i);
			insert(i,x[i],y[i],0,solve(cal(n-y[i]+1,x[i])));
		}
		for(int i=1;i<=p;i++)
		{
			scanf("%d%d%d%d",a+i,b+i,c+i,d+i);
			int k = p;
			insert(i,c[i],d[i],1,0);
			insert(i+k,a[i]-1,b[i]-1,1,0);
			insert(i+k*2,a[i]-1,d[i],1,0);
			insert(i+k*3,c[i],b[i]-1,1,0);
		}
		sort(q+1,q+1+cnt);
		sort(qy+1,qy+1+cnt);
		for(int i=1;i<=cnt;i++)
		{
			int y = lower_bound(qy+1,qy+1+cnt,q[i].y)-qy;
			if(!q[i].f) add(y,q[i].w);
			else ans[q[i].id] += query(y);
		}
		for(int i=1;i<=p;i++)
		{
			int k = p;
			printf("%lld\n",ans[i]+ans[i+k]-ans[i+k*2]-ans[i+k*3]);
		}
	}
	return 0;
}