/* -*- coding: utf-8 -*- * * 3042.cc: No.3042 諡。螟ァ繧ウ繝斐・ - yukicoder */ #include #include #include using namespace std; /* constant */ const int MAX_N = 1000000; /* typedef */ template struct Pt { T x, y; Pt() {} Pt(T _x, T _y) : x(_x), y(_y) {} Pt(const Pt &p) : x(p.x), y(p.y) {} Pt operator+(const Pt p) const { return Pt(x + p.x, y + p.y); } Pt operator-() const { return Pt(-x, -y); } Pt operator-(const Pt p) const { return Pt(x - p.x, y - p.y); } Pt operator*(T t) const { return Pt(x * t, y * t); } Pt operator/(T t) const { return Pt(x / t, y / t); } T dot(Pt v) const { return x * v.x + y * v.y; } T cross(Pt v) const { return x * v.y - y * v.x; } Pt mid(const Pt p) { return Pt((x + p.x) / 2, (y + p.y) / 2); } T d2() { return x * x + y * y; } double d() { return sqrt(d2()); } Pt rot(double th) { double c = cos(th), s = sin(th); return Pt(c * x - s * y, s * x + c * y); } Pt rot90() { return Pt(-y, x); } bool operator==(const Pt pt) const { return x == pt.x && y == pt.y; } bool operator<(const Pt &pt) const { return x < pt.x || (x == pt.x && y < pt.y); } void print() { printf("(%d,%d)", x, y); } }; using pt = Pt; /* global variables */ pt ps[MAX_N], qs[MAX_N]; /* subroutines */ void readpts(int n, pt ps[]) { for (int i = 0; i < n; i++) scanf("%lf%lf", &ps[i].x, &ps[i].y); } int farthest(int n, pt ps[], int st) { double maxd2 = -1, maxi = -1; for (int i = 0; i < n; i++) if (i != st) { double d2 = (ps[i] - ps[st]).d2(); if (maxd2 < d2) maxd2 = d2, maxi = i; } return maxi; } /* main */ int main() { int n; scanf("%d", &n); readpts(n, ps); readpts(n, qs); int p0 = farthest(n, ps, 0); int p1 = farthest(n, ps, p0); int q0 = farthest(n, qs, 0); int q1 = farthest(n, qs, p0); double pd = (ps[p1] - ps[p0]).d2(); double qd = (qs[q1] - qs[q0]).d2(); double r = sqrt(qd / pd); printf("%.10lf\n", r); return 0; }