| Task: | Line Segment Intersection |
| Sender: | aalto26jh_003 |
| Submission time: | 2026-11-10 19:13:23 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.31 s | details |
| #2 | ACCEPTED | 0.37 s | details |
| #3 | ACCEPTED | 0.47 s | details |
| #4 | ACCEPTED | 0.56 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>
#include <vector>
using namespace std;
long long crossproduct(pair<long long, long long> a, pair<long long, long long> b, pair<long long, long long> c) {
long long res = (b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first);
return res;
}
bool on_segment(pair<long long, long long> P, pair<long long, long long> Q, pair<long long, long long> R) {
return Q.first >= min(P.first, R.first) && Q.first <= max(P.first, R.first) && Q.second >= min(P.second, R.second) && Q.second <= max(P.second, R.second);
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
long long a1x, a1y, b1x, b1y;
long long a2x, a2y, b2x, b2y;
cin >> a1x >> a1y >> b1x >> b1y >> a2x >> a2y >> b2x >> b2y;
pair<long long, long long> A = {a1x, a1y}, B = {b1x, b1y};
pair<long long, long long> C = {a2x, a2y}, D = {b2x, b2y};
// Crossproduct
long long cp1 = crossproduct(A, B, C);
long long cp2 = crossproduct(A, B, D);
long long cp3 = crossproduct(C, D, A);
long long cp4 = crossproduct(C, D, B);
int s1 = (cp1 > 0) - (cp1 < 0);
int s2 = (cp2 > 0) - (cp2 < 0);
int s3 = (cp3 > 0) - (cp3 < 0);
int s4 = (cp4 > 0) - (cp4 < 0);
// Points on different sides
if (s1 != s2 && s3 != s4)
{
cout << "YES\n";
}
// Line on segment
else if (s1 == 0 && on_segment(A, C, B)) cout << "YES\n";
else if (s2 == 0 && on_segment(A, D, B)) cout << "YES\n";
else if (s3 == 0 && on_segment(C, A, D)) cout << "YES\n";
else if (s4 == 0 && on_segment(C, B, D)) cout << "YES\n";
else
{
cout << "NO\n";
}
}
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 |
