# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26557 | gs14004 | Bulldozer (JOI17_bulldozer) | C++14 | 593 ms | 33492 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 lint;
typedef pair<int, int> pi;
struct sweep{
int dx, dy, idx1, idx2;
int mode(){
return pi(dx, dy) < pi(0, 0);
}
bool operator<(const sweep &s)const{
lint k = 1ll * dx * s.dy - 1ll * dy * s.dx;
if(k != 0) return k > 0;
return pi(idx1, idx2) < pi(s.idx1, s.idx2);
}
};
lint ccw(sweep a, sweep b){
return 1ll * a.dx * b.dy - 1ll * b.dx * a.dy;
}
struct point{
int x, y, c;
bool operator<(const point &p)const{
return pi(x, y) < pi(p.x, p.y);
}
}a[2005];
struct seg{
struct node{
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... |