MtSaka's Library
This documentation is automatically generated by online-judge-tools/verification-helper
test/aoj/CGL/CGL_2_B.test.cpp
- View this file on GitHub
- Last update: 2024-06-30 13:01:18+09:00
- Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all/CGL_2_B
Depends on
- geometry/geometry.hpp
- template/alias.hpp
- template/func.hpp
- template/in.hpp
- template/macro.hpp
- template/out.hpp
- template/template.hpp
- template/type-traits.hpp
- template/util.hpp
Code
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all/CGL_2_B
#include "../../../geometry/geometry.hpp"
#include "../../../template/template.hpp"
int main() {
INT(q);
while (q--) {
geometry::point p1, p2, q1, q2;
sc >> p1 >> p2 >> q1 >> q2;
geometry::segment a(p1, p2), b(q1, q2);
print(geometry::intersect(a, b));
}
}#line 1 "test/aoj/CGL/CGL_2_B.test.cpp"
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all/CGL_2_B
#line 2 "template/template.hpp"
#include <bits/stdc++.h>
#line 3 "template/alias.hpp"
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128_t;
using u128 = __uint128_t;
using pi = std::pair<int, int>;
using pl = std::pair<ll, ll>;
using vi = std::vector<int>;
using vl = std::vector<ll>;
using vs = std::vector<std::string>;
using vc = std::vector<char>;
using vvl = std::vector<vl>;
using vd = std::vector<double>;
using vp = std::vector<pl>;
using vb = std::vector<bool>;
template <typename T>
struct infinity {
static constexpr T max = std::numeric_limits<T>::max();
static constexpr T min = std::numeric_limits<T>::min();
static constexpr T value = std::numeric_limits<T>::max() / 2;
static constexpr T mvalue = std::numeric_limits<T>::min() / 2;
};
template <typename T>
constexpr T INF = infinity<T>::value;
constexpr ll inf = INF<ll>;
constexpr ld EPS = 1e-8;
constexpr ld PI = 3.1415926535897932384626;
constexpr int dx[8] = {-1, 0, 1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
#line 3 "template/macro.hpp"
#ifndef __COUNTER__
#define __COUNTER__ __LINE__
#endif
#define SELECT4(a, b, c, d, e, ...) e
#define SELECT3(a, b, c, d, ...) d
#define REP_1(a, c) for (ll REP_##c = 0; REP_##c < (ll)(a); ++REP_##c)
#define REP1(a) REP_1(a, __COUNTER__)
#define REP2(i, a) for (ll i = 0; i < (ll)(a); ++i)
#define REP3(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define REP4(i, a, b, c) for (ll i = (ll)(a); i < (ll)(b); i += (ll)(c))
#define rep(...) SELECT4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
#define RREP_1(a, c) for (ll RREP_##c = (ll)(a) - 1; RREP_##c >= 0; --RREP_##c)
#define RREP1(a) RREP_1(a, __COUNTER__)
#define RREP2(i, a) for (ll i = (ll)(a) - 1; i >= 0; --i)
#define RREP3(i, a, b) for (ll i = (ll)(b) - 1; i >= (ll)(a); --i)
#define rrep(...) SELECT3(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)
#define all(v) std::begin(v), std::end(v)
#define rall(v) std::rbegin(v), std::rend(v)
#define INT(...) \
int __VA_ARGS__; \
scan(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
scan(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
scan(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
scan(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
scan(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
scan(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#line 3 "template/type-traits.hpp"
#line 5 "template/type-traits.hpp"
template <typename T, typename... Args>
struct function_traits_impl {
using return_type = T;
static constexpr std::size_t arg_size = sizeof...(Args);
template <std::size_t idx>
using argument_type = typename std::tuple_element<idx, std::tuple<Args...>>::type;
using argument_types = std::tuple<Args...>;
};
template <typename>
struct function_traits_helper;
template <typename T, typename Tp, typename... Args>
struct function_traits_helper<T (Tp::*)(Args...)> : function_traits_impl<T, Args...> {};
template <typename T, typename Tp, typename... Args>
struct function_traits_helper<T (Tp::*)(Args...) const> : function_traits_impl<T, Args...> {};
template <typename T, typename Tp, typename... Args>
struct function_traits_helper<T (Tp::*)(Args...)&> : function_traits_impl<T, Args...> {};
template <typename T, typename Tp, typename... Args>
struct function_traits_helper<T (Tp::*)(Args...) const&> : function_traits_impl<T, Args...> {};
template <typename F>
using function_traits = function_traits_helper<decltype(&std::remove_reference<F>::type::operator())>;
template <typename F>
using function_return_type = typename function_traits<F>::return_type;
template <typename F, std::size_t idx>
using function_argument_type = typename function_traits<F>::template argument_type<idx>;
template <typename F>
using function_argument_types = typename function_traits<F>::argument_types;
template <class T>
using is_signed_int = std::integral_constant<bool, (std::is_integral<T>::value && std::is_signed<T>::value) || std::is_same<T, __int128_t>::value>;
template <class T>
using is_unsigned_int = std::integral_constant<bool, (std::is_integral<T>::value && std::is_unsigned<T>::value) || std::is_same<T, __uint128_t>::value>;
template <class T>
using is_int = std::integral_constant<bool, is_signed_int<T>::value || is_unsigned_int<T>::value>;
template <typename T, typename = void>
struct is_range : std::false_type {};
template <typename T>
struct is_range<
T,
decltype(all(std::declval<typename std::add_lvalue_reference<T>::type>()), (void)0)> : std::true_type {};
template <std::size_t size>
struct int_least {
static_assert(size <= 128, "size must be less than or equal to 128");
using type = typename std::conditional<
size <= 8, std::int_least8_t,
typename std::conditional<
size <= 16, std::int_least16_t,
typename std::conditional<
size <= 32, std::int_least32_t,
typename std::conditional<size <= 64, std::int_least64_t, __int128_t>::type>::type>::type>::type;
};
template <std::size_t size>
using int_least_t = typename int_least<size>::type;
template <std::size_t size>
struct uint_least {
static_assert(size <= 128, "size must be less than or equal to 128");
using type = typename std::conditional<
size <= 8, std::uint_least8_t,
typename std::conditional<
size <= 16, std::uint_least16_t,
typename std::conditional<
size <= 32, std::uint_least32_t,
typename std::conditional<size <= 64, std::uint_least64_t, __uint128_t>::type>::type>::type>::type;
};
template <std::size_t size>
using uint_least_t = typename uint_least<size>::type;
template <typename T>
using double_size_int = int_least<std::numeric_limits<T>::digits * 2 + 1>;
template <typename T>
using double_size_int_t = typename double_size_int<T>::type;
template <typename T>
using double_size_uint = uint_least<std::numeric_limits<T>::digits * 2>;
template <typename T>
using double_size_uint_t = typename double_size_uint<T>::type;
template <typename T>
using double_size = typename std::conditional<std::is_signed<T>::value, double_size_int<T>, double_size_uint<T>>::type;
template <typename T>
using double_size_t = typename double_size<T>::type;
#line 4 "template/in.hpp"
namespace fastio {
template <std::size_t BUFF_SIZE = 1 << 17, int decimal_precision = 16>
struct Scanner {
private:
template <typename, typename = void>
struct has_scan : std::false_type {};
template <class T>
struct has_scan<T, decltype(std::declval<T>().scan(std::declval<Scanner&>()), (void)0)> : std::true_type {};
FILE* file;
char buffer[BUFF_SIZE + 1];
int idx, sz;
bool state;
inline void load() {
int len = sz - idx;
if (idx < len) return;
memcpy(buffer, buffer + idx, len);
sz = len + fread(buffer + len, 1, BUFF_SIZE - len, file);
idx = 0;
if (static_cast<size_t>(sz) < BUFF_SIZE) buffer[sz++] = '\n';
}
inline char cur() {
if (idx == sz) load();
if (idx == sz) {
state = false;
return '\0';
}
return buffer[idx];
}
inline void next() {
if (idx == sz) load();
if (idx == sz) return;
idx++;
}
public:
Scanner() : Scanner(stdin) {}
explicit Scanner(FILE* file) : file(file), idx(0), sz(0), state(true) { load(); }
~Scanner() {
if (file != stdin) fclose(file);
}
inline char scan_char() {
if (idx == sz) load();
return (idx == sz ? '\0' : buffer[idx++]);
}
Scanner ignore(int n = 1) {
if (idx + n > sz) load();
idx += n;
return (*this);
}
inline void skip_space() {
if (idx == sz) load();
while (('\t' <= cur() && cur() <= '\r') || cur() == ' ') {
next();
}
}
void scan(char& a) {
skip_space();
a = scan_char();
}
void scan(std::string& a) {
skip_space();
a.clear();
while (cur() != '\0' && (buffer[idx] < '\t' || '\r' < buffer[idx]) && buffer[idx] != ' ') {
a += scan_char();
}
}
template <std::size_t len>
void scan(std::bitset<len>& a) {
skip_space();
if (idx + len > sz) load();
rrep(i, len) a[i] = (buffer[idx++] != '0');
}
template <typename T, typename std::enable_if<is_int<T>::value && !has_scan<T>::value>::type* = nullptr>
void scan(T& a) {
skip_space();
bool neg = false;
if constexpr (std::is_signed<T>::value || std::is_same_v<T, __int128_t>) {
if (cur() == '-') {
neg = true;
next();
}
}
if (idx + 40 > sz && (idx == sz || ('0' <= buffer[sz - 1] && buffer[sz - 1] <= '9'))) load();
a = 0;
while ('0' <= buffer[idx] && buffer[idx] <= '9') {
a = a * 10 + (buffer[idx++] & 15);
}
if constexpr (std::is_signed<T>::value || std::is_same<T, __int128_t>::value) {
if (neg) a = -a;
}
}
template <typename T, typename std::enable_if<std::is_floating_point<T>::value && !has_scan<T>::value>::type* = nullptr>
void scan(T& a) {
skip_space();
bool neg = false;
if (cur() == '-') {
neg = true;
next();
}
a = 0;
while ('0' <= cur() && cur() <= '9') {
a = a * 10 + (scan_char() & 15);
}
if (cur() == '.') {
next();
T n = 0, d = 1;
for (int i = 0; '0' <= cur() && cur() <= '9' && i < decimal_precision; ++i) {
n = n * 10 + (scan_char() & 15);
d *= 10;
}
while ('0' <= cur() && cur() <= '9') next();
a += n / d;
}
if (neg) a = -a;
}
private:
template <std::size_t i, typename... Args>
void scan(std::tuple<Args...>& a) {
if constexpr (i < sizeof...(Args)) {
scan(std::get<i>(a));
scan<i + 1, Args...>(a);
}
}
public:
template <typename... Args>
void scan(std::tuple<Args...>& a) {
scan<0, Args...>(a);
}
template <typename T, typename U>
void scan(std::pair<T, U>& a) {
scan(a.first);
scan(a.second);
}
template <typename T, typename std::enable_if<is_range<T>::value && !has_scan<T>::value>::type* = nullptr>
void scan(T& a) {
for (auto& i : a) scan(i);
}
template <typename T, typename std::enable_if<has_scan<T>::value>::type* = nullptr>
void scan(T& a) {
a.scan(*this);
}
void operator()() {}
template <typename Head, typename... Tail>
void operator()(Head& head, Tail&... tail) {
scan(head);
operator()(std::forward<Tail&>(tail)...);
}
template <typename T>
Scanner& operator>>(T& a) {
scan(a);
return *this;
}
explicit operator bool() const { return state; }
friend Scanner& getline(Scanner& sc, std::string& a) {
a.clear();
char c;
if ((c = sc.scan_char()) == '\0' || c == '\n') return sc;
a += c;
while ((c = sc.scan_char()) != '\0' && c != '\n') a += c;
return sc;
}
};
Scanner<> sc;
} // namespace fastio
using fastio::sc;
#line 5 "template/out.hpp"
namespace fastio {
struct Pre {
char buffer[10000][4];
constexpr Pre() : buffer() {
for (int i = 0; i < 10000; ++i) {
int n = i;
for (int j = 3; j >= 0; --j) {
buffer[i][j] = n % 10 | '0';
n /= 10;
}
}
}
} constexpr pre;
template <std::size_t BUFF_SIZE = 1 << 17, bool debug = false>
struct Printer {
private:
template <typename, bool = debug, class = void>
struct has_print : std::false_type {};
template <typename T>
struct has_print<T, false, decltype(std::declval<T>().print(std::declval<Printer&>()), (void)0)> : std::true_type {};
template <typename T>
struct has_print<T, true, decltype(std::declval<T>().debug(std::declval<Printer&>()), (void)0)> : std::true_type {};
FILE* file;
char buffer[BUFF_SIZE];
int idx;
std::size_t decimal_precision;
public:
Printer() : Printer((debug ? stderr : stdout)) {}
explicit Printer(FILE* file) : file(file), idx(0), decimal_precision(16) {}
~Printer() {
flush();
if (file != stdout && file != stderr) fclose(file);
}
void set_decimal_precision(std::size_t n) { decimal_precision = n; }
inline void print_char(char c) {
buffer[idx++] = c;
if (idx == BUFF_SIZE) flush();
}
inline void flush() {
idx = fwrite(buffer, 1, idx, file);
idx = 0;
}
void print(char a) {
if constexpr (debug) print_char('\'');
print_char(a);
if constexpr (debug) print_char('\'');
}
void print(bool a) {
if constexpr (debug) print_char('\'');
print_char('0' + a);
if constexpr (debug) print_char('\'');
}
void print(const char* a) {
if constexpr (debug) print_char('\"');
for (; *a != '\0'; ++a) print_char(*a);
if constexpr (debug) print_char('\"');
}
template <std::size_t N>
void print(const char (&a)[N]) {
if constexpr (debug) print_char('\"');
for (auto i : a) print_char(i);
if constexpr (debug) print_char('\"');
}
void print(const std::string& a) {
if constexpr (debug) print_char('\"');
for (auto i : a) print_char(i);
if constexpr (debug) print_char('\"');
}
template <std::size_t len>
void print(const std::bitset<len>& a) {
for (int i = len - 1; i >= 0; --i) print_char('0' + a[i]);
}
template <typename T, typename std::enable_if<is_int<T>::value && !has_print<T>::value>::type* = nullptr>
void print(T a) {
if (!a) {
print_char('0');
return;
}
if constexpr (is_signed_int<T>::value) {
if (a < 0) {
print_char('-');
a = -a;
}
}
if (static_cast<size_t>(idx + 40) >= BUFF_SIZE) flush();
static char stk[40];
int top = 40;
while (a >= 10000) {
int i = a % 10000;
a /= 10000;
top -= 4;
std::memcpy(stk + top, pre.buffer[i], 4);
}
if (a >= 1000) {
std::memcpy(buffer + idx, pre.buffer[a], 4);
idx += 4;
} else if (a >= 100) {
std::memcpy(buffer + idx, pre.buffer[a] + 1, 3);
idx += 3;
} else if (a >= 10) {
std::memcpy(buffer + idx, pre.buffer[a] + 2, 2);
idx += 2;
} else {
buffer[idx++] = '0' | a;
}
std::memcpy(buffer + idx, stk + top, 40 - top);
idx += 40 - top;
}
template <typename T, typename std::enable_if<std::is_floating_point<T>::value && !has_print<T>::value>::type* = nullptr>
void print(T a) {
if (a == infinity<T>::max || a == infinity<T>::value) {
print("inf");
return;
}
if (a == infinity<T>::min || a == infinity<T>::mvalue) {
print("-inf");
return;
}
if (std::isnan(a)) {
print("nan");
return;
}
if (a < 0) {
print_char('-');
a = -a;
}
T b = a;
if (b < 1) {
print_char('0');
} else {
std::string s;
while (b >= 1) {
s += (char)('0' | (int)std::fmod(b, 10.0));
b /= 10;
}
for (auto i = s.rbegin(); i != s.rend(); ++i) {
print_char(*i);
}
}
print_char('.');
for (std::size_t _ = 0; _ < decimal_precision; ++_) {
a *= 10;
print_char('0' | (int)std::fmod(a, 10.0));
}
}
private:
template <std::size_t i, typename... Args>
void print(const std::tuple<Args...>& a) {
if constexpr (i < sizeof...(Args)) {
if constexpr (debug) print_char(',');
print_char(' ');
print(std::get<i>(a));
print<i + 1>(a);
}
}
public:
template <typename... Args>
void print(const std::tuple<Args...>& a) {
if constexpr (debug) print_char('(');
if constexpr (sizeof...(Args) != 0) {
print(std::get<0>(a));
}
print<1, Args...>(a);
if constexpr (debug) print_char(')');
}
template <typename T, typename U>
void print(const std::pair<T, U>& a) {
if constexpr (debug) print_char('(');
print(a.first);
if constexpr (debug) print_char(',');
print_char(' ');
print(a.second);
if constexpr (debug) print_char(')');
}
template <typename T, typename std::enable_if<is_range<T>::value>::type* = nullptr>
void print(const T& a) {
if constexpr (debug) print_char('{');
auto it = std::begin(a);
if (it != std::end(a)) {
print(*it);
while (++it != std::end(a)) {
if constexpr (debug) print_char(',');
print_char(' ');
print(*it);
}
}
if constexpr (debug) print_char('}');
}
template <typename T, typename std::enable_if<has_print<T>::value && !debug>::type* = nullptr>
void print(const T& a) {
a.print(*this);
}
template <typename T, typename std::enable_if<has_print<T>::value && debug>::type* = nullptr>
void print(const T& a) {
a.debug(*this);
}
void operator()() {}
template <typename Head, typename... Tail>
void operator()(const Head& head, const Tail&... tail) {
print(head);
operator()(std::forward<const Tail&>(tail)...);
}
template <typename T>
Printer& operator<<(const T& a) {
print(a);
return *this;
}
Printer& operator<<(Printer& (*f)(Printer&)) {
return f(*this);
}
};
template <std::size_t BUFF_SIZE, bool debug>
Printer<BUFF_SIZE, debug>& endl(Printer<BUFF_SIZE, debug>& out) {
out.print_char('\n');
out.flush();
return out;
}
template <std::size_t BUFF_SIZE, bool debug>
Printer<BUFF_SIZE, debug>& flush(Printer<BUFF_SIZE, debug>& out) {
out.flush();
return out;
}
Printer<> pr;
Printer<1 << 17, true> prd;
} // namespace fastio
using fastio::endl;
using fastio::flush;
using fastio::pr;
using fastio::prd;
#line 3 "template/func.hpp"
#line 7 "template/func.hpp"
inline constexpr int msb(ull x) {
int res = x ? 0 : -1;
if (x & 0xffffffff00000000) x &= 0xffffffff00000000, res += 32;
if (x & 0xffff0000ffff0000) x &= 0xffff0000ffff0000, res += 16;
if (x & 0xff00ff00ff00ff00) x &= 0xff00ff00ff00ff00, res += 8;
if (x & 0xf0f0f0f0f0f0f0f0) x &= 0xf0f0f0f0f0f0f0f0, res += 4;
if (x & 0xcccccccccccccccc) x &= 0xcccccccccccccccc, res += 2;
return res + (x & 0xaaaaaaaaaaaaaaaa ? 1 : 0);
}
inline constexpr int ceil_log2(ull x) { return x ? msb(x - 1) + 1 : 0; }
inline constexpr ull reverse(ull x) {
x = ((x & 0x5555555555555555) << 1) | ((x & 0xaaaaaaaaaaaaaaaa) >> 1);
x = ((x & 0x3333333333333333) << 2) | ((x & 0xcccccccccccccccc) >> 2);
x = ((x & 0x0f0f0f0f0f0f0f0f) << 4) | ((x & 0xf0f0f0f0f0f0f0f0) >> 4);
x = ((x & 0x00ff00ff00ff00ff) << 8) | ((x & 0xff00ff00ff00ff00) >> 8);
x = ((x & 0x0000ffff0000ffff) << 16) | ((x & 0xffff0000ffff0000) >> 16);
return (x << 32) | (x >> 32);
}
inline constexpr ull reverse(ull x, int len) { return reverse(x) >> (64 - len); }
inline constexpr int popcnt(ull x) {
#if __cplusplus >= 202002L
return std::popcount(x);
#endif
x = (x & 0x5555555555555555) + ((x >> 1) & 0x5555555555555555);
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333);
x = (x & 0x0f0f0f0f0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f0f0f0f0f);
x = (x & 0x00ff00ff00ff00ff) + ((x >> 8) & 0x00ff00ff00ff00ff);
x = (x & 0x0000ffff0000ffff) + ((x >> 16) & 0x0000ffff0000ffff);
return (x & 0x00000000ffffffff) + ((x >> 32) & 0x00000000ffffffff);
}
template <typename T, typename U>
inline constexpr bool chmin(T& a, U b) { return a > b && (a = b, true); }
template <typename T, typename U>
inline constexpr bool chmax(T& a, U b) { return a < b && (a = b, true); }
inline constexpr ll gcd(ll a, ll b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
while (b) {
const ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline constexpr bool is_prime(ll n) {
if (n <= 1) return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
inline constexpr ll my_pow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) res *= a;
a *= a;
b >>= 1;
}
return res;
}
inline constexpr ll mod_pow(ll a, ll b, const ll& mod) {
if (mod == 1) return 0;
a %= mod;
ll res = 1;
while (b) {
if (b & 1) (res *= a) %= mod;
(a *= a) %= mod;
b >>= 1;
}
return res;
}
inline ll mod_inv(ll a, const ll& mod) {
ll b = mod, x = 1, u = 0, t;
while (b) {
t = a / b;
std::swap(a -= t * b, b);
std::swap(x -= t * u, u);
}
if (x < 0) x += mod;
return x;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
std::istream& operator>>(std::istream& is, std::pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
for (auto it = std::begin(v); it != std::end(v);) {
os << *it << ((++it) != std::end(v) ? " " : "");
}
return os;
}
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
for (T& in : v) {
is >> in;
}
return is;
}
inline void scan() {}
template <class Head, class... Tail>
inline void scan(Head& head, Tail&... tail) {
sc >> head;
scan(tail...);
}
template <class T>
inline void print(const T& t) { pr << t << '\n'; }
template <class Head, class... Tail>
inline void print(const Head& head, const Tail&... tail) {
pr << head << ' ';
print(tail...);
}
template <class... T>
inline void fin(const T&... a) {
print(a...);
exit(0);
}
template <typename T>
inline void dump(const T& a) { prd << a; }
inline void trace() { prd << endl; }
template <typename Head, typename... Tail>
inline void trace(const Head& head, const Tail&... tail) {
dump(head);
if (sizeof...(tail)) prd.print_char(','), prd.print_char(' ');
trace(tail...);
}
#ifdef ONLINE_JUDGE
#define dbg(...) (void(0))
#else
#define dbg(...) \
do { \
prd << #__VA_ARGS__; \
prd.print_char(' '), prd.print_char('='), prd.print_char(' '); \
trace(__VA_ARGS__); \
} while (0)
#endif
#line 3 "template/util.hpp"
#line 6 "template/util.hpp"
template <typename F>
struct REC {
private:
F f;
public:
explicit constexpr REC(F&& f_) : f(std::forward<F>(f_)) {}
template <typename... Args>
constexpr auto operator()(Args&&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
template <typename T, typename Comp = std::less<T>>
struct compressor {
private:
std::vector<T> data;
Comp cmp;
bool sorted = false;
public:
compressor() : compressor(Comp()) {}
compressor(const Comp& cmp) : cmp(cmp) {}
compressor(const std::vector<T>& dat, const Comp& cmp = Comp()) : data(dat), cmp(cmp) {}
compressor(std::vector<T>&& dat, const Comp& cmp = Comp()) : data(std::move(dat)), cmp(cmp) {}
compressor(std::initializer_list<T> li, const Comp& cmp = Comp()) : data(li.begin(), li.end()), cmp(cmp) {}
void push_back(const T& v) {
assert(!sorted);
data.push_back(v);
}
void push_back(T&& v) {
assert(!sorted);
data.push_back(std::move(v));
}
template <typename... Args>
void emplace_back(Args&&... args) {
assert(!sorted);
data.emplace_back(std::forward<Args>(args)...);
}
void push(const std::vector<T>& v) {
assert(!sorted);
const int n = data.size();
data.resize(v.size() + n);
for (int i = 0; i < (int)v.size(); i++) data[i + n] = v[i];
}
void build() {
assert(!sorted);
sorted = 1;
std::sort(data.begin(), data.end(), cmp);
data.erase(unique(data.begin(), data.end(), [&](const T& l, const T& r) -> bool { return !cmp(l, r) && !cmp(r, l); }), data.end());
}
const T& operator[](int k) const& {
assert(sorted);
return data[k];
}
int get_index(const T& v) const {
assert(sorted);
return int(lower_bound(data.begin(), data.end(), v, cmp) - data.begin());
}
void press(std::vector<T>& v) const {
assert(sorted);
for (auto&& i : v) i = get_index(i);
}
std::vector<int> pressed(const std::vector<T>& v) const {
assert(sorted);
std::vector<int> ret(v.size());
for (int i = 0; i < (int)v.size(); i++) ret[i] = get_index(v[i]);
return ret;
}
int size() const {
assert(sorted);
return data.size();
}
};
#line 11 "template/template.hpp"
using namespace std;
#line 3 "geometry/geometry.hpp"
namespace geometry {
const long double eps = 1e-9;
const long double pi = acos(-1.0);
bool equals(long double a, long double b) { return fabs(a - b) < eps; }
long double torad(long double deg) { return deg * pi / 180.0; }
long double todeg(long double rad) { return rad * 180.0 / pi; }
int sign(long double a) { return (a > eps ? 1 : (a < -eps ? -1 : 0)); }
struct point {
long double x, y;
point(long double x = 0.0, long double y = 0.0) : x(x), y(y) {}
point operator-() const { return point(-x, -y); }
point operator+(const point& p) const { return point(x + p.x, y + p.y); }
point operator-(const point& p) const { return point(x - p.x, y - p.y); }
point operator*(const long double& k) const { return point(x * k, y * k); }
point operator/(const long double& k) const { return point(x / k, y / k); }
point operator*(const point& p) const { return point(x * p.x - y * p.y, x * p.y + y * p.x); }
point operator/(const point& p) const { return point((x * p.x + y * p.y) / p.norm(), (x * p.y - y * p.x) / p.norm()); }
point& operator*=(const long double& k) {
x *= k;
y *= k;
return *this;
}
point& operator/=(const long double& k) {
x /= k;
y /= k;
return *this;
}
point& operator+=(const point& p) {
x += p.x;
y += p.y;
return *this;
}
point& operator-=(const point& p) {
x -= p.x;
y -= p.y;
return *this;
}
bool operator==(const point& p) { return equals(x, p.x) && equals(y, p.y); }
long double abs() const { return sqrt(norm()); }
long double norm() const { return x * x + y * y; }
static point polar(long double r, long double theta) { return point(r * cos(theta), r * sin(theta)); }
template <typename Sc>
void scan(Sc& a) {
a.scan(this->x);
a.scan(this->y);
}
template <typename Pr>
void print(Pr& out) const {
out.print(this->x);
out.print(" ");
out.print(this->y);
}
template <typename Pr>
void debug(Pr& out) const {
out.print(this->x);
out.print(" ");
out.print(this->y);
}
};
struct segment {
point s, t;
segment(point s = 0, point t = 0) : s(s), t(t) {}
};
struct line {
point s, t;
line(point s = 0, point t = 0) : s(s), t(t) {}
};
struct circle {
point c;
long double r;
circle(point c = 0, long double r = 0) : c(c), r(r) {}
};
struct polygon {
int n;
vector<point> ps;
polygon(int n = 0) : n(n), ps(n) {}
polygon(vector<point> ps) : n(ps.size()), ps(ps) {}
point& operator[](int i) { return ps[i]; }
};
long double cross(point a, point b) { return a.x * b.y - a.y * b.x; }
long double dot(point a, point b) { return a.x * b.x + a.y * b.y; }
point rotate(point p, long double theta, point o = point(0, 0)) {
point pp = p - o;
point res(pp.x * cos(theta) - pp.y * sin(theta), pp.x * sin(theta) + pp.y * cos(theta));
return res + o;
}
int ccw(point a, point b, point c) {
b -= a, c -= a;
if (cross(b, c) > eps) return 1;
if (cross(b, c) < -eps) return -1;
if (dot(b, c) < 0) return 2;
if (b.norm() < c.norm()) return -2;
return 0;
}
bool intersect(point a, line l) { return abs(ccw(l.s, a, l.t)) != 1; }
int line_place(line l, line m) {
if (intersect(m.s, l) && intersect(m.t, l))
return 1;
else if (intersect(0, line(l.t - l.s, m.t - m.s)))
return 2;
else if (sign(dot(l.t - l.s, m.t - m.s)) == 0)
return 3;
return 0;
}
bool intersect(line l, line m) { return line_place(l, m) != 1 && line_place(l, m) != 2; }
bool intersect(line l, segment s) {
s.s -= l.s, s.t -= l.s;
l.t -= l.s, l.s -= l.s;
return sign(cross(l.t, s.s) * cross(l.t, s.t)) != 1;
}
bool intersect(segment s, segment t) { return (ccw(s.s, s.t, t.s) * ccw(s.s, s.t, t.t) <= 0 && ccw(t.s, t.t, s.s) * ccw(t.s, t.t, s.t) <= 0); }
bool intersect(point a, segment s) { return ccw(s.s, s.t, a) == 0; }
bool intersect(line l, point a) { return intersect(a, l); }
bool intersect(segment s, point a) { return intersect(a, s); }
bool intersect(segment s, line l) { return intersect(l, s); }
point project(line l, point p) {
point a = l.t - l.s, b = p - l.s;
return l.s + a * (dot(a, b) / a.norm());
}
point project(point p, line l) { return project(l, p); }
point reflect(line l, point p) { return project(l, p) * 2 - p; }
point reflect(point p, line l) { return reflect(l, p); }
long double dist(point p, point q) { return (p - q).abs(); }
long double dist(line l, point p) { return dist(p, project(l, p)); }
long double dist(point p, line l) { return dist(p, project(l, p)); }
long double dist(line l, line m) {
if (line_place(l, m) != 2) return 0;
return dist(l, m.s);
}
long double dist(line l, segment s) {
if (intersect(l, s)) return 0;
return min(dist(l, s.s), dist(l, s.t));
}
long double dist(segment s, line l) { return dist(l, s); }
long double dist(segment s, point p) {
point q = project(line(s.s, s.t), p);
if (intersect(s, q))
return (p - q).abs();
else
return min((s.s - p).abs(), (s.t - p).abs());
}
long double dist(point p, segment s) { return dist(s, p); }
long double dist(segment s, segment t) {
if (intersect(s, t)) return 0;
return min(min(dist(s, t.s), dist(s, t.t)), min(dist(t, s.s), dist(t, s.t)));
}
point crosspoint(line l, line m) {
long double a = cross(m.t - m.s, m.s - l.s);
long double b = cross(m.t - m.s, l.t - l.s);
if (sign(a) == 0 && sign(b) == 0)
return l.s;
else if (sign(b) == 0)
throw "no crosspoint";
return l.s + (l.t - l.s) * (a / b);
}
long double dist(circle c, point p, bool inside_zero = 0) {
if (inside_zero) return max(dist(c.c, p) - c.r, (long double)0.0);
return max(abs(dist(c.c, p) - c.r), (long double)0.0);
}
long double dist(circle c, line l) { return max(dist(l, c.c) - c.r, (long double)0.0); }
long double dist(circle c, segment s, bool inside_zero = 0) {
long double sqr1 = (s.s - c.c).norm(), sqr2 = (s.t - c.c).norm();
if (inside_zero == 0) {
if ((sqr1 < c.r * c.r) ^ (sqr2 < c.r * c.r))
return 0;
else if (sqr1 < c.r && sqr2 < c.r)
return c.r - sqrt(max(sqr1, sqr2));
return max(dist(s, c.c) - c.r, (long double)0.0);
} else {
if (sqr1 < c.r * c.r || sqr2 < c.r * c.r) return 0;
return max(dist(s, c.c) - c.r, (long double)0.0);
}
}
long double dist(circle c, circle d) {
long double dir = (c.c - d.c).abs();
return sign(dir - abs(c.r - d.r)) == 1 ? max(dir - c.r - d.r, (long double)0.0) : abs(c.r - d.r) - dir;
}
long double dist(point p, circle c, bool inside_zero = 0) { return dist(c, p, inside_zero); }
long double dist(line l, circle c) { return dist(c, l); }
long double dist(segment s, circle c, bool inside_zero = 0) { return dist(c, s, inside_zero); }
bool intersect(circle c, point p) { return sign(dist(c, p)) == 0; }
bool intersect(circle c, line l) { return sign(dist(c, l)) == 0; }
bool intersect(circle c, segment s) { return sign(dist(c, s)) == 0; }
bool intersect(circle c, circle d) { return sign(dist(c, d)) == 0; }
bool intersect(point p, circle c) { return intersect(c, p); }
bool intersect(line l, circle c) { return intersect(c, l); }
bool intersect(segment s, circle c) { return intersect(c, s); }
vector<point> crosspoint(circle c, circle d) {
vector<point> ret;
if (sign(dist(c, d)) != 0) return ret;
point cd = d.c - c.c;
long double di = cd.abs();
long double x = (cd.norm() - d.r * d.r + c.r * c.r) / ((long double)2.0 * di);
point inter = c.c + cd * (x / di);
point rev = cd * point(0, sqrt(c.r * c.r - x * x) / di);
ret.push_back(inter + rev);
if (sign(rev.norm()) == 0) ret.push_back(inter - rev);
return ret;
}
vector<point> tangentpoint(circle c, point p) {
vector<point> ret;
long double sin = c.r / (p - c.c).abs();
if (sign(sin - 1.0) == 0) return ret;
long double theta = pi / 2.0 - asin(min(sin, (long double)1.0));
ret.push_back(c.c + (p - c.c) * point::polar(sin, theta));
if (sign(sin - (long double)1.0) != 0) ret.push_back(c.c + (p - c.c) * point::polar(sin, -theta));
return ret;
}
point circumcenter(polygon pol) {
assert(pol.n == 3);
pol[0] = (pol[0] - pol[2]) / 2.0;
pol[1] = (pol[1] - pol[2]) / 2.0;
return pol[2] + crosspoint(line(pol[0], pol[0] * point(1, 1)), line(pol[1], pol[1] * point(1, 1)));
}
point circumcenter(point a, point b, point c) {
return circumcenter(polygon(vector<point>{a, b, c}));
}
point center_of_gravity(polygon pol) {
assert(pol.n == 3);
return (pol[0] + pol[1] + pol[2]) / 3.0;
}
point center_of_gravity(point p1, point p2, point p3) {
return center_of_gravity(polygon(vector<point>{p1, p2, p3}));
}
point innercenter(polygon pol) {
assert(pol.n == 3);
long double a = dist(pol[0], pol[1]), b = dist(pol[1], pol[2]), c = dist(pol[2], pol[0]);
return (pol[0] * a + pol[1] * b + pol[2] * c) / (a + b + c);
}
point innercenter(point p1, point p2, point p3) {
return innercenter(polygon(vector<point>{p1, p2, p3}));
}
point orthocenter(polygon pol) {
assert(pol.n == 3);
return pol[0] + pol[2] + pol[3] - center_of_gravity(pol) * 2.0;
}
point orthocenter(point p1, point p2, point p3) {
return orthocenter(polygon(vector<point>{p1, p2, p3}));
}
long double area(polygon& pol) {
long double ret = 0;
for (int i = 0; i < pol.n; i++) ret += cross(pol[i], pol[(i + 1) % pol.n]);
return ret / 2.0;
}
bool is_convex(polygon& pol) {
int neg = 0, pos = 0;
for (int i = 0; i < pol.n; i++) {
int dir = ccw(pol[i], pol[(i + 1) % pol.n], pol[(i + 2) % pol.n]);
if (dir == 1)
pos++;
else if (dir == -1)
neg++;
}
if (pos && neg) return 0;
return 1;
}
int in_polygon(point p, polygon& pol) {
int n = pol.n;
bool in = false;
for (int i = 0; i < n; i++) {
point a = pol[i], b = pol[(i + 1) % n];
if (intersect(p, segment(a, b))) return 2;
if (intersect(segment(p, point(p.x + 1.0, INT_MAX)), segment(a, b))) in = !in;
}
return in;
}
} // namespace geometry
#line 4 "test/aoj/CGL/CGL_2_B.test.cpp"
int main() {
INT(q);
while (q--) {
geometry::point p1, p2, q1, q2;
sc >> p1 >> p2 >> q1 >> q2;
geometry::segment a(p1, p2), b(q1, q2);
print(geometry::intersect(a, b));
}
}
Test cases
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | 00_small_00.in |
AC |
6 ms | 3 MB |
| g++ | 00_small_01.in |
AC |
6 ms | 3 MB |
| g++ | 00_small_02.in |
AC |
6 ms | 3 MB |
| g++ | 00_small_03.in |
AC |
5 ms | 3 MB |
| g++ | 01_online_00.in |
AC |
5 ms | 3 MB |
| g++ | 01_online_01.in |
AC |
6 ms | 3 MB |
| g++ | 02_parallel_00.in |
AC |
6 ms | 3 MB |
| g++ | 02_parallel_01.in |
AC |
5 ms | 3 MB |
| g++ | 03_horizontal_00.in |
AC |
6 ms | 4 MB |
| g++ | 03_horizontal_01.in |
AC |
5 ms | 3 MB |
| g++ | 04_vertical_00.in |
AC |
5 ms | 4 MB |
| g++ | 04_vertical_01.in |
AC |
6 ms | 3 MB |
| g++ | 05_rand_00.in |
AC |
6 ms | 4 MB |
| g++ | 05_rand_01.in |
AC |
5 ms | 3 MB |
| g++ | 05_rand_02.in |
AC |
6 ms | 4 MB |
| g++ | 05_rand_03.in |
AC |
6 ms | 4 MB |
| g++ | 06_rand_00.in |
AC |
6 ms | 4 MB |
| g++ | 06_rand_01.in |
AC |
6 ms | 4 MB |
| g++ | 06_rand_02.in |
AC |
6 ms | 4 MB |
| g++ | 06_rand_03.in |
AC |
6 ms | 4 MB |