結果
問題 | No.2696 Sign Creation |
ユーザー | nikoro256 |
提出日時 | 2024-03-22 23:29:55 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,680 bytes |
コンパイル時間 | 135 ms |
コンパイル使用メモリ | 82,444 KB |
実行使用メモリ | 129,884 KB |
最終ジャッジ日時 | 2024-05-17 18:20:50 |
合計ジャッジ時間 | 14,440 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
70,712 KB |
testcase_01 | AC | 45 ms
64,056 KB |
testcase_02 | AC | 38 ms
54,700 KB |
testcase_03 | AC | 44 ms
62,492 KB |
testcase_04 | AC | 40 ms
55,740 KB |
testcase_05 | AC | 45 ms
62,400 KB |
testcase_06 | AC | 39 ms
55,500 KB |
testcase_07 | AC | 40 ms
54,988 KB |
testcase_08 | AC | 177 ms
78,816 KB |
testcase_09 | AC | 83 ms
76,892 KB |
testcase_10 | AC | 175 ms
79,356 KB |
testcase_11 | AC | 85 ms
76,740 KB |
testcase_12 | AC | 82 ms
76,688 KB |
testcase_13 | AC | 1,096 ms
90,620 KB |
testcase_14 | AC | 507 ms
91,108 KB |
testcase_15 | AC | 481 ms
89,988 KB |
testcase_16 | AC | 1,089 ms
91,072 KB |
testcase_17 | AC | 403 ms
77,312 KB |
testcase_18 | AC | 272 ms
79,572 KB |
testcase_19 | AC | 563 ms
86,256 KB |
testcase_20 | AC | 117 ms
76,760 KB |
testcase_21 | AC | 406 ms
95,652 KB |
testcase_22 | AC | 472 ms
78,660 KB |
testcase_23 | AC | 449 ms
89,456 KB |
testcase_24 | AC | 450 ms
89,776 KB |
testcase_25 | AC | 630 ms
84,788 KB |
testcase_26 | AC | 416 ms
78,544 KB |
testcase_27 | AC | 403 ms
78,284 KB |
testcase_28 | AC | 313 ms
78,780 KB |
testcase_29 | AC | 447 ms
77,024 KB |
testcase_30 | AC | 365 ms
77,932 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): lim=D-abs(i) for j in range(-lim,lim+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): lim=D-abs(k) for t in range(-lim,lim+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)