結果

問題 No.3378 Go Board
コンテスト
ユーザー 👑 loop0919
提出日時 2025-10-14 00:14:08
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,858 bytes
コンパイル時間 189 ms
コンパイル使用メモリ 82,164 KB
実行使用メモリ 77,128 KB
最終ジャッジ日時 2025-11-21 20:50:24
合計ジャッジ時間 5,349 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other TLE * 1 -- * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

from itertools import combinations


class dsu:
    n = 1
    parent_or_size = [-1 for i in range(n)]

    def __init__(self, N):
        self.n = N
        self.parent_or_size = [-1 for i in range(N)]

    def merge(self, a, b):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
        x = self.leader(a)
        y = self.leader(b)
        if x == y:
            return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a, b):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        assert 0 <= b < self.n, "0<=b<n,b={0},n={1}".format(b, self.n)
        return self.leader(a) == self.leader(b)

    def leader(self, a):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        if self.parent_or_size[a] < 0:
            return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a):
        assert 0 <= a < self.n, "0<=a<n,a={0},n={1}".format(a, self.n)
        return -self.parent_or_size[self.leader(a)]

    def groups(self):
        leader_buf = [0 for i in range(self.n)]
        group_size = [0 for i in range(self.n)]
        for i in range(self.n):
            leader_buf[i] = self.leader(i)
            group_size[leader_buf[i]] += 1
        result = [[] for i in range(self.n)]
        for i in range(self.n):
            result[leader_buf[i]].append(i)
        result2 = []
        for i in range(self.n):
            if len(result[i]) > 0:
                result2.append(result[i])
        return result2


WAYS = [(1, 0), (-1, 0), (0, 1), (0, -1)]


def solve():
    N, K = map(int, input().split())

    for comb in combinations(range(N**2), K):
        comb_set = set(comb)

        uf = dsu(N**2)
        empty = set()

        for x in comb:
            i, j = x // N, x % N

            for di, dj in WAYS:
                ni, nj = i + di, j + dj
                nx = ni * N + nj

                if not (0 <= ni < N and 0 <= nj < N):
                    continue

                if nx in comb_set:
                    uf.merge(x, nx)
                else:
                    empty.add(nx)

        if uf.size(comb[0]) != K:
            continue

        if len(empty) != K:
            continue

        print("Yes")
        for i in range(N):
            for j in range(N):
                if i * N + j in comb:
                    print("#", end="")
                else:
                    print(".", end="")
            print()
        return

    print("No")


if __name__ == "__main__":
    T = int(input())
    for _ in range(T):
        solve()
0