結果
問題 | No.202 1円玉投げ |
ユーザー | vwxyz |
提出日時 | 2023-11-30 14:57:49 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,012 ms / 5,000 ms |
コード長 | 5,041 bytes |
コンパイル時間 | 329 ms |
コンパイル使用メモリ | 12,544 KB |
実行使用メモリ | 51,328 KB |
最終ジャッジ日時 | 2023-11-30 14:58:08 |
合計ジャッジ時間 | 17,643 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,012 ms
51,328 KB |
testcase_01 | AC | 732 ms
49,324 KB |
testcase_02 | AC | 34 ms
11,392 KB |
testcase_03 | AC | 35 ms
11,392 KB |
testcase_04 | AC | 35 ms
11,392 KB |
testcase_05 | AC | 69 ms
13,696 KB |
testcase_06 | AC | 572 ms
38,196 KB |
testcase_07 | AC | 650 ms
40,760 KB |
testcase_08 | AC | 656 ms
41,016 KB |
testcase_09 | AC | 373 ms
30,016 KB |
testcase_10 | AC | 167 ms
19,056 KB |
testcase_11 | AC | 306 ms
26,044 KB |
testcase_12 | AC | 315 ms
26,420 KB |
testcase_13 | AC | 190 ms
20,732 KB |
testcase_14 | AC | 80 ms
14,080 KB |
testcase_15 | AC | 357 ms
29,832 KB |
testcase_16 | AC | 838 ms
46,968 KB |
testcase_17 | AC | 829 ms
46,968 KB |
testcase_18 | AC | 844 ms
46,968 KB |
testcase_19 | AC | 347 ms
29,832 KB |
testcase_20 | AC | 533 ms
36,024 KB |
testcase_21 | AC | 337 ms
27,192 KB |
testcase_22 | AC | 41 ms
11,776 KB |
testcase_23 | AC | 42 ms
11,776 KB |
testcase_24 | AC | 40 ms
11,392 KB |
testcase_25 | AC | 41 ms
11,392 KB |
testcase_26 | AC | 43 ms
11,776 KB |
testcase_27 | AC | 41 ms
11,776 KB |
testcase_28 | AC | 38 ms
11,392 KB |
testcase_29 | AC | 38 ms
11,392 KB |
testcase_30 | AC | 43 ms
11,776 KB |
testcase_31 | AC | 40 ms
11,392 KB |
testcase_32 | AC | 41 ms
11,776 KB |
testcase_33 | AC | 40 ms
11,520 KB |
testcase_34 | AC | 44 ms
11,648 KB |
testcase_35 | AC | 938 ms
46,872 KB |
testcase_36 | AC | 974 ms
50,468 KB |
testcase_37 | AC | 688 ms
42,556 KB |
testcase_38 | AC | 989 ms
50,480 KB |
testcase_39 | AC | 38 ms
11,392 KB |
testcase_40 | AC | 38 ms
11,392 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _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], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=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=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(readline()) XY=defaultdict(list) ans=0 for n in range(N): x,y=map(int,readline().split()) i,j=x//20,y//20 for 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: break else: continue break else: continue break else: ans+=1 XY[(x//20,y//20)].append((x,y)) print(ans)