bzoj1074: [SCOI2007]折纸origami

最新推荐文章于 2019-03-26 14:12:34 发布

yzxshuaige123

最新推荐文章于 2019-03-26 14:12:34 发布

阅读量152

点赞数

分类专栏： oi 文章标签： bzoj

本文链接：https://blog.csdn.net/yzxshuaige123/article/details/84477452

版权

oi 专栏收录该内容

71 篇文章 0 订阅

订阅专栏

从后往前逆推

const int N = 10;
struct Point {
	DB Ox, Oy;
	Point(){}
	Point(DB _Ox, DB _Oy) : Ox(_Ox), Oy(_Oy) {}
	friend Point operator -(Point a, Point b) { return Point(a.Ox-b.Ox, a.Oy-b.Oy); }
	friend Point operator + (Point a, Point b){ return Point(a.Ox + b.Ox, a.Oy + b.Oy); }
	DB Len() { return sqrt(Ox * Ox + Oy * Oy); }
	friend Point operator /(Point a, DB c) { return Point(a.Ox/c, a.Oy/c); }
	friend Point operator  * (Point a, DB c) { return Point(a.Ox * c, a.Oy * c); }
} P[1 << N];
struct Line {
	Point P1, P2;
} Dat[N];
bool Hash[1 << N];
int n, m;

inline void Solve();
inline void Input() {
	scanf("%d", &n);
	For(i, 1, n) scanf("%lf%lf%lf%lf", &Dat[i].P1.Ox, &Dat[i].P1.Oy, &Dat[i].P2.Ox, &Dat[i].P2.Oy);
	scanf("%d", &m);
}

inline DB Cross(Point a, Point b, Point c) {
	return(b.Ox - a.Ox) * (c.Oy - a.Oy) - (b.Oy - a.Oy) * (c.Ox - a.Ox);
}

inline DB Dist(Point P1, Point P2) {
	DB Ox = P1.Ox - P2.Ox, Oy = P1.Oy - P2.Oy;
	return sqrt(Ox * Ox + Oy * Oy);
}

inline DB Dist(Point P, Line Dat) { return fabs(Cross(P, Dat.P1, Dat.P2)) / Dist(Dat.P1, Dat.P2); }

inline Point Get(Point P, Line Dat) {
	Point A = Dat.P2 - Dat.P1;
	Point B(A.Oy, -A.Ox);
	DB h = Dist(P, Dat);
	B = B / B.Len() * h;
	return P + B * 2;
}

inline bool In(Point P) {
	return P.Ox > 0 && P.Ox < 100 && P.Oy > 0 && P.Oy < 100;
}

inline void Solve() {
	while(m--) {
		int Cnt = 1;
		clr(Hash, 0);
		scanf("%lf%lf", &P[1].Ox, &P[1].Oy);
		Ford(i, n, 1) {
			int t = Cnt;
			For(j, 1, t)
				if(!Hash[j]) {
					if(Cross(Dat[i].P1, Dat[i].P2, P[j]) > 0) P[++Cnt] = Get(P[j], Dat[i]);
					else Hash[j] = 1;
				}
		}
		int Ans = 0;
		For(i, 1, Cnt) Ans += (!Hash[i] && In(P[i]));
		printf("%d\n", Ans);
	}
}

int main(){
	#ifndef ONLINE_JUDGE
	SETIO("1074");
	#endif
	Input();
	Solve();
	return 0;
}