Submission #1690307

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>

using namespace std;

long long int xx1[200000], yy1[200000], xx2[200000], yy2[200000];

int main(){
	
	long long int N;
	cin >> N;
	
	long long int sum1 = 0;
	long long int sum2 = 0;
	double gxx1, gyy1, gxx2, gyy2;
	
	for(int i = 0; i < N; i++){
		cin >> xx1[i] >> yy1[i];
		sum1 += xx1[i];
		sum2 += yy1[i];
	}
	
	gxx1 = ((double)sum1) / N;
	gyy1 = ((double)sum2) / N;
	sum1 = 0;
	sum2 = 0;
	
	for(int i = 0; i < N; i++){
		cin >> xx2[i] >> yy2[i];
		sum1 += xx2[i];
		sum2 += yy2[i];
	}
	
	gxx2 = ((double)sum1) / N;
	gyy2 = ((double)sum2) / N;
	double d1 = 0;
	double d2 = 0;
	
	for(int i = 0; i < N; i++){
		double hoge = ((double)xx1[i] - gxx1) * ((double)xx1[i] - gxx1) + ((double)yy1[i] - gyy1) * ((double)yy1[i] - gyy1);
		d1 = max(hoge, d1);
		hoge = ((double)xx2[i] - gxx2) * ((double)xx2[i] - gxx2) + ((double)yy2[i] - gyy2) * ((double)yy2[i] - gyy2);
		d2 = max(hoge, d2);
	}
	
	double ans = sqrt(d2 / d1);
	
	printf("%.10f\n", ans);
	
	return 0;
}

Submission Info

Judge Result