結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | rpy3cpp |
提出日時 | 2015-11-28 01:56:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,840 ms / 4,000 ms |
コード長 | 3,029 bytes |
コンパイル時間 | 264 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 179,712 KB |
最終ジャッジ日時 | 2024-05-01 16:48:00 |
合計ジャッジ時間 | 10,916 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
52,352 KB |
testcase_01 | AC | 45 ms
52,608 KB |
testcase_02 | AC | 45 ms
52,608 KB |
testcase_03 | AC | 45 ms
52,736 KB |
testcase_04 | AC | 98 ms
77,312 KB |
testcase_05 | AC | 46 ms
53,120 KB |
testcase_06 | AC | 52 ms
59,392 KB |
testcase_07 | AC | 200 ms
79,368 KB |
testcase_08 | AC | 374 ms
83,788 KB |
testcase_09 | AC | 303 ms
81,124 KB |
testcase_10 | AC | 201 ms
78,576 KB |
testcase_11 | AC | 309 ms
81,188 KB |
testcase_12 | AC | 46 ms
52,992 KB |
testcase_13 | AC | 118 ms
76,544 KB |
testcase_14 | AC | 127 ms
77,588 KB |
testcase_15 | AC | 152 ms
77,440 KB |
testcase_16 | AC | 131 ms
77,664 KB |
testcase_17 | AC | 289 ms
82,536 KB |
testcase_18 | AC | 272 ms
85,256 KB |
testcase_19 | AC | 279 ms
86,180 KB |
testcase_20 | AC | 118 ms
77,256 KB |
testcase_21 | AC | 207 ms
89,472 KB |
testcase_22 | AC | 236 ms
90,112 KB |
testcase_23 | AC | 175 ms
89,600 KB |
testcase_24 | AC | 163 ms
89,216 KB |
testcase_25 | AC | 228 ms
89,600 KB |
testcase_26 | AC | 205 ms
89,856 KB |
testcase_27 | AC | 351 ms
90,112 KB |
testcase_28 | AC | 2,840 ms
179,712 KB |
testcase_29 | AC | 109 ms
76,416 KB |
testcase_30 | AC | 238 ms
90,496 KB |
testcase_31 | AC | 472 ms
90,752 KB |
testcase_32 | AC | 183 ms
89,344 KB |
testcase_33 | AC | 139 ms
79,744 KB |
testcase_34 | AC | 180 ms
80,512 KB |
testcase_35 | AC | 185 ms
80,512 KB |
ソースコード
class DisjointSet(object): def __init__(self, n): self.parent = list(range(n)) self.rank = [0] * n self.num = n # number of disjoint sets def union(self, x, y): self._link(self.find_set(x), self.find_set(y)) def _link(self, x, y): if x == y: return self.num -= 1 if self.rank[x] > self.rank[y]: self.parent[y] = x else: self.parent[x] = y if self.rank[x] == self.rank[y]: self.rank[y] += 1 def find_set(self, x): xp = self.parent[x] if xp != x: self.parent[x] = self.find_set(xp) return self.parent[x] class PaintSet(object): def __init__(self, color, H, W): self.color = color self.H = H self.W = W self.ds = DisjointSet(H * W) ds = self.ds pos = 0 for r in range(H): for c in range(W): col = color[pos] if r+1 < H and color[pos + W] == col: ds.union(pos, pos + W) if c+1 < W and color[pos + 1] == col: ds.union(pos, pos + 1) pos += 1 Es = [set() for i in range(W * H)] pos = 0 for r in range(H): for c in range(W): col = color[pos] p = ds.find_set(pos) if r+1 < H and color[pos + W] != col: p2 = ds.find_set(pos + W) Es[p].add(p2) Es[p2].add(p) if c+1 < W and color[pos + 1] != col: p2 = ds.find_set(pos + 1) Es[p].add(p2) Es[p2].add(p) pos += 1 self.Es = Es def paint(self, r, c, x): p = self.ds.find_set(r * self.W + c) if self.color[p] == x: return self.color[p] = x if self.ds.num == 1: return Es = self.Es ds = self.ds new_neighbour = set() for v in Es[p]: pv = ds.find_set(v) ds.union(p, pv) for u in Es[pv]: new_neighbour.add(ds.find_set(u)) Es[pv] = set() if p in new_neighbour: new_neighbour.remove(p) newp = ds.find_set(p) Es[newp] = new_neighbour def pprint(self): W = self.W H = self.H color = self.color ds = self.ds pos = 0 for r in range(H): row = [] for c in range(W): col = color[ds.find_set(pos)] row.append(col) pos += 1 print(*row) if __name__ == "__main__": H, W = map(int, input().split()) color = [] for r in range(H): color.extend(list(map(int, input().split()))) paintset = PaintSet(color, H, W) Q = int(input()) for q in range(Q): r, c, x = map(int, input().split()) paintset.paint(r-1, c-1, x) paintset.pprint()