結果
問題 | No.202 1円玉投げ |
ユーザー |
![]() |
提出日時 | 2023-11-30 14:57:49 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 1,057 ms / 5,000 ms |
コード長 | 5,041 bytes |
コンパイル時間 | 191 ms |
コンパイル使用メモリ | 13,184 KB |
実行使用メモリ | 51,780 KB |
最終ジャッジ日時 | 2024-09-26 14:04:29 |
合計ジャッジ時間 | 17,635 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
import bisectimport copyimport decimalimport fractionsimport heapqimport itertoolsimport mathimport randomimport sysimport timefrom collections import Counter,deque,defaultdictfrom functools import lru_cache,reducefrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_maxdef _heappush_max(heap,item):heap.append(item)heapq._siftdown_max(heap, 0, len(heap)-1)def _heappushpop_max(heap, item):if heap and item < heap[0]:item, heap[0] = heap[0], itemheapq._siftup_max(heap, 0)return itemfrom math import gcd as GCDread=sys.stdin.readreadline=sys.stdin.readlinereadlines=sys.stdin.readlineswrite=sys.stdout.write#import pypyjit#pypyjit.set_param('max_unroll_recursion=-1')#sys.set_int_max_str_digits(10**9)class UnionFind:def __init__(self,N,label=None,f=None,weighted=False,rollback=False):self.N=Nself.parents=[None]*self.Nself.size=[1]*self.Nself.roots={i for i in range(self.N)}self.label=labelif self.label!=None:self.label=[x for x in label]self.f=fself.weighted=weightedif self.weighted:self.weight=[0]*self.Nself.rollback=rollbackif 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=0for y in stack[::-1]:self.parents[y]=xw+=self.weight[y]self.weight[y]=welse:for y in stack[::-1]:self.parents[y]=xreturn xdef 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 Trueelse:return Falseelse:if self.size[root_x]<self.size[root_y]:x,y=y,xroot_x,root_y=root_y,root_xif self.weighted:w=-wif 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_xself.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 Nonereturn 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_componentsdef Rollback(self):assert self.rollbackif self.operate_list:for lst,x,v in self.operate_list.pop():lst[x]=vfor x in self.operate_set.pop():self.roots.add(x)return Trueelse:return Falsedef __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(readline())XY=defaultdict(list)ans=0for n in range(N):x,y=map(int,readline().split())i,j=x//20,y//20for di in range(-1,2):for dj in range(-1,2):if (i+di,j+dj) in XY:for xx,yy in XY[(i+di,j+dj)]:if (x-xx)**2+(y-yy)**2<20**2:breakelse:continuebreakelse:continuebreakelse:ans+=1XY[(x//20,y//20)].append((x,y))print(ans)