結果

問題 No.94 圏外です。(EASY)
ユーザー heno239heno239
提出日時 2020-04-08 11:53:06
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 16 ms / 5,000 ms
コード長 4,676 bytes
コンパイル時間 1,698 ms
コンパイル使用メモリ 137,104 KB
実行使用メモリ 7,868 KB
最終ジャッジ日時 2023-09-25 10:40:29
合計ジャッジ時間 2,768 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
7,632 KB
testcase_01 AC 4 ms
7,664 KB
testcase_02 AC 4 ms
7,768 KB
testcase_03 AC 3 ms
7,424 KB
testcase_04 AC 4 ms
7,680 KB
testcase_05 AC 5 ms
7,664 KB
testcase_06 AC 7 ms
7,732 KB
testcase_07 AC 9 ms
7,728 KB
testcase_08 AC 12 ms
7,776 KB
testcase_09 AC 15 ms
7,784 KB
testcase_10 AC 15 ms
7,780 KB
testcase_11 AC 15 ms
7,716 KB
testcase_12 AC 15 ms
7,868 KB
testcase_13 AC 15 ms
7,780 KB
testcase_14 AC 16 ms
7,796 KB
testcase_15 AC 15 ms
7,808 KB
testcase_16 AC 15 ms
7,784 KB
testcase_17 AC 15 ms
7,760 KB
testcase_18 AC 15 ms
7,756 KB
testcase_19 AC 12 ms
7,720 KB
testcase_20 AC 4 ms
7,588 KB
testcase_21 AC 3 ms
7,592 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

int calc(vector<P> v) {
	sort(all(v));
	vector<P> nxt;
	rep(i, v.size()) {
		int le = i;
		while (i + 1 < v.size() && v[i].first == v[i + 1].first) {
			i++;
		}
		nxt.push_back(v[i]);
		if (i != le)nxt.push_back(v[le]);
	}
	swap(v, nxt);
	nxt.clear();
	rep(i, v.size())swap(v[i].first, v[i].second);
	sort(all(v));
	rep(i, v.size()) {
		int le = i;
		while (i + 1 < v.size() && v[i].first == v[i + 1].first) {
			i++;
		}
		nxt.push_back(v[i]);
		if (i != le)nxt.push_back(v[le]);
	}
	swap(v, nxt);
	nxt.clear();
	int res = 0;
	rep(i, v.size()) {
		Rep(j, i + 1, v.size()) {
			int dx = v[j].first - v[i].first;
			int dy = v[j].second - v[i].second;
			res = max(res, dx*dx + dy * dy);
		}
	}
	return res;
}

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};

void solve() {
	int n; cin >> n;
	if (n == 0) {
		cout << "1\n"; return;
	}
	map<P, int> mp;
	vector<int> x(n), y(n);
	rep(i, n)cin >> x[i] >> y[i];
	rep(i, n) {
		mp[{x[i], y[i]}] = i;
	}
	uf u(n);
	rep(i, n) {
		for (int dx = -10; dx <= 10; dx++) {
			for (int dy = -10; dy <= 10; dy++) {
				if (dx*dx + dy * dy <= 100) {
					P to = { x[i] + dx,y[i] + dy };
					if (mp.find(to) != mp.end()) {
						u.unite(i, mp[to]);
					}
				}
			}
		}
	}
	vector<vector<int>> ids(n);
	rep(i, n) {
		ids[u.find(i)].push_back(i);
	}
	int ma = 0;
	rep(i, n) {
		if (ids[i].empty())continue;
		vector<P> v;
		for (int id : ids[i])v.push_back({ x[id],y[id] });
		ma = max(ma, calc(v));
	}
	ld ans = sqrtl(ma) + 2;
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(7);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}
0