# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44588 | choikiwon | Bulldozer (JOI17_bulldozer) | C++17 | 1393 ms | 33484 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;
typedef long long ll;
typedef pair<int, int> pii;
ll cross(pii a, pii b) {
return 1LL * a.first * b.second - 1LL * a.second * b.first;
}
int N;
struct Point {
int x, y, w;
bool operator <(const Point &i) const {
return y < i.y || (y == i.y && x < i.x);
}
};
Point P[2010];
int pnt[2010];
vector<pair<pii, pii> > line;
ll ans;
bool cmp(pair<pii, pii> a, pair<pii, pii> b) {
if(cross(a.first, b.first) != 0) return cross(a.first, b.first) > 0;
return a.second < b.second;
}
struct node {
int len;
ll sum, mx, lmx, rmx;
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... |