This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412
#include "../../template/template.hpp"
#include "../../geometry/convex_polygon_contains.hpp"
using namespace geometry;
int main() {
int N, Q;
cin >> N;
Polygon g(N);
for(int i = 0; i < N; i++) {
double x, y;
cin >> x >> y;
g[i] = Point(x, y);
}
cin >> Q;
while(Q--) {
double x, y;
cin >> x >> y;
Point p(x - x / 10000, y - y / 10000);
if(convex_polygon_contains(g, p)) cout << 1 << "\n";
else cout << 0 << "\n";
}
}
#line 1 "test/verify/aoj-0412.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-0412.test.cpp"
#line 2 "geometry/base.hpp"
namespace geometry {
using Real = double;
const Real EPS = 1e-8;
const Real PI = acos(static_cast<Real>(-1));
enum { OUT, ON, IN };
inline int sign(const Real &r) { return r <= -EPS ? -1 : r >= EPS ? 1 : 0; }
inline bool equals(const Real &a, const Real &b) { return sign(a - b) == 0; }
} // namespace geometry
#line 3 "geometry/point.hpp"
namespace geometry {
using Point = complex<Real>;
istream &operator>>(istream &is, Point &p) {
Real a, b;
is >> a >> b;
p = Point(a, b);
return is;
}
ostream &operator<<(ostream &os, const Point &p) {
return os << real(p) << " " << imag(p);
}
Point operator*(const Point &p, const Real &d) {
return Point(real(p) * d, imag(p) * d);
}
// rotate point p counterclockwise by theta rad
Point rotate(Real theta, const Point &p) {
return Point(cos(theta) * real(p) - sin(theta) * imag(p),
sin(theta) * real(p) + cos(theta) * imag(p));
}
Real cross(const Point &a, const Point &b) {
return real(a) * imag(b) - imag(a) * real(b);
}
Real dot(const Point &a, const Point &b) {
return real(a) * real(b) + imag(a) * imag(b);
}
bool compare_x(const Point &a, const Point &b) {
return equals(real(a), real(b)) ? imag(a) < imag(b) : real(a) < real(b);
}
bool compare_y(const Point &a, const Point &b) {
return equals(imag(a), imag(b)) ? real(a) < real(b) : imag(a) < imag(b);
}
using Points = vector<Point>;
} // namespace geometry
#line 2 "geometry/polygon.hpp"
#line 4 "geometry/polygon.hpp"
namespace geometry {
using Polygon = vector<Point>;
using Polygons = vector<Polygon>;
} // namespace geometry
#line 4 "geometry/convex_polygon_contains.hpp"
namespace geometry {
int convex_polygon_contains(const Polygon &Q, const Point &p) {
int N = (int)Q.size();
Point g = (Q[0] + Q[N / 3] + Q[N * 2 / 3]) / 3.0;
if (equals(imag(g), imag(p)) && equals(real(g), real(p))) return IN;
Point gp = p - g;
int l = 0, r = N;
while (r - l > 1) {
int mid = (l + r) / 2;
Point gl = Q[l] - g;
Point gm = Q[mid] - g;
if (cross(gl, gm) > 0) {
if (cross(gl, gp) >= 0 && cross(gm, gp) <= 0)
r = mid;
else
l = mid;
} else {
if (cross(gl, gp) <= 0 && cross(gm, gp) >= 0)
l = mid;
else
r = mid;
}
}
r %= N;
Real v = cross(Q[l] - p, Q[r] - p);
return sign(v) == 0 ? ON : sign(v) == -1 ? OUT : IN;
}
} // namespace geometry
#line 6 "test/verify/aoj-0412.test.cpp"
using namespace geometry;
int main() {
int N, Q;
cin >> N;
Polygon g(N);
for(int i = 0; i < N; i++) {
double x, y;
cin >> x >> y;
g[i] = Point(x, y);
}
cin >> Q;
while(Q--) {
double x, y;
cin >> x >> y;
Point p(x - x / 10000, y - y / 10000);
if(convex_polygon_contains(g, p)) cout << 1 << "\n";
else cout << 0 << "\n";
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample_01.in | AC | 6 ms | 4 MB |
g++ | 00_sample_02.in | AC | 6 ms | 4 MB |
g++ | 01_small_00.in | AC | 6 ms | 4 MB |
g++ | 01_small_01.in | AC | 6 ms | 4 MB |
g++ | 03_tri_00.in | AC | 6 ms | 4 MB |
g++ | 04_tri_00.in | AC | 10 ms | 4 MB |
g++ | 05_tri_00.in | AC | 23 ms | 4 MB |
g++ | 06_tri_00.in | AC | 23 ms | 4 MB |
g++ | 10_small_hull_00.in | AC | 19 ms | 4 MB |
g++ | 10_small_hull_01.in | AC | 19 ms | 4 MB |
g++ | 10_small_hull_02.in | AC | 18 ms | 4 MB |
g++ | 10_small_hull_03.in | AC | 18 ms | 4 MB |
g++ | 10_small_hull_04.in | AC | 19 ms | 4 MB |
g++ | 11_mid_hull_00.in | AC | 19 ms | 4 MB |
g++ | 11_mid_hull_01.in | AC | 19 ms | 4 MB |
g++ | 11_mid_hull_02.in | AC | 19 ms | 4 MB |
g++ | 11_mid_hull_03.in | AC | 19 ms | 4 MB |
g++ | 11_mid_hull_04.in | AC | 19 ms | 4 MB |
g++ | 12_large_hull_00.in | AC | 20 ms | 4 MB |
g++ | 12_large_hull_01.in | AC | 20 ms | 4 MB |
g++ | 12_large_hull_02.in | AC | 19 ms | 4 MB |
g++ | 12_large_hull_03.in | AC | 19 ms | 4 MB |
g++ | 12_large_hull_04.in | AC | 20 ms | 4 MB |
g++ | 20_small_ellipse_00.in | AC | 10 ms | 4 MB |
g++ | 20_small_ellipse_01.in | AC | 10 ms | 4 MB |
g++ | 20_small_ellipse_02.in | AC | 10 ms | 4 MB |
g++ | 20_small_ellipse_03.in | AC | 10 ms | 4 MB |
g++ | 20_small_ellipse_04.in | AC | 10 ms | 4 MB |
g++ | 21_mid_ellipse_00.in | AC | 12 ms | 4 MB |
g++ | 21_mid_ellipse_01.in | AC | 12 ms | 4 MB |
g++ | 21_mid_ellipse_02.in | AC | 12 ms | 4 MB |
g++ | 21_mid_ellipse_03.in | AC | 12 ms | 4 MB |
g++ | 21_mid_ellipse_04.in | AC | 12 ms | 4 MB |
g++ | 22_large_ellipse_00.in | AC | 46 ms | 4 MB |
g++ | 22_large_ellipse_01.in | AC | 47 ms | 4 MB |
g++ | 22_large_ellipse_02.in | AC | 47 ms | 4 MB |
g++ | 22_large_ellipse_03.in | AC | 47 ms | 4 MB |
g++ | 23_bf_killer_00.in | AC | 46 ms | 4 MB |
clang++ | 00_sample_01.in | AC | 6 ms | 4 MB |
clang++ | 00_sample_02.in | AC | 6 ms | 4 MB |
clang++ | 01_small_00.in | AC | 6 ms | 4 MB |
clang++ | 01_small_01.in | AC | 6 ms | 4 MB |
clang++ | 03_tri_00.in | AC | 6 ms | 4 MB |
clang++ | 04_tri_00.in | AC | 9 ms | 4 MB |
clang++ | 05_tri_00.in | AC | 23 ms | 4 MB |
clang++ | 06_tri_00.in | AC | 23 ms | 4 MB |
clang++ | 10_small_hull_00.in | AC | 18 ms | 4 MB |
clang++ | 10_small_hull_01.in | AC | 18 ms | 4 MB |
clang++ | 10_small_hull_02.in | AC | 18 ms | 4 MB |
clang++ | 10_small_hull_03.in | AC | 18 ms | 4 MB |
clang++ | 10_small_hull_04.in | AC | 18 ms | 4 MB |
clang++ | 11_mid_hull_00.in | AC | 19 ms | 4 MB |
clang++ | 11_mid_hull_01.in | AC | 18 ms | 4 MB |
clang++ | 11_mid_hull_02.in | AC | 19 ms | 4 MB |
clang++ | 11_mid_hull_03.in | AC | 18 ms | 4 MB |
clang++ | 11_mid_hull_04.in | AC | 19 ms | 4 MB |
clang++ | 12_large_hull_00.in | AC | 19 ms | 4 MB |
clang++ | 12_large_hull_01.in | AC | 19 ms | 4 MB |
clang++ | 12_large_hull_02.in | AC | 19 ms | 4 MB |
clang++ | 12_large_hull_03.in | AC | 19 ms | 4 MB |
clang++ | 12_large_hull_04.in | AC | 19 ms | 4 MB |
clang++ | 20_small_ellipse_00.in | AC | 10 ms | 4 MB |
clang++ | 20_small_ellipse_01.in | AC | 10 ms | 4 MB |
clang++ | 20_small_ellipse_02.in | AC | 10 ms | 4 MB |
clang++ | 20_small_ellipse_03.in | AC | 10 ms | 4 MB |
clang++ | 20_small_ellipse_04.in | AC | 10 ms | 4 MB |
clang++ | 21_mid_ellipse_00.in | AC | 11 ms | 4 MB |
clang++ | 21_mid_ellipse_01.in | AC | 11 ms | 4 MB |
clang++ | 21_mid_ellipse_02.in | AC | 11 ms | 4 MB |
clang++ | 21_mid_ellipse_03.in | AC | 12 ms | 4 MB |
clang++ | 21_mid_ellipse_04.in | AC | 11 ms | 4 MB |
clang++ | 22_large_ellipse_00.in | AC | 42 ms | 4 MB |
clang++ | 22_large_ellipse_01.in | AC | 42 ms | 4 MB |
clang++ | 22_large_ellipse_02.in | AC | 42 ms | 4 MB |
clang++ | 22_large_ellipse_03.in | AC | 42 ms | 4 MB |
clang++ | 23_bf_killer_00.in | AC | 42 ms | 4 MB |