# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894234 | box | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 36 ms | 5464 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 namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define ar array
#define all(v) begin(v), end(v)
#define sz(v) static_cast<int>(v.size())
typedef vector<int> vi;
typedef long long ll;
struct Point {
ll x, y;
bool operator<(const Point& p) const {
return x < p.x || (x == p.x && y < p.y);
}
bool operator==(const Point& p) const { return (x == p.x && y == p.y); }
Point operator-(const Point& p) const { return {x - p.x, y - p.y}; }
friend ll abs(const Point& a) { return a.x * a.x + a.y * a.y; }
friend ll cross(const Point& a, const Point& b) {
return a.x * b.y - a.y * b.x;
}
friend ll cross(const Point& p, const Point& a, const Point& b) {
return cross(a - p, b - p);
}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |