結果

問題 No.307 最近色塗る問題多くない？
ユーザー rpy3cpprpy3cpp
提出日時 2015-11-28 00:24:02
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 568 ms / 4,000 ms
コード長 3,367 bytes
コンパイル時間 2,089 ms
コンパイル使用メモリ 81,504 KB
実行使用メモリ 138,128 KB
最終ジャッジ日時 2024-11-21 21:58:56
合計ジャッジ時間 8,504 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
52,736 KB
testcase_01 AC 41 ms
52,864 KB
testcase_02 AC 40 ms
52,608 KB
testcase_03 AC 41 ms
52,736 KB
testcase_04 AC 83 ms
76,672 KB
testcase_05 AC 42 ms
52,992 KB
testcase_06 AC 47 ms
59,392 KB
testcase_07 AC 189 ms
79,512 KB
testcase_08 AC 345 ms
86,304 KB
testcase_09 AC 279 ms
81,680 KB
testcase_10 AC 187 ms
78,908 KB
testcase_11 AC 265 ms
81,492 KB
testcase_12 AC 42 ms
53,376 KB
testcase_13 AC 115 ms
81,868 KB
testcase_14 AC 109 ms
77,916 KB
testcase_15 AC 133 ms
77,440 KB
testcase_16 AC 113 ms
77,416 KB
testcase_17 AC 250 ms
81,836 KB
testcase_18 AC 271 ms
94,304 KB
testcase_19 AC 263 ms
94,560 KB
testcase_20 AC 103 ms
77,228 KB
testcase_21 AC 200 ms
101,884 KB
testcase_22 AC 210 ms
99,988 KB
testcase_23 AC 316 ms
113,424 KB
testcase_24 AC 281 ms
114,204 KB
testcase_25 AC 297 ms
111,620 KB
testcase_26 AC 418 ms
125,068 KB
testcase_27 AC 199 ms
92,928 KB
testcase_28 AC 568 ms
138,128 KB
testcase_29 AC 107 ms
80,780 KB
testcase_30 AC 393 ms
121,824 KB
testcase_31 AC 234 ms
96,128 KB
testcase_32 AC 163 ms
95,616 KB
testcase_33 AC 120 ms
79,872 KB
testcase_34 AC 180 ms
86,604 KB
testcase_35 AC 186 ms
86,748 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)
        self._init2()

    def _init2(self):
        ds = self.ds
        color = self.color
        W = self.W
        H = self.H
        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):
        ds = self.ds
        p = ds.find_set(r * self.W + c)
        if self.color[p] == x:
            return
        self.color[p] = x
        self._update(p, x)

    def _update(self, 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)
            new_neighbour |= Es[pv]
            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)


def read_data():
    H, W = map(int, input().split())
    color = []
    for r in range(H):
        color.extend(list(map(int, input().split())))
    Q = int(input())
    query = []
    for q in range(Q):
        r, c, x = map(int, input().split())
        query.append((r-1, c-1, x))
    return H, W, color, Q, query


def solve(H, W, color, Q, query):
    paintset = PaintSet(color, H, W)
    for r, c, x in query:
        paintset.paint(r, c, x)
    paintset.pprint()

H, W, color, Q, query = read_data()
solve(H, W, color, Q, query)
0