# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97887 | Alexa2001 | Fences (JOI18_fences) | C++17 | 524 ms | 3192 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 x real()
#define y imag()
using namespace std;
const int Nmax = 210;
const long double eps = 1e-6;
typedef complex<long double> point;
long double dist[Nmax][2][Nmax][2];
int S, N;
point a[Nmax], O, W;
point S1[10], S2[10];
int Pair(int k)
{
if(k >= 2*N) return -1;
return k^1;
}
long double distanta(point A, point B)
{
return abs(A - B);
}
long double cross(point a, point b)
{
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... |