# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224725 | Bruteforceman | Bulldozer (JOI17_bulldozer) | C++11 | 2103 ms | 202092 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;
using pii = pair <int, int>;
const int maxn = 2005;
struct point {
long long x, y, w;
point () {}
point (long long x, long long y) : x(x), y(y) {}
point operator - (point p) {
return point(x - p.x, y - p.y);
}
point operator + (point p) {
return point(x + p.x, y + p.y);
}
point normalize() {
long long d = __gcd(abs(x), abs(y));
if(d == 0) return *this;
else return point(x / d, y / d);
}
} a[maxn];
long long dot(point p, point q) { return p.x*q.x + p.y*q.y; }
long long cross(point p, point q) { return p.x*q.y - q.x*p.y; }
bool operator < (point p, point q) {
return cross(p, q) > 0;
}
long long dist(point p) { return dot(p, p); }
bool vis[maxn];
int n;
int cost[maxn];
# | 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... |