#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = pair; using func = ll; val op(val a, val b) { return MP(a.first + b.first, a.second + b.second); } val e() { return MP(0, 0); } val mp(func f, val a) { return MP(a.first + f * a.second, a.second); } func comp(func f, func g) { return f + g; } func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll q; ll xa, ya, xb, yb, xc, yc; cin >> q >> xa >> ya >> xb >> yb >> xc >> yc; auto [x, y] = read_tuple(q); ll sqa = (xb - xc) * (xb - xc) + (yb - yc) * (yb - yc); ll sqb = (xc - xa) * (xc - xa) + (yc - ya) * (yc - ya); ll sqc = (xa - xb) * (xa - xb) + (ya - yb) * (ya - yb); if (sqb >= sqa && sqb >= sqc) { swap(xa, xb); swap(ya, yb); } else if (sqc >= sqa && sqc >= sqb) { swap(xa, xc); swap(ya, yc); } sqa = (xb - xc) * (xb - xc) + (yb - yc) * (yb - yc); sqb = (xc - xa) * (xc - xa) + (yc - ya) * (yc - ya); sqc = (xa - xb) * (xa - xb) + (ya - yb) * (ya - yb); if (sqa >= sqb + sqc) { REP(i, q) { ll bd = (xb - x[i]) * (xb - x[i]) + (yb - y[i]) * (yb - y[i]); ll cd = (xc - x[i]) * (xc - x[i]) + (yc - y[i]) * (yc - y[i]); if (bd + cd <= sqa) { cout << "Yes\n"; } else { cout << "No\n"; } } } else { ll area = DET3(xb, yb, 1, xc, yc, 1, xa, ya, 1); //double cos = (xb-xa)*(xc-xa)+(yb-ya)*(yc-ya)/sqrt(sqb*sqc); ll cosSquNum = (xb - xa) * (xc - xa) + (yb - ya) * (yc - ya); cosSquNum *= cosSquNum; ll cosSquDem = sqb * sqc; REP(i, q) { ll bd = (xb - x[i]) * (xb - x[i]) + (yb - y[i]) * (yb - y[i]); ll cd = (xc - x[i]) * (xc - x[i]) + (yc - y[i]) * (yc - y[i]); ll inner = (xb - x[i]) * (xc - x[i]) + (yb - y[i]) * (yc - y[i]); ll cosSquNumi = inner * inner; ll cosSquDemi = bd * cd; ll areai = DET3(xb, yb, 1, xc, yc, 1, x[i], y[i], 1); ll mod = 1000000000; VL left = { 0,(cosSquNumi / mod) * (cosSquDem / mod),(cosSquNumi % mod) * (cosSquDem / mod) + (cosSquNumi / mod) * (cosSquDem % mod),(cosSquNumi % mod) * (cosSquDem % mod) }; VL rigt = { 0,(cosSquNum / mod) * (cosSquDemi / mod),(cosSquNum % mod) * (cosSquDemi / mod) + (cosSquNum / mod) * (cosSquDemi % mod),(cosSquNum % mod) * (cosSquDemi % mod) }; PER(i, 3) { left[i] += left[i + 1] / mod; rigt[i] += rigt[i + 1] / mod; left[i+1] %= mod; rigt[i+1] %= mod; } if (area * areai >= 0) { if (inner < 0 || left <= rigt) { cout << "Yes\n"; } else { cout << "No\n"; } } else { if (inner > 0) { cout << "No\n"; } else if (left >= rigt) { cout << "Yes\n"; } else { cout << "No\n"; } } } } return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }