# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152479 | arnold518 | Organizing the Best Squad (FXCUP4_squad) | C++17 | 1381 ms | 87764 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 "squad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3e5;
const ll INF = numeric_limits<ll>::max();
int N;
vector<int> A, D, P;
struct Point
{
ll x, y; int num;
bool operator == (const Point &p) { return p.x==x && p.y==y; }
};
Point operator - (const Point& p, const Point& q) { return { p.x-q.x, p.y-q.y, q.num }; }
struct Snipe
{
ll ccw(const Point& p1, const Point& p2)
{
ll t=p1.x*p2.y-p1.y*p2.x;
if(t==0) return t;
else return t/abs(t);
}
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... |