結果
問題 | No.94 圏外です。(EASY) |
ユーザー | 👑 cologne |
提出日時 | 2022-01-31 20:01:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 155 ms / 5,000 ms |
コード長 | 2,905 bytes |
コンパイル時間 | 298 ms |
コンパイル使用メモリ | 87,376 KB |
実行使用メモリ | 80,056 KB |
最終ジャッジ日時 | 2023-09-02 02:23:59 |
合計ジャッジ時間 | 4,328 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 82 ms
76,940 KB |
testcase_01 | AC | 82 ms
76,592 KB |
testcase_02 | AC | 83 ms
76,732 KB |
testcase_03 | AC | 74 ms
71,320 KB |
testcase_04 | AC | 89 ms
76,968 KB |
testcase_05 | AC | 100 ms
77,280 KB |
testcase_06 | AC | 108 ms
78,492 KB |
testcase_07 | AC | 123 ms
78,740 KB |
testcase_08 | AC | 134 ms
79,680 KB |
testcase_09 | AC | 148 ms
79,456 KB |
testcase_10 | AC | 151 ms
79,276 KB |
testcase_11 | AC | 147 ms
79,392 KB |
testcase_12 | AC | 150 ms
79,724 KB |
testcase_13 | AC | 151 ms
79,836 KB |
testcase_14 | AC | 153 ms
79,820 KB |
testcase_15 | AC | 145 ms
79,532 KB |
testcase_16 | AC | 152 ms
80,056 KB |
testcase_17 | AC | 153 ms
80,000 KB |
testcase_18 | AC | 155 ms
79,960 KB |
testcase_19 | AC | 133 ms
79,460 KB |
testcase_20 | AC | 82 ms
76,728 KB |
testcase_21 | AC | 82 ms
76,552 KB |
ソースコード
import sys import math import bisect def input(): return sys.stdin.readline().rstrip() class DisjointSet: def __init__(self, N): self.par = list(range(N)) def find(self, a): if a == self.par[a]: return a self.par[a] = self.find(self.par[a]) return self.par[a] def union(self, a, b): self.par[self.find(a)] = self.find(b) def ccw(p1, p2, p3): x1, y1 = p1 x2, y2 = p2 x3, y3 = p3 return (x2-x1)*(y3-y1)-(x3-x1)*(y2-y1) def dist(xy): if len(xy) <= 1: return 0 if len(xy) == 2: (x1, y1), (x2, y2) = xy return ((x2-x1)**2 + (y2-y1)**2)**0.5 xy.sort() upper, lower = [], [] for pt in xy: while len(upper) >= 2: if ccw(upper[-2], upper[-1], pt) >= 0: upper.pop() else: break upper.append(pt) while len(lower) >= 2: if ccw(lower[-2], lower[-1], pt) <= 0: lower.pop() else: break lower.append(pt) lower.extend(upper[-2:0:-1]) if len(lower) == 2: (x1, y1), (x2, y2) = lower return ((x2-x1)**2 + (y2-y1)**2)**0.5 ans = 0 j = 2 for i in range(len(lower)): ni = 0 if i + 1 == len(lower) else i + 1 while True: nj = 0 if j + 1 == len(lower) else j + 1 if ccw(lower[i], lower[ni], lower[j]) <= \ ccw(lower[i], lower[ni], lower[nj]): j = nj else: break x1, y1 = lower[i] x2, y2 = lower[ni] x3, y3 = lower[j] ans = max(ans, (x3-x1)**2+(y3-y1)**2, (x3-x2)**2+(y3-y2)**2) return ans ** 0.5 def main(): N = int(input()) if N == 0: print(1) return MAX = 10000 xpos = [[] for i in range(MAX*2+1)] coord = {} xy = [] for i in range(N): x, y = [int(v)+MAX for v in input().split()] xpos[x].append(y) coord[(x, y)] = i xy.append((x, y)) ds = DisjointSet(N) for x in range(len(xpos)): xpos[x].sort() for j in range(len(xpos[x])-1): yp, yn = xpos[x][j], xpos[x][j+1] if yn-yp <= 10: ds.union(coord.get((x, yp)), coord.get((x, yn))) for (x, y), v in coord.items(): for xt in range(max(0, x-10), x): yt = int(math.sqrt(100-(x-xt)**2)) L = bisect.bisect_left(xpos[xt], y-yt) R = bisect.bisect_right(xpos[xt], y+yt) if L != R: ds.union(v, coord.get((xt, xpos[xt][L]))) if L != R-1: ds.union(v, coord.get((xt, xpos[xt][R-1]))) connected = [[] for i in range(N)] for i in range(N): connected[ds.find(i)].append(xy[i]) print(max(map(dist, connected)) + 2) if __name__ == '__main__': main()