CodeForces - 32E Hide-and-Seek【计算几何】

题目链接：https://codeforces.com/contest/32/problem/E

先判两点之间是否被墙和镜子挡，再用相似三角形找入射点，乱搞判断一下。
这题有点卡精度，EPS用1e-6能过，1e-8过不了。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define lowbit(x) (x & (-x))
#define CASET int _; scanf("%d", &_); for(int kase=1;kase<=_;kase++)

typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;

static const int INF=0x3f3f3f3f;
static const ll INFL=0x3f3f3f3f3f3f3f3f;
static const db EPS=1e-6;
static const db PI=acos(-1.0);
static const int MOD=1e9+7;

template <typename T>
inline void read(T &f) {
   
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') {
    if (c == '-') {
    fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') {
    f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
template <typename T>
void print(T x) {
   
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
int sgn(db x){
   
    if(fabs(x)<EPS) return 0;
    if(x<0) return -1;
    return 1;
} // 符号函数 1正 -1负 0零 
int cmp(db x,db y){
   
    if(fabs(x-y)<EPS) return 0;
    if(x<y) return -1;
    return 1;
} // 比较函数 1大于 -1小于 0等于
struct Point{
   
    db x,y;
    Point(){
   }
    Point(db _x,db _y):x(_x),y(_y){
   }
    void input(){
    scanf("%lf%lf",&x,&y); }
    bool operator==(const Point &b)const{
    return sgn(x-b.x)==0 && sgn(y-b.y)==0; }
    bool operator<(const Point &b)const{
    return sgn(x-b.x)==0?sgn(y-b.y)<0:x<b.x; }
    Point operator+(const Point &b)const{
    return Point(x+b.x,y+b.y); }
    Point operator-(const Point &b)const{
    return Point(x-b.x,y-b.y); }
    Point operator*(const db &k)const{
    return Point(x*k,y*k); }
    Point operator/(const db &k)const{
    return Point(x/k,y/k); }
    db operator^(const Point &b)const{
    return x*b.y-y*b.x; } // 叉积
    db operator*(const Point &b)con