# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1152405 | dzuizz | Geometrija (COCI21_geometrija) | C++20 | 1093 ms | 25200 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define Point pair<int,int>
#define x first
#define y second
struct Line {
Point p,q;
Line(int a=0, int b=0, int c=0, int d=0){
p=Point(a,b);
q=Point(c,d);
}
};
int cross(Point A, Point B, Point C){
int xAB=B.x-A.x, yAB=B.y-A.y;
int xAC=C.x-A.x, yAC=C.y-A.y;
int res=xAB*yAC-xAC*yAB;
if(res<0) return -1;
if(res==0) return 0;
return 1;
}
int isIntersect(Line A, Line B) {
return cross(A.p,A.q,B.p) != cross(A.p,A.q,B.q) && cross(B.p,B.q,A.p) != cross(B.p,B.q,A.q);
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin>>n;
Point a[n];
for(int i=0;i<n;++i) cin>>a[i].x>>a[i].y;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |