【HNOI2019】鱼（极角序扫描线）

传送门

---

题解：

发现我们可以枚举AD，然后对于所有B,C，合法的AD应该是在一条直线上的，这个直线可以搞出来，对于所有的AD，合法的BC中点应该在AD线段上，这个可以lower_bound+upper_bound随便算出来。

然后考虑怎么算EF，直接极角序扫描线，按照极角序枚举A，统计在合法角度范围内的距离D一定值的有多少个，可以直接用哈希表。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

using std::cerr;
using std::cout;

cs int N=1e3+7;

struct Point{
	int x,y;
	Point(){}
	Point(int _x,int _y):x(_x),y(_y){}
	friend Point operator+(cs Point &a,cs Point &b){return Point(a.x+b.x,a.y+b.y);}
	friend Point operator-(cs Point &a,cs Point &b){return Point(a.x-b.x,a.y-b.y);}
	friend ll operator*(cs Point &a,cs Point &b){return (ll)a.x*b.y-(ll)b.x*a.y;}
	friend bool operator<(cs Point &a,cs Point &b){return a.x==b.x?a.y<b.y:a.x<b.x;}
	bool area()cs{return y>0||(y==0&&x<0);}
};

inline ll dot(cs Point &a,cs Point &b){return (ll)a.x*b.x+(ll)a.y*b.y;}
inline ll norm(cs Point &a){return dot(a,a);}
inline Point reflect(Point a){
	int g=std::__gcd(a.x,a.y);
	a.x/=g,a.y/=g;
	if(a.x<0||(a.x==0&&a.y<0)){
		a.x*=-1;
		a.y*=-1;
	}
	return a;
}

struct Line{
	Point v,o;
	Line(){}
	Line(cs Point &_v,cs Point &_o):v(_v),o(_o){}
	friend bool operator<(cs Line &a,cs Line &b){
		if(a.v<b.v||b.v<a.v)return a.v<b.v;
		if(dot(a.v,a.o)!=dot(b.v,b.o))return dot(a.v,a.o)<dot(b.v,b.o);
		return a.o<b.o;
	}
};

bool cmp(cs Point &a,cs Point &b){
	if(a.area()!=b.area())return a.area()<b.area();
	return a*b>0;
}

ll ans;
int n,cnt;
Point a[N],b[N<<1];
Line L[N*N];

std::unordered_map<ll,int> ma;

signed main(){
#ifdef zxyoi
	freopen("fish.in","r",stdin);
#endif
	scanf("%d",&n);
	for(int re i=1;i<=n;++i)scanf("%d%d",&a[i].x,&a[i].y);
	for(int re i=1;i<=n;++i)
	for(int re j=i+1;j<=n;++j)
	L[++cnt]=Line(reflect(a[i]-a[j]),a[i]+a[j]);
	std::sort(L+1,L+cnt+1);
	for(int re i=1;i<=n;++i){
		int t=0;for(int re j=1;j<=n;++j)if(j!=i)b[++t]=a[j]-a[i];
		std::sort(b+1,b+n,cmp);
		for(int re j=1;j<n;++j)b[j+n-1]=b[j];
		ma.clear();int sum=0,l=1,r=1;
		for(int re j=1;j<n;++j){
			while(b[j]*b[r]>0||(b[j]*b[r]==0&&r<n)||dot(b[j],b[r])<0)sum+=ma[norm(b[r++])]++;
			while(l<r&&dot(b[j],b[l])>=0)sum-=--ma[norm(b[l++])];
			Point v=reflect(Point(b[j].y,-b[j].x));
			Point lp=a[i]+a[i];
			Point rp=a[i]+b[j]+a[i]+b[j];
			if(rp<lp)std::swap(lp,rp);
			int d=std::lower_bound(L+1,L+cnt+1,Line(v,rp))-std::upper_bound(L+1,L+cnt+1,Line(v,lp));
			ans+=4ll*sum*d;
		}
	}
	cout<<ans<<"\n"; 
	return 0;
}