結果

問題 No.307 最近色塗る問題多くない？
コンテスト
ユーザー rpy3cpp
提出日時 2015-11-27 23:56:34
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
RE  
実行時間 -
コード長 3,257 bytes
コンパイル時間 111 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 25,600 KB
最終ジャッジ日時 2024-09-14 01:34:16
合計ジャッジ時間 9,129 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 8 RE * 20 TLE * 1 -- * 7
権限があれば一括ダウンロードができます

ソースコード

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):
        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]
        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