結果
| 問題 | No.96 圏外です。 |
| ユーザー |
 heno239
|
| 提出日時 | 2020-04-08 11:58:27 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 633 ms / 5,000 ms |
| コード長 | 4,900 bytes |
| コンパイル時間 | 1,298 ms |
| コンパイル使用メモリ | 131,788 KB |
| 実行使用メモリ | 17,476 KB |
| 最終ジャッジ日時 | 2024-07-18 08:45:47 |
| 合計ジャッジ時間 | 4,710 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 28 |
ソースコード
#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 longtypedef 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);}};vector<P> ys[20001];void solve() {int n; cin >> n;if (n == 0) {cout << "1\n"; return;}vector<int> x(n), y(n);rep(i, n)cin >> x[i] >> y[i];rep(i, n) {x[i] += 10000; y[i] += 10000;ys[x[i]].push_back({ y[i],i });}rep(i, 20001)sort(all(ys[i]));uf u(n);rep(i, n) {for (int dx = -10; dx <= 10; dx++) {int tx = x[i] + dx;if (tx >= 0 && tx <= 20000) {int le = lower_bound(all(ys[tx]), P{ y[i] - 10,-1 }) - ys[tx].begin();while (le < ys[tx].size() && ys[tx][le].first <= y[i] + 10) {int dy = ys[tx][le].first - y[i];if (dx*dx + dy * dy <= 100) {u.unite(i, ys[tx][le].second);}le++;}}}}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();stopreturn 0;}