【题解】玲珑学院oj1092 Fate Dog

题目链接

题意：给定n个元素，第i个元素有属性a[i]，b[i]，c[i]，p[i]。求满足(a[i]+b[j]+c[k])(1+p[i]/100)≥H的有序点对(i,j,k)（i、j、k互不相等）的数目。

分析：不等式(a[i]+b[j]+c[k])(1+p[i]/100)≥H可变形为b[j]+c[k]≥100*H/(100+p[i])-a[i]，故可枚举i，对每个i求满足b[j]+c[k]≥100*H/(100+p[i])-a[i]且j≠i，k≠i且j≠k的有序点对(j,k)的数目。

        先用fft预处理b[j]+c[k]=m的数目，然后对每个i用前缀和统计方案，再减去被重复统计的方案即可。

代码

#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long LL;
const db pi=acos(-1.0);
const int maxn=3e5+10;
struct Complex
{
	db x,y;
	Complex operator + (const Complex &o) const
	{
		return (Complex){x+o.x,y+o.y};
	}
	Complex operator - (const Complex &o) const
	{
		return (Complex){x-o.x,y-o.y};
	}
	Complex operator * (const Complex &o) const
	{
		return (Complex){x*o.x-y*o.y,x*o.y+y*o.x};
	}
}_P[maxn];
int rev(int x,int len)
{
	int ret=0;
	for (int i=0;(1<<i)<len;i++)
	{
		if (x&(1<<i)) ret^=1;
		ret<<=1;
	}
	return ret>>1;
}
void FFT(Complex P[],int n,int oper)
{
	for (int i=0;i<n;i++) _P[i]=P[rev(i,n)];
	for (int i=0;i<n;i++) P[i]=_P[i];
	for (int d=0;(1<<d)<n;d++)
	{
		int m=1<<d;
		int m2=m*2;
		db p0=pi/m*oper;
		Complex unit_p0=(Complex){cos(p0),sin(p0)};
		for (int i=0;i<n;i+=m2)
		{
			Complex unit=(Complex){1,0};
			for (int j=0;j<m;j++)
			{
				Complex &P1=P[i+j+m],&P2=P[i+j];
				Complex t=unit*P1;
				P1=P2-t;
				P2=P2+t;
				unit=unit*unit_p0;
			}
		}
	}
	if (oper==-1) for (int i=0;i<n;i++) P[i].x/=n,P[i].y/=n;
}
int n,H,a[maxn],b[maxn],c[maxn],p[maxn],b1[maxn],c1[maxn],d1[maxn];
LL s[maxn];
Complex A[maxn],B[maxn],C[maxn];
void init()
{
	for (int i=0;i<maxn;i++) A[i].x=A[i].y=B[i].x=B[i].y=0;
}
int get1(int X)
{
	int l=1,r=n,mid,ret=0;
	while (l<=r)
	{
		mid=(l+r)/2;
		if (d1[mid]>=X)
		{
			ret=n-mid+1;
			r=mid-1;
		}
		else l=mid+1;
	}
	return ret;
}
int get2(int x,int X)
{
	int l=1,r=n,mid,ret=0;
	while (l<=r)
	{
		mid=(l+r)/2;
		if (x+c1[mid]>=X)
		{
			ret=n-mid+1;
			r=mid-1;
		}
		else l=mid+1;
	}
	return ret;
}
int get3(int x,int X)
{
	int l=1,r=n,mid,ret=0;
	while (l<=r)
	{
		mid=(l+r)/2;
		if (b1[mid]+x>=X)
		{
			ret=n-mid+1;
			r=mid-1;
		}
		else l=mid+1;
	}
	return ret;
}
int main()
{
	int T;cin>>T;
	while (T--)
	{
		init();
		scanf("%d%d",&n,&H);
		for (int i=1;i<=n;i++) scanf("%d%d%d%d",&a[i],&b[i],&c[i],&p[i]),A[b[i]].x++,B[c[i]].x++,b1[i]=b[i],c1[i]=c[i],d1[i]=b[i]+c[i];
		sort(b1+1,b1+n+1);sort(c1+1,c1+n+1);sort(d1+1,d1+n+1);
		int l=1;while ((1<<l)<=b1[n]+c1[n]) l++;
		FFT(A,1<<l,1);FFT(B,1<<l,1);
		for (int i=0;i<=(1<<l);i++) C[i]=A[i]*B[i];
		FFT(C,(1<<l),-1);
		s[0]=(LL)(C[0].x+0.5);for (int i=1;i<=(1<<l);i++) s[i]=s[i-1]+(LL)(C[i].x+0.5);
		LL ans=0;
		for (int i=1;i<=n;i++)
		{
			int Ai=100*H/(100+p[i])-a[i];
			if (100*H%(100+p[i])) Ai++;
			if (Ai<=0) ans+=(LL)(n-1)*(n-2);
			else if (Ai<=b1[n]+c1[n])
			{
				ans+=s[1<<l]-s[Ai-1];
				ans-=get1(Ai);
				ans-=get2(b[i],Ai);
				ans-=get3(c[i],Ai);
				if (b[i]+c[i]>=Ai) ans+=2;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}