結果
| 問題 | No.2628 Shrinkage |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2024-02-16 22:54:10 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,076 bytes |
| コンパイル時間 | 3,729 ms |
| コンパイル使用メモリ | 258,324 KB |
| 最終ジャッジ日時 | 2025-02-19 14:36:47 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 1 WA * 27 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) (a).begin(), (a).end()#define Sort(a) (sort((a).begin(), (a).end()))#define RSort(a) (sort((a).rbegin(), (a).rend()))#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr<< (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }namespace Geometry{using T = long long;inline constexpr int type(T x, T y){if(!x && !y) return 0;if(y < 0 || (y == 0 && x > 0)) return -1;return 1;}T abs(T x){if(x < 0) return -x;return x;}struct Point{T x, y;Point(T X = 0, T Y = 0) : x(X), y(Y){}inline bool operator==(const Point &other) const {return ((x == other.x) && (y == other.y));}inline bool operator!=(const Point &other) const {return ((x != other.x) || (y != other.y));}inline bool operator<(const Point &other) const {int L = type(x, y), R = type(other.x, other.y);if(L != R) return L < R;if(x * other.y == other.x * y) return abs(x + y) < abs(other.x + other.y);return x * other.y > other.x * y;}inline bool operator>(const Point &other) const {int L = type(x, y), R = type(other.x, other.y);if(L != R) return L > R;if(x * other.y == other.x * y) return abs(x + y) > abs(other.x + other.y);return x * other.y < other.x * y;}inline Point operator+() const noexcept { return *this; }inline Point operator-() const noexcept { return Point(-x, -y); }inline Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }inline Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }inline Point &operator+=(const Point &p) { return x += p.x, y += p.y, *this; }inline Point &operator-=(const Point &p) { return x -= p.x, y -= p.y, *this; }inline T operator*(const Point &p) const { return x * p.x + y * p.y; }inline Point &operator*=(const T &k) { return x *= k, y *= k, *this; }inline Point operator*(const T &k) { return (*this *= k); }// floorinline Point &operator/=(const T &k) { return x /= k, y /= k, *this; }inline Point operator/(const T &k) { return (*this /= k); }// friend inline ostream& operator<<(ostream& os, const Point& p) noexcept { return os << p.x << " " << p.y; }};bool angle_equal(const Point &p, const Point &q){int L = type(p.x, p.y), R = type(q.x, q.y);if(L != R) return false;return p.x * q.y == q.x * p.y;}T cross(const Point &p, const Point &q){return p.x * q.y - p.y * q.x;}T dot(const Point &p, const Point &q){return p.x * q.x + p.y * q.y;}// 2乗T dist(const Point &p, const Point &q){return (p.x - q.x) * (p.x - q.x) + (p.y - q.y) * (p.y - q.y);}// 2倍T polygonArea(const vector<Point> &points){const int n = points.size();T res = 0;for(int i = 0; i < n - 1; i++){res += cross(points[i], points[i + 1]);}res += cross(points[n - 1], points[0]);return res;}vector<Point> convexHull(vector<Point> points){const int n = points.size();if(n <= 2){return points;}vector<Point> U, L, res;sort(points.begin(), points.end(), [](Point p, Point q){return (p.x == q.x ? p.x < q.x : p.y < q.y);});// lowerfor(int i = 0; i < n; i++){int j = L.size();// 傾きで左回りかをチェックwhile(j >= 2 && cross(L[j - 1] - L[j - 2], points[i] - L[j - 2]) <= 0){L.pop_back();j--;}L.push_back(points[i]);}// upperfor(int i = n - 1; i >= 0; i--){int j = U.size();while(j >= 2 && cross(U[j - 1] - U[j - 2], points[i] - U[j - 2]) <= 0){U.pop_back();j--;}U.push_back(points[i]);}res = L;for(int i = 1; i < (int) U.size() - 1; i++){res.push_back(U[i]);}return res;}// 点が領域外部: 0, 内部: 1, 境界上: 2int inCcwConvex(Point p, const vector<Point> &points) {const int n = points.size();T cr1 = cross(points[1] - points[0], p - points[0]);T cr2 = cross(points[n - 1] - points[0], p - points[0]);if(cr1 < 0 || 0 < cr2){return 0;}int l = 1, r = n - 1;while(abs(r - l) > 1){int mid = (l + r) / 2;if(cross(p - points[0], points[mid] - points[0]) >= 0){r = mid;}else{l = mid;}}T cr = cross(points[l] - p, points[r] - p);if(cr == 0){return 2;}else if(cr > 0){if(cr1 == 0 || cr2 == 0){return 2;}else{return 1;}}else{return 0;}}}using namespace Geometry;ll t;void input(){in(t);}// https://qiita.com/zu_rin/items/e04fdec4e3dec6072104int Judge(Point &a, Point &b, Point &c, Point &d) {__int128_t s, t;s = (a.x - b.x) * (c.y - a.y) - (a.y - b.y) * (c.x - a.x);t = (a.x - b.x) * (d.y - a.y) - (a.y - b.y) * (d.x - a.x);if (s * t > 0)return false;s = (c.x - d.x) * (a.y - c.y) - (c.y - d.y) * (a.x - c.x);t = (c.x - d.x) * (b.y - c.y) - (c.y - d.y) * (b.x - c.x);if (s * t > 0)return false;return true;}void solve(){Point a, b, c, d;in(a.x, a.y, c.x, c.y);in(b.x, b.y, d.x, d.y);if(dist(b, d) >= dist(a, c)){out("No");return;}Point d1 = b - a, d2 = d - c;Point e = b + (d1 * 100000000LL), f = d + (d2 * 1000000000LL);if(Judge(b, e, d, f)){out("Yes");}else{out("No");}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();while(t--) solve();}