結果

問題 No.3042 拡大コピー
ユーザー 👑 binap
提出日時 2025-03-01 00:30:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 903 ms / 2,000 ms
コード長 2,890 bytes
コンパイル時間 3,981 ms
コンパイル使用メモリ 253,428 KB
実行使用メモリ 18,092 KB
最終ジャッジ日時 2025-03-01 07:42:31
合計ジャッジ時間 7,273 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

const int INF = 1001001001;

int main(){
	int n;
	cin >> n;
	vector<long double> x(n), y(n), z(n), w(n);
	
	long double gx = 0, gy = 0, gz = 0, gw = 0;
	
	long double m1 = 0, m2 = 0;
	
	rep(i, n){
		cin >> x[i] >> y[i];
		gx += x[i];
		gy += y[i];
	}
	{
		gx /= n;
		gy /= n;
	}
	rep(i, n){
		chmax(m1, (x[i] - gx) * (x[i] - gx) + (y[i] - gy) * (y[i] - gy));
	}
	
	rep(i, n){
		cin >> z[i] >> w[i];
		gz += z[i];
		gw += w[i];
	}
	{
		gz /= n;
		gw /= n;
	}
	rep(i, n){
		chmax(m2, (z[i] - gz) * (z[i] - gz) + (w[i] - gw) * (w[i] - gw));
	}
	
	cout << setprecision(15);
	cout << sqrtl(m2 / m1) << "\n";
	
	return 0;
}
0