提出 #31376347

---

ソースコード 拡げる

import sys
sys.setrecursionlimit(10 ** 9)
n, m = map(int, input().split())
e = [[] for i in range(n)]
for i in range(m):
    x, y, z = map(int, input().split())
    e[x - 1].append(y - 1)
    e[y - 1].append(x - 1)
visited = [0] * n
def dfs(v):
    global visited
    visited[v] = 1
    for u in e[v]:
        if visited[u] == 0:
            dfs(u)
answer = 0
for i in range(n):
    if visited[i] == 0:
        dfs(i)
        answer += 1
print(answer)

提出情報

ジャッジ結果