# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232924 | pedy4000 | Svjetlost (COI18_svjetlost) | C++14 | 3074 ms | 26240 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> point;
#define X first
#define Y second
point operator- (point a, point b) {
return point(a.X - b.X, a.Y - b.Y);
}
ll operator* (point a, point b) {
return a.X * b.Y - a.Y * b.X;
}
bool intersect (point a, point b, point c, point d) {
point v = b - a, u = c - d;
if (u * v == 0)
return false;
if (0 < (u * v))
return (u * v) <= ((a - d) * v);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |