結果
問題 | No.96 圏外です。 |
ユーザー | vwxyz |
提出日時 | 2024-05-03 16:51:47 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,711 bytes |
コンパイル時間 | 143 ms |
コンパイル使用メモリ | 82,096 KB |
実行使用メモリ | 502,412 KB |
最終ジャッジ日時 | 2024-11-24 19:36:08 |
合計ジャッジ時間 | 36,775 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
450,200 KB |
testcase_01 | AC | 245 ms
205,636 KB |
testcase_02 | AC | 249 ms
452,324 KB |
testcase_03 | AC | 238 ms
452,256 KB |
testcase_04 | AC | 301 ms
212,436 KB |
testcase_05 | AC | 304 ms
211,908 KB |
testcase_06 | AC | 314 ms
212,500 KB |
testcase_07 | AC | 378 ms
215,348 KB |
testcase_08 | AC | 364 ms
216,676 KB |
testcase_09 | AC | 394 ms
219,056 KB |
testcase_10 | AC | 424 ms
220,928 KB |
testcase_11 | AC | 452 ms
226,980 KB |
testcase_12 | AC | 454 ms
228,968 KB |
testcase_13 | AC | 572 ms
232,540 KB |
testcase_14 | AC | 579 ms
238,588 KB |
testcase_15 | AC | 743 ms
242,944 KB |
testcase_16 | AC | 724 ms
255,016 KB |
testcase_17 | AC | 689 ms
270,700 KB |
testcase_18 | AC | 750 ms
261,248 KB |
testcase_19 | AC | 792 ms
260,900 KB |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | AC | 243 ms
198,896 KB |
testcase_25 | AC | 571 ms
245,100 KB |
testcase_26 | AC | 651 ms
256,424 KB |
testcase_27 | AC | 587 ms
502,412 KB |
ソースコード
from collections import defaultdict class UnionFind: def __init__(self,N,label=None,f=None,weighted=False,rollback=False): self.N=N self.parents=[None]*self.N self.size=[1]*self.N self.roots={i for i in range(self.N)} self.label=label if self.label!=None: self.label=[x for x in label] self.f=f self.weighted=weighted if self.weighted: self.weight=[0]*self.N self.rollback=rollback if self.rollback: self.operate_list=[] self.operate_set=[] def Find(self,x): stack=[] while self.parents[x]!=None: stack.append(x) x=self.parents[x] if not self.rollback: if self.weighted: w=0 for y in stack[::-1]: self.parents[y]=x w+=self.weight[y] self.weight[y]=w else: for y in stack[::-1]: self.parents[y]=x return x def Union(self,x,y,w=None): root_x=self.Find(x) root_y=self.Find(y) if self.rollback: self.operate_list.append([]) self.operate_set.append([]) if root_x==root_y: if self.weighted: if self.weight[y]-self.weight[x]==w: return True else: return False else: if self.size[root_x]<self.size[root_y]: x,y=y,x root_x,root_y=root_y,root_x if self.weighted: w=-w if self.rollback: self.operate_list[-1].append((self.parents,root_y,self.parents[root_y])) self.operate_list[-1].append((self.size,root_x,self.size[root_x])) self.operate_set[-1].append(root_y) if self.label!=None: self.operate_list[-1]((self.label,root_x,self.label[root_x])) if self.weighted: self.operate_list[-1].append((self.weight,root_y,self.weight[root_y])) self.parents[root_y]=root_x self.size[root_x]+=self.size[root_y] self.roots.remove(root_y) if self.label!=None: self.label[root_x]=self.f(self.label[root_x],self.label[root_y]) if self.weighted: self.weight[root_y]=w+self.weight[x]-self.weight[y] def Size(self,x): return self.size[self.Find(x)] def Same(self,x,y): return self.Find(x)==self.Find(y) def Label(self,x): return self.label[self.Find(x)] def Weight(self,x,y): root_x=self.Find(x) root_y=self.Find(y) if root_x!=root_y: return None return self.weight[y]-self.weight[x] def Roots(self): return list(self.roots) def Linked_Components_Count(self): return len(self.roots) def Linked_Components(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return linked_components def Rollback(self): assert self.rollback if self.operate_list: for lst,x,v in self.operate_list.pop(): lst[x]=v for x in self.operate_set.pop(): self.roots.add(x) return True else: return False def __str__(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return "\n".join(f"{r}: {linked_components[r]}" for r in sorted(list(linked_components.keys()))) N=int(input()) D=2001 XY=[[] for d in range(D*D)] X,Y=[],[] for n in range(N): x,y=map(int,input().split()) XY[(x//10+1000)*D+(y//10+1000)].append((x,y,n)) X.append(x) Y.append(y) UF=UnionFind(N) for i in range(D): for j in range(D): if not XY[i*D+j]: continue for di in range(-1,2): for dj in range(-1,2): if (i+di)*D+(j+dj)>=D*D or not XY[(i+di)*D+(j+dj)]: continue for x,y,n in XY[i*D+j]: for xx,yy,nn in XY[(i+di)*D+(j+dj)]: if (x-xx)**2+(y-yy)**2<=100: UF.Union(n,nn) if N==0: ans=1 else: ans=0 for lst in UF.Linked_Components().values(): le=len(lst) for a in range(le): i=lst[a] for b in range(a+1,le): j=lst[b] ans=max(ans,(X[i]-X[j])**2+(Y[i]-Y[j])**2) ans=ans**.5+2 print(ans)