Submission #70033280

---

Source Code Expand

class UnionFind():
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]


N, M = map(int, input().split())
Edge = []
for _ in range(M):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    Edge.append((u, v))

N2 = 1 << N
ans = 10 ** 18
for s in range(N2):
    U = UnionFind(N)
    cnt = 0
    seen = [0] * N
    for i in range(N):
        if (s >> i) & 1:
            seen[i] = 1

    for u, v in Edge:
        if seen[u] == seen[v]:
            cnt += 1

    ans = min(ans, cnt)

print(ans)

Submission Info

Judge Result