結果
問題 | No.2696 Sign Creation |
ユーザー | nikoro256 |
提出日時 | 2024-03-22 23:22:57 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,626 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 82,280 KB |
実行使用メモリ | 128,960 KB |
最終ジャッジ日時 | 2024-05-17 18:20:21 |
合計ジャッジ時間 | 14,738 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
71,724 KB |
testcase_01 | AC | 45 ms
63,676 KB |
testcase_02 | AC | 38 ms
55,632 KB |
testcase_03 | AC | 45 ms
64,152 KB |
testcase_04 | AC | 43 ms
63,056 KB |
testcase_05 | AC | 48 ms
64,992 KB |
testcase_06 | AC | 39 ms
56,580 KB |
testcase_07 | AC | 42 ms
56,376 KB |
testcase_08 | AC | 169 ms
79,448 KB |
testcase_09 | AC | 89 ms
77,192 KB |
testcase_10 | AC | 134 ms
77,860 KB |
testcase_11 | AC | 88 ms
77,028 KB |
testcase_12 | AC | 88 ms
76,748 KB |
testcase_13 | AC | 1,140 ms
90,004 KB |
testcase_14 | AC | 491 ms
90,460 KB |
testcase_15 | AC | 503 ms
90,488 KB |
testcase_16 | AC | 1,128 ms
89,684 KB |
testcase_17 | AC | 428 ms
77,208 KB |
testcase_18 | AC | 278 ms
78,964 KB |
testcase_19 | AC | 535 ms
86,504 KB |
testcase_20 | AC | 128 ms
77,408 KB |
testcase_21 | AC | 414 ms
95,588 KB |
testcase_22 | AC | 466 ms
78,756 KB |
testcase_23 | AC | 435 ms
88,784 KB |
testcase_24 | AC | 426 ms
88,152 KB |
testcase_25 | AC | 626 ms
85,144 KB |
testcase_26 | AC | 468 ms
78,980 KB |
testcase_27 | AC | 460 ms
77,896 KB |
testcase_28 | AC | 348 ms
78,524 KB |
testcase_29 | AC | 454 ms
77,688 KB |
testcase_30 | AC | 415 ms
77,732 KB |
testcase_31 | TLE | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
ソースコード
from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) import sys input=sys.stdin.readline H,W,N,D=map(int,input().split()) dat=[] datset=set() dic={} uf=UnionFind(N) for i in range(N): x,y=map(int,input().split()) x-=1 y-=1 dat.append((x,y)) datset.add((x,y)) dic[(x,y)]=i for x,y in dat: for i in range(-D,D+1): for j in range(-D,D+1): if abs(i)+abs(j)>D: continue if (x+i,y+j) in datset: uf.union(dic[(x,y)],dic[(x+i,y+j)]) root={} for a in datset: root[a]=uf.find(dic[a]) small=10**9 big=-10**9 for i in range(H): for j in range(W): use=set() for k in range(-D,D+1): for t in range(-D,D+1): if abs(k)+abs(t)>D: continue tmp=(i+k,j+t) if tmp in datset: use.add(root[tmp]) flag=False one=0 notone=0 tmp=0 for u in use: if -uf.parents[u]==1: one+=1 else: notone+=1 if notone==0: if one>0: tmp+=1 else: tmp=-(notone-1) big=max(big,tmp) small=min(small,tmp) all=0 #print(small,big) for idx,lis in uf.all_group_members().items(): if len(lis)>1: all+=1 #print(all) print(all+small,all+big)