提出 #4198030

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

// distance between (x1,y1) and (x2,y2)
double cdis(double x1, double y1, double x2, double y2) {
  return sqrtl((x1 - x2) * (x1 - x2) +
               (y1 - y2) * (y1 - y2));
}

int n;
pair<double, double> memo[2][100005], ave[2];
vector<double> v[2];

double solve();

int main() {
  cout << fixed << setprecision(10);
  cin >> n;
  ave[0] = ave[1] = make_pair(0.0, 0.0);
  for(int t = 0; t < 2; ++t)
    for(int i = 0; i < n; ++i) {
      double x, y;
      cin >> x >> y;
      ave[t].fi += x;
      ave[t].se += y;
      memo[t][i] = make_pair(x, y);
    }
  cout << solve() << endl;
  return 0;
}

double solve() {
  for(int i = 0; i < 2; ++i) {
    ave[i].fi /= (double)n;
    ave[i].se /= (double)n;
  }
  for(int t = 0; t < 2; ++t)
    for(int i = 0; i < n; ++i) {
      v[t].push_back(cdis(memo[t][i].fi, memo[t][i].se,
                          ave[t].fi, ave[t].se));
    }
  sort(v[0].begin(), v[0].end());
  sort(v[1].begin(), v[1].end());
  return v[1][v[1].size() - 1] / v[0][v[0].size() - 1];
}

提出情報

ジャッジ結果