# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379809 | pit4h | Dragon 2 (JOI17_dragon2) | C++14 | 858 ms | 36044 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>
#define st first
#define nd second
#define mp make_pair
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MAXN = 3e4+1, MAXQ = 1e5+1;
int n, m, t[MAXN], q, ans[MAXQ];
int sgn(ll x) {
return (x>=0)?x? 1: 0: -1;
}
struct Point {
ll x, y;
int id;
Point() {}
Point(ll _x, ll _y): x(_x), y(_y) {}
void read() { cin>>x>>y; }
Point operator-(const Point& o) const { return Point(x-o.x, y-o.y); }
bool operator<(const Point& o) const { return make_pair(x, y) < make_pair(o.x, o.y); }
ll cross(const Point& o) {
return (ll)x*o.y - (ll)y*o.x;
}
ll cross(const Point& o1, const Point& o2) {
return (o1 - *this).cross(o2 - *this);
}
};
Point O1, O2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |