| Task: | Line Segment Intersection |
| Sender: | aalto26jh_008 |
| Submission time: | 2026-11-11 15:45:20 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.08 s | details |
| #2 | ACCEPTED | 0.08 s | details |
| #3 | ACCEPTED | 0.10 s | details |
| #4 | ACCEPTED | 0.12 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>
#include <algorithm>
using namespace std;
struct Point {
long long x, y;
};
long long cross_product(Point p, Point q, Point r) {
return (q.x - p.x) * (r.y - p.y) - (q.y - p.y) * (r.x - p.x);
}
int sign(long long val) {
if (val > 0) return 1;
if (val < 0) return -1;
return 0;
}
bool on_segment(Point p, Point q, Point r) {
return r.x >= min(p.x, q.x) && r.x <= max(p.x, q.x) &&
r.y >= min(p.y, q.y) && r.y <= max(p.y, q.y);
}
void solve() {
Point a, b, c, d;
cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y;
int cp1 = sign(cross_product(a, b, c));
int cp2 = sign(cross_product(a, b, d));
int cp3 = sign(cross_product(c, d, a));
int cp4 = sign(cross_product(c, d, b));
if (((cp1 > 0 && cp2 < 0) || (cp1 < 0 && cp2 > 0)) &&
((cp3 > 0 && cp4 < 0) || (cp3 < 0 && cp4 > 0)))
{
cout << "YES\n";
return;
}
if (cp1 == 0 && on_segment(a, b, c)) { cout << "YES\n"; return; }
if (cp2 == 0 && on_segment(a, b, d)) { cout << "YES\n"; return; }
if (cp3 == 0 && on_segment(c, d, a)) { cout << "YES\n"; return; }
if (cp4 == 0 && on_segment(c, d, b)) { cout << "YES\n"; return; }
cout << "NO\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
if (cin >> t) {
while (t--) {
solve();
}
}
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 100000 9 7 1 8 8 -5 0 2 10 1 -1 2 -4 1 -7 3 10 2 -8 6 1 2 2 -1 -10 1 9 -7 4 -3 -5 0 ... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| NO NO NO NO NO ... |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 100000 81 745 -967 768 -451 -490 -454... |
| correct output |
|---|
| NO NO YES NO YES ... |
| user output |
|---|
| NO NO YES NO YES ... |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 100000 492853 -452834 -657156 -282543... |
| correct output |
|---|
| YES YES NO YES YES ... |
| user output |
|---|
| YES YES NO YES YES ... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 100000 788522666 939776556 -831492125... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| NO NO NO NO NO ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 1 1 6 6 6 4 4 1000000000 1000000... |
| correct output |
|---|
| YES |
| user output |
|---|
| YES |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 1 -1000000000 1000000000 9999999... |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
