# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516472 | KoD | Geometrija (COCI21_geometrija) | C++17 | 119 ms | 8272 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 <bits/stdc++.h>
using std::vector;
using std::array;
using std::pair;
using std::tuple;
using i64 = std::int64_t;
struct Point {
int x, y;
Point(int x = 0, int y = 0) : x(x), y(y) {}
int belongs() const {
if (x >= 0 and y >= 0) return 0;
if (x < 0 and y > 0) return 0;
return 1;
}
friend Point operator+(const Point& p, const Point& q) {
return Point(p.x + q.x, p.y + q.y);
}
friend Point operator-(const Point& p, const Point& q) {
return Point(p.x - q.x, p.y - q.y);
}
friend i64 cross(const Point& p, const Point& q) {
return (i64)p.x * q.y - (i64)p.y * q.x;
}
};
int main() {
std::ios_base::sync_with_stdio(false);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |