[백준][Python] 11724번 연결 요소의 개수 - DP

https://www.acmicpc.net/problem/11724

11724번: 연결 요소의 개수

 

Python

import sys
input = sys.stdin.readline
n, m = map(int, input().split())

graph = [[] for _ in range(n+1)]

for _ in range(m):
    a, b = map(int, input().split())
    graph[a].append(b)
    graph[b].append(a)


def di(start):
    now = start
    used = [0]*(n+1)
    for _ in range(n):
        visit[now] = 1
        used[now] = 1
        for x in graph[now]:
            visit[x] = 1

        old_now = now
        for i in range(1, n+1):
            if used[i] == 0 and visit[i] == 1:
                now = i
        if old_now == now:
            break


ans = 0
visit = [0]*(n+1)
for i in range(1, n+1):
    if visit[i] == 0:
        di(i)
        ans += 1
print(ans)