【bzoj3529】[Sdoi2014]数表

题意：略

考虑没有a限制

然后对于询问按a从小到大排序，f(x)从小到大插入，每次询问分块，查询g(T)的前缀和用树状数组维护，插入f(x)的值时暴力插即可

#include <bits/stdc++.h>
#define gc getchar()
#define N 100009
#define ll long long
#define mod (1ll<<31ll)
using namespace std;
int T,n,m,pri[N],pd[N],cnt,mu[N];
ll ans[N],f[N],id[N],bit[N];
struct qu
{
	int n,m,a,pos;
	bool operator <(const qu &rhs)const
	{
		return a<rhs.a;
	}
}p[N];
int read()
{
	int x=1;
	char ch;
	while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
	int s=ch-48;
	while (ch=gc,ch>='0'&&ch<='9') s=s*10+ch-48;
	return s*x;
}
bool cmp(int x,int y)
{
	return f[x]<f[y];
}
int lowbit(int x)
{
	return x&(-x);
}
ll qry(int x)
{
	ll ans=0;
	for (;x;x-=lowbit(x))
		ans+=bit[x];
	return ans;
}
void ins(int x,int y)
{
	for (;x<N;x+=lowbit(x))
		bit[x]+=y;
}
void updata(int d)
{
	for (int i=1;i*d<N;i++)
		if (mu[i]) ins(i*d,mu[i]*f[d]);
}
int main()
{
	pd[mu[1]=id[1]=1]=1;
	for (int i=2;i<N;i++)
	{
		id[i]=i;
		if (!pd[i]) pri[++cnt]=i,mu[i]=-1;
		for (int j=1;j<=cnt&&pri[j]*i<N;j++)
		{
			pd[pri[j]*i]=1;
			if (i%pri[j]==0)
			{
				mu[pri[j]*i]=0;
				break;
			}
			mu[pri[j]*i]=-mu[i];
		}
	}
	for (int i=1;i<N;i++)
		for (int j=1;j*i<N;j++)
			f[j*i]+=(ll)i;
	sort(id+1,id+N-1,cmp);
	T=read();
	for (int i=1;i<=T;i++)
		p[i].n=read(),p[i].m=read(),p[i].a=read(),p[i].pos=i;
	sort(p+1,p+T+1);
	int now=1;
	for (int k=1;k<=T;k++)
	{
		while (p[k].a>=f[id[now]]&&now<N)
			updata(id[now]),now++;
		n=p[k].n,m=p[k].m;
		if (n>m) swap(n,m);
		for (int i=1,j;i<=n;i=j+1)
		{
			j=min(n/(n/i),m/(m/i));
			ans[p[k].pos]=(ans[p[k].pos]+(ll)(n/i)*(m/i)%mod*(qry(j)-qry(i-1))%mod)%mod;
		}
	}
	for (int i=1;i<=T;i++) printf("%lld\n",(ans[i]%mod+mod)%mod);
	return 0;
}