結果
問題 | No.96 圏外です。 |
ユーザー | しらっ亭 |
提出日時 | 2015-08-31 00:30:29 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,391 bytes |
コンパイル時間 | 210 ms |
コンパイル使用メモリ | 11,256 KB |
実行使用メモリ | 261,188 KB |
最終ジャッジ日時 | 2023-09-25 19:59:58 |
合計ジャッジ時間 | 36,701 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 19 ms
9,040 KB |
testcase_01 | AC | 19 ms
8,880 KB |
testcase_02 | AC | 20 ms
8,952 KB |
testcase_03 | AC | 19 ms
8,940 KB |
testcase_04 | AC | 50 ms
15,292 KB |
testcase_05 | AC | 73 ms
18,676 KB |
testcase_06 | AC | 107 ms
25,120 KB |
testcase_07 | AC | 145 ms
27,440 KB |
testcase_08 | AC | 216 ms
41,492 KB |
testcase_09 | AC | 307 ms
49,588 KB |
testcase_10 | AC | 372 ms
44,928 KB |
testcase_11 | AC | 567 ms
75,836 KB |
testcase_12 | AC | 805 ms
112,840 KB |
testcase_13 | AC | 818 ms
60,856 KB |
testcase_14 | AC | 1,182 ms
123,592 KB |
testcase_15 | AC | 1,385 ms
75,884 KB |
testcase_16 | AC | 1,727 ms
147,824 KB |
testcase_17 | AC | 2,265 ms
261,188 KB |
testcase_18 | AC | 2,049 ms
162,200 KB |
testcase_19 | AC | 2,085 ms
162,024 KB |
testcase_20 | AC | 2,606 ms
71,800 KB |
testcase_21 | AC | 2,094 ms
113,124 KB |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | AC | 20 ms
8,908 KB |
testcase_25 | AC | 1,658 ms
180,628 KB |
testcase_26 | AC | 2,108 ms
244,996 KB |
testcase_27 | AC | 1,753 ms
221,340 KB |
ソースコード
from collections import defaultdict from itertools import combinations import math class UnionFind: def __init__(self, n): self.par = list(range(n)) def find(self, x): if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return self.par[x] = y def convex_hull(P): def veccross(A, B, C): return (C[0] - A[0]) * (B[1] - A[1]) - (C[1] - A[1]) * (B[0] - A[0]) n = len(P) if n <= 2: return list(range(n)) ps = [None] * n for i in range(n): ps[i] = (P[i], i) ps.sort() k = 0 res = [0] * (n * 2) for i in range(n): while k > 1 and veccross(P[res[k - 2]], P[res[k - 1]], ps[i][0]) <= 0: k -= 1 res[k] = ps[i][1] k += 1 t = k for i in range(n - 2, -1, -1): while k > t and veccross(P[res[k - 2]], P[res[k - 1]], ps[i][0]) <= 0: k -= 1 res[k] = ps[i][1] k += 1 return res[:k - 1] def m_dist(g, xs, ys): ps = [(xs[i], ys[i]) for i in g] os = convex_hull(ps) ma = 0 for i, j in combinations(os, 2): ma = max(ma, (ps[i][0] - ps[j][0]) ** 2 + (ps[i][1] - ps[j][1]) ** 2) return ma def solve(): N = int(input()) XS = [0] * N YS = [0] * N B = defaultdict(list) def b(x, y): if 0 <= x <= 2000 and 0 <= y <= 2000: return B[x, y] else: return [] ds = [(-1, -1), (0, -1), (1, -1), (-1, 0), (0, 0), (1, 0), (-1, 1), (0, 1), (1, 1)] uf = UnionFind(N) for i in range(N): x, y = map(int, input().split()) x += 10000 y += 10000 XS[i] = x YS[i] = y x10 = x // 10 y10 = y // 10 for dx, dy in ds: for j in b(x10 + dx, y10 + dy): if (x - XS[j]) ** 2 + (y - YS[j]) ** 2 <= 100: uf.union(i, j) B[x10, y10].append(i) gd = defaultdict(list) for i in range(N): gd[uf.find(i)].append(i) if len(gd) == 0: print(1) else: ma = 0 for g in gd.values(): ma = max(ma, m_dist(g, XS, YS)) print(math.sqrt(ma) + 2) if __name__ == '__main__': solve()