[BZOJ1074][计算几何][搜索]SCOI2017：折纸

OJ挂，链自找

一直在想正做的做法，然后当场去世

反着做就好做多了，对于每个询问点，我们找出其被翻回去后处于哪个位置，然后从这两个点递归下去继续找，需要及时判断合法性，即一个点是否处于当前直线的右侧，如果在显然不行，因为右边的会被往左边翻，所以这个位置实际上最后是空的
点的对称就利用直线垂直：$k1\ast k2=-1$搞即可

Code：

#include<bits/stdc++.h>
#define eps 1e-6
#define db double
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=2e5+5;
struct point{
	db x,y;
	point(){}
	point(db _x,db _y):x(_x),y(_y){}
	friend inline point operator + (const point &a,const point &b){return point(a.x+b.x,a.y+b.y);}
	friend inline point operator - (const point &a,const point &b){return point(a.x-b.x,a.y-b.y);}
	friend inline point operator * (const point &a,const db &b){return point(a.x*b,a.y*b);}
	friend inline point operator / (const point &a,const db &b){return point(a.x/b,a.y/b);}
	friend inline db operator * (const point &a,const point &b){return a.x*b.y-a.y*b.x;}
	inline db dis(){return sqrt(x*x+y*y);}
	inline point ref(){return point(-y,x)/dis();}
}p1[N],p2[N];
inline point ref(point p,int id){
	db dis=(p1[id]-p)*(p2[id]-p)/(p1[id]-p2[id]).dis();
	return p-(p2[id]-p1[id]).ref()*2*dis;
}
int dfs(point p,int now){
	if(!now) return p.x>eps && p.x+eps<100 && p.y>eps && p.y+eps<100;
	if((p1[now]-p)*(p2[now]-p)<eps) return 0;
	return dfs(p,now-1)+dfs(ref(p,now),now-1);
}
int main(){
	int n=read();
	for(int i=1;i<=n;i++)
		scanf("%lf%lf%lf%lf",&p1[i].x,&p1[i].y,&p2[i].x,&p2[i].y);
	int q=read();
	while(q--){
		db x,y;
		scanf("%lf%lf",&x,&y);
		cout<<dfs(point(x,y),n)<<"\n";
	}
	return 0;
}