# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26654 | kajebiii | Bulldozer (JOI17_bulldozer) | C++14 | 799 ms | 49920 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 <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
const int MAX_N = 2e3 + 100;
int sign(ll x) {return (x>0) - (x<0); }
struct PT {
int x, y, c;
PT() {}
PT(int xx, int yy, int cc) : x(xx), y(yy), c(cc) {}
PT operator-(const PT &o) const {return PT(x-o.x, y-o.y, 0); }
ll cross(const PT &o) const{return 1ll * x * o.y - 1ll * y * o.x;}
ll dot(const PT &o) const {return 1ll * x * o.x + 1ll * y * o.y;}
int ccw(const PT &o) const {return sign(cross(o));}
bool operator<(const PT &o) const {
if(y != o.y) return y < o.y;
return x < o.x;
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... |