CSES - Aalto Competitive Programming 2024 - wk10 - Homework - Results
Submission details
Task:Line Segment Intersection
Sender:snude
Submission time:2024-11-08 13:10:49 +0200
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#10.07 sdetails
#20.09 sdetails
#3ACCEPTED0.11 sdetails
#4ACCEPTED0.13 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()
// Debug printing
#ifdef DEBUG
#define deb(fmt, args...) printf("DEBUG: %d: " fmt, __LINE__, ##args)
#define debug_print(fmt, args...) printf(fmt, ##args)
#else
#define deb(fmt, args...)
#define debug_print(fmt, args...)
#endif
void print_array(vector<int> in, const string title = "Vector")
{
debug_print("DEBUG: %s [\nDEBUG: ", title.c_str());
for (unsigned int i = 0; i < in.size(); i++) {
debug_print("%d ", in[i]);
}
debug_print("\nDEBUG: ] END\n");
}
void print_matrix(vector<vector<int> > in, const string title = "Matrix")
{
debug_print("DEBUG: %s [\nDEBUG: ", title.c_str());
for (unsigned int i = 0; i < in.size(); i++) {
for (unsigned int j = 0; j < in[i].size(); j++) {
debug_print("%d ", in[i][j]);
}
debug_print("\nDEBUG: ");
}
debug_print("DEBUG: ] END\n");
}
int main(int argc, char *argv[])
{
ios::sync_with_stdio(0);
cin.tie(0);
// Read the input parameters
int n;
cin >> n;
double err = 0.000000001;
for (int i = 0; i < n; i++) {
int x1, y1, x2, y2;
int x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
P a = {x1, y1};
// P b = {x2, y2};
P c = {x3, y3};
P d = {x4, y4};
// Same endpoints
if (a == c or a == d) {
cout << "YES\n";
continue;
}
double k = 1.0 * (y2 - y1) / (x2 - x1);
double k2 = 1.0 * (y4 - y3) / (x4 - x3);
// Same slopes, check if they overlap
if (abs(k - k2) <= err) {
int l = max(min(x1, x2), min(x3, x4));
int r = min(max(x1, x2), max(x3, x4));
double x = (y3 + k * x1 - y1) / k;
if (x >= l && x <= r) {
cout << "YES\n";
continue;
}
}
// Check if there is intersection
double top = (-k * x1) + y1 + (k2 * x3) - y3;
double x = top / (k2 - k);
int l = max(min(x1, x2), min(x3, x4));
int r = min(max(x1, x2), max(x3, x4));
if (x >= l && x <= r) {
cout << "YES\n";
continue;
}
cout << "NO\n";
}
}

Test details

Test 1

Verdict:

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
...
Truncated

Test 2

Verdict:

input
100000
81 745 -967 768 -451 -490 -454...

correct output
NO
NO
YES
NO
YES
...

user output
NO
NO
YES
NO
YES
...
Truncated

Test 3

Verdict: ACCEPTED

input
100000
492853 -452834 -657156 -282543...

correct output
YES
YES
NO
YES
YES
...

user output
YES
YES
NO
YES
YES
...
Truncated

Test 4

Verdict: ACCEPTED

input
100000
788522666 939776556 -831492125...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...
Truncated

Test 5

Verdict: ACCEPTED

input
1
1 6 6 6 4 4 1000000000 1000000...

correct output
YES

user output
YES

Test 6

Verdict:

input
1
-1000000000 1000000000 9999999...

correct output
NO

user output
YES